Pages that link to "Item:Q4120115"

The following pages link to Proving the Correctness of Multiprocess Programs (Q4120115):

Displaying 50 items.

• Deciding safety and liveness in TPTL (Q402360) (← links)
• Linear temporal logic symbolic model checking (Q465680) (← links)
• Which security policies are enforceable by runtime monitors? A survey (Q465692) (← links)
• Runtime enforcement monitors: Composition, synthesis, and enforcement abilities (Q548696) (← links)
• Coalgebraic semantics of modal logics: an overview (Q639647) (← links)
• The mailbox problem (Q661002) (← links)
• Inference of ranking functions for proving temporal properties by abstract interpretation (Q681349) (← links)
• Another glance at the Alpern-Schneider characterization of safety and liveness in concurrent executions (Q688439) (← links)
• Turing machines, transition systems, and interaction (Q703844) (← links)
• On the refinement of liveness properties of distributed systems (Q763239) (← links)
• The existence of refinement mappings (Q805251) (← links)
• Safety and liveness of \(\omega\)-context-free languages (Q811129) (← links)
• A predicate transformer for progress (Q909441) (← links)
• Defining liveness (Q1064056) (← links)
• Safety without stuttering (Q1089789) (← links)
• Atomic semantics of nonatomic programs (Q1111361) (← links)
• The temporal semantics of concurrent programs (Q1143164) (← links)
• Adequacy-preserving transformations of COSY path programs (Q1185020) (← links)
• Sooner is safer than later (Q1199553) (← links)
• Inference of \(\omega\)-languages from prefixes. (Q1426153) (← links)
• Control design for nondeterministic input/output automata (Q1662972) (← links)
• Conditions of contracts for separating responsibilities in heterogeneous systems (Q1742989) (← links)
• On the limits of refinement-testing for model-checking CSP (Q1941896) (← links)
• The weakest failure detector for eventual consistency (Q2010607) (← links)
• Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
• A proof system for disjoint parallel quantum programs (Q2055965) (← links)
• Integration of formal proof into unified assurance cases with Isabelle/SACM (Q2065527) (← links)
• Razumikhin and Krasovskii approaches for safe stabilization (Q2097718) (← links)
• Last-use opacity: a strong safety property for transactional memory with prerelease support (Q2146873) (← links)
• Monitorable hyperproperties of nonterminating systems (Q2168793) (← links)
• Probabilistic Lipschitz analysis of neural networks (Q2233541) (← links)
• Fifty years of Hoare's logic (Q2280214) (← links)
• Model checking of linear-time properties in multi-valued systems (Q2282319) (← links)
• Two-process synchronization (Q2357145) (← links)
• Implementing dataflow with threads (Q2377253) (← links)
• Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos (Q2377304) (← links)
• Bounded variability of metric temporal logic (Q2408743) (← links)
• Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (Q2418047) (← links)
• Model checking with fairness assumptions using PAT (Q2418662) (← links)
• LTL is closed under topological closure (Q2448112) (← links)
• A complete characterization of deterministic regular liveness properties (Q2465051) (← links)
• Execution monitoring enforcement under memory-limitation constraints (Q2482440) (← links)
• Interfaces as functors, programs as coalgebras -- a final coalgebra theorem in intensional type theory (Q2503336) (← links)
• Programming interfaces and basic topology (Q2575770) (← links)
• Fairness and communication-based semantics for session-typed languages (Q2672270) (← links)
• Mitigating Multi-target Attacks in Hash-Based Signatures (Q2798784) (← links)
• The F-Snapshot Problem (Q2835024) (← links)
• Local Symmetry and Compositional Verification (Q2891426) (← links)
• Model-Checking Linear-Time Properties of Quantum Systems (Q2946731) (← links)
• An abstract interpretation-based model for safety semantics (Q2995468) (← links)