Liminf progress measures

DOI10.1007/3-540-55511-0_25zbMath1518.68054OpenAlexW1503889025MaRDI QIDQ6171780

Nils Klarlund

Publication date: 16 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55511-0_25

Mathematics Subject Classification ID

Descriptive set theory (03E15) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Solving mean-payoff games via quasi dominions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adequate proof principles for invariance and liveness properties of concurrent programs
• Fair termination revisited - with delay
• The existence of refinement mappings
• Proof rules and transformations dealing with fairness
• Recognizing safety and liveness
• Infinite trees, markings, and well-foundedness
• The \(\mu\)-calculus as an assertion-language for fairness arguments
• Metric interpretations of infinite trees and semantics of non deterministic recursive programs
• Descriptive set theory
• Verification of concurrent programs: The automata-theoretic framework
• Temporal logic can be more expressive
• A proof rule for fair termination of guarded commands
• Countable nondeterminism and random assignment
• Verifying temporal properties without temporal logic
• Ten Years of Hoare's Logic: A Survey—Part I
• Progress measures and stack assertions for fair termination
• An axiomatic basis for computer programming
• Decision problems forω-automata
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: Liminf progress measures