Pages that link to "Item:Q1200917"
From MaRDI portal
The following pages link to Verification of distributed programs using representative interleaving sequences (Q1200917):
Displaying 17 items.
- Formal communication elimination and sequentialization equivalence proofs for distributed system models (Q466919) (← links)
- Using the causal domain to specify and verify distributed programs (Q678251) (← links)
- A proof system for distributed processes (Q1106014) (← links)
- On equivalence-completions of fairness assumptions (Q1205189) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- Proving partial order properties (Q1322161) (← links)
- Detecting causal relationships in distributed computations: In search of the holy grail (Q1331790) (← links)
- On projective and separable properties (Q1389766) (← links)
- On stubborn sets in the verification of linear time temporal properties (Q1774568) (← links)
- Combining static analysis and case-based search space partitioning for reducing peak memory in model checking (Q1884313) (← links)
- An application of temporal projection to interleaving concurrency (Q2403529) (← links)
- An input/output semantics for distributed program equivalence reasoning (Q2850665) (← links)
- Adding partial orders to linear temporal logic (Q6044113) (← links)
- An algorithmic approach for checking closure properties of Ω-regular languages (Q6162107) (← links)
- On Stubborn Sets in the Verification of Linear Time Temporal Properties (Q6487389) (← links)
- Trace consistency and inevitability (Q6567776) (← links)
- Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods (Q6649454) (← links)
