Pages that link to "Item:Q3942371"

The following pages link to Proving Liveness Properties of Concurrent Programs (Q3942371):

Displaying 50 items.

• Assurance of dynamic adaptation in distributed systems (Q436856) (← links)
• Linear temporal logic symbolic model checking (Q465680) (← links)
• Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement (Q533361) (← links)
• Attempting guards in parallel: A data flow approach to execute generalized guarded commands (Q688830) (← links)
• On the refinement of liveness properties of distributed systems (Q763239) (← links)
• A fair calculus of communicating systems (Q793508) (← links)
• A generalized nexttime operator in temporal logic (Q800722) (← links)
• A semantics for concurrent separation logic (Q879367) (← links)
• Branching versus linear logics yet again (Q911747) (← links)
• Processes with local and global liveness requirements (Q1007234) (← links)
• An approach to automating the verification of compact parallel coordination programs. I (Q1056221) (← links)
• Specification-oriented semantics for communicating processes (Q1060838) (← links)
• Defining liveness (Q1064056) (← links)
• On powerdomains and modality (Q1067409) (← links)
• Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs (Q1071491) (← links)
• Verification of multiprocess probabilistic protocols (Q1079944) (← links)
• The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
• Specification and verification of database dynamics (Q1092680) (← links)
• Proving entailment between conceptual state specifications (Q1095649) (← links)
• On the analysis of cooperation and antagonism in networks of communicating processes (Q1098279) (← links)
• A shared memory algorithm and proof for the generalized alternative construct in CSP (Q1100889) (← links)
• On conceptual model specification and verification (Q1100939) (← links)
• Fairness and the axioms of control predicates (Q1104729) (← links)
• Deadlock and fairness in morphisms of transition systems (Q1105379) (← links)
• Semantics and verification of monitors and systems of monitors and processes (Q1112588) (← links)
• Appraising fairness in languages for distributed programming (Q1112589) (← links)
• The power of temporal proofs (Q1118578) (← links)
• Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
• Concurrent systems and inevitability (Q1122355) (← links)
• Correctness of concurrent processes (Q1176236) (← links)
• Completing the temporal picture (Q1176248) (← links)
• Weakest preconditions for progress (Q1189258) (← links)
• The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\) (Q1190479) (← links)
• Specifying modules to satisfy interfaces: A state transition system approach (Q1193606) (← links)
• Axiomatic treatment of processes with shared variables revisited (Q1194205) (← links)
• Verification of distributed programs using representative interleaving sequences (Q1200917) (← links)
• Safety, liveness and fairness in temporal logic (Q1343862) (← links)
• A logic for reasoning about time and reliability (Q1343864) (← links)
• Formalizing process algebraic verifications in the calculus of constructions (Q1355748) (← links)
• A methodology for designing proof rules for fair parallel programs (Q1377299) (← links)
• Finite automata on timed \(\omega\)-trees (Q1395427) (← links)
• On relative and probabilistic finite counterability (Q1742987) (← links)
• Using partial orders for the efficient verification of deadlock freedom and safety properties (Q1801499) (← links)
• Weak and strong fairness in CCS (Q1822489) (← links)
• A formal model of atomicity in asynchronous systems (Q1838831) (← links)
• Distributed automata in an assumption-commitment framework (Q1847547) (← links)
• On fairness notions in distributed systems. I: A characterization of implementability (Q1854419) (← links)
• Compositional verification of real-time systems with explicit clock temporal logic (Q1918934) (← links)
• An axiomatic approach to existence and liveness for differential equations (Q1982634) (← links)
• Why there is no general solution to the problem of software verification (Q2151520) (← links)