Pages that link to "Item:Q2277249"

The following pages link to Verification of concurrent programs: The automata-theoretic framework (Q2277249):

Displaying 38 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)
• Verification of sequential and concurrent programs (Q837527) (← links)
• Automata-based verification of programs with tree updates (Q845236) (← 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)
• Automata for true concurrency properties (Q1652979) (← links)
• A compositional approach to CTL\(^*\) verification (Q1770366) (← links)
• On the role of automated theorem proving in the compile-time derivation of concurrency (Q1819947) (← links)
• Verification by augmented finitary abstraction (Q1854391) (← links)
• On control of systems modelled as deterministic Rabin automata (Q1902499) (← links)
• Automatic and hierarchical verification for concurrent systems (Q2277847) (← 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)
• Formalization and correctness of a concurrent linear hash structure algorithm using nested transactions and I/O automata (Q2734633) (← links)
• Verification of parameterized concurrent programs by modular reasoning about data and control (Q2942881) (← links)
• Caper (Q2988651) (← links)
• Liveness-Preserving Atomicity Abstraction (Q3012940) (← links)
• Verifying Concurrent Systems with Symbolic Execution (Q3146300) (← links)
• Testing Systems of Concurrent Black-Boxes—An Automata-Theoretic and Decompositional Approach (Q3434609) (← links)
• Parameterized Verification of Communicating Automata under Context Bounds (Q3447694) (← links)
• (Q4326390) (← links)
• (Q4939274) (← links)
• Automated Verification of Concurrent Search Structures (Q5000450) (← links)
• Streett Automata Model Checking of Higher-Order Recursion Schemes (Q5111330) (← links)
• Formal verification of language-based concurrent noninterference (Q5195249) (← links)
• A GENERAL NOTION OF UNIFORM STRATEGIES (Q5406294) (← links)
• Robin Milner 1934--2010 (Q5408565) (← links)
• Automatically verifying temporal properties of pointer programs with cyclic proof (Q5919481) (← links)
• Verification by augmented abstraction: The automata-theoretic view (Q5946060) (← links)
• On the complexity of verifying concurrent transition systems (Q6044122) (← links)
• Liminf progress measures (Q6171780) (← links)
• Quantum temporal logic and reachability problems of matrix semigroups (Q6614888) (← links)
• Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification (Q6661749) (← links)