Pages that link to "Item:Q2277249"
From MaRDI portal
The following pages link to Verification of concurrent programs: The automata-theoretic framework (Q2277249):
Displaying 18 items.
- Inference of ranking functions for proving temporal properties by abstract interpretation (Q681349) (← links)
- On the refinement of liveness properties of distributed systems (Q763239) (← links)
- Deductive verification of alternating systems (Q939163) (← links)
- Model checking duration calculus: a practical approach (Q939170) (← links)
- Recognizing safety and liveness (Q1100884) (← links)
- Infinite trees, markings, and well-foundedness (Q1112586) (← links)
- A compositional approach to CTL\(^*\) verification (Q1770366) (← links)
- Verification by augmented finitary abstraction (Q1854391) (← links)
- On control of systems modelled as deterministic Rabin automata (Q1902499) (← links)
- Computability and realizability for interactive computations (Q2343137) (← links)
- Uniform strategies, rational relations and jumping automata (Q2346407) (← links)
- Verifying a scheduling protocol of safety-critical systems (Q2424721) (← links)
- Bridging the gap between fair simulation and trace inclusion (Q2486398) (← links)
- Liveness-Preserving Atomicity Abstraction (Q3012940) (← links)
- Streett Automata Model Checking of Higher-Order Recursion Schemes (Q5111330) (← links)
- A GENERAL NOTION OF UNIFORM STRATEGIES (Q5406294) (← links)
- Automatically verifying temporal properties of pointer programs with cyclic proof (Q5919481) (← links)
- Verification by augmented abstraction: The automata-theoretic view (Q5946060) (← links)
