Pages that link to "Item:Q1123589"
From MaRDI portal
The following pages link to On verifying that a concurrent program satisfies a nondeterministic specification (Q1123589):
Displaying 6 items.
- On the refinement of liveness properties of distributed systems (Q763239) (← links)
- Proving correctness with respect to nondeterministic safety specifications (Q1182117) (← links)
- Verification of concurrent programs: The automata-theoretic framework (Q2277249) (← links)
- Classes of Timed Automata and the Undecidability of Universality (Q2842589) (← links)
- Highly Undecidable Problems For Infinite Computations (Q3625697) (← links)
- Verification by augmented abstraction: The automata-theoretic view (Q5946060) (← links)
