The following pages link to (Q2768503):
Displaying 50 items.
- Mechanizing a process algebra for network protocols (Q287372) (← links)
- Generalised rely-guarantee concurrency: an algebraic foundation (Q333330) (← links)
- Formal communication elimination and sequentialization equivalence proofs for distributed system models (Q466919) (← links)
- Proving linearizability with temporal logic (Q539223) (← links)
- Elucidating concurrent algorithms via layers of abstraction and reification (Q539423) (← links)
- Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language (Q652158) (← links)
- An operational semantics for object-oriented concepts based on the class hierarchy (Q736789) (← links)
- Derivation of concurrent programs by stepwise scheduling of Event-B models (Q736912) (← links)
- Fine-grained concurrency with separation logic (Q763473) (← links)
- Integrating Owicki-Gries for C11-style memory models into Isabelle/HOL (Q832723) (← links)
- Splitting atoms safely (Q879357) (← links)
- Automated compositional proofs for real-time systems (Q882449) (← links)
- Balancing expressiveness in formal approaches to concurrency (Q890478) (← links)
- Compositional reasoning about active objects with shared futures (Q890481) (← links)
- Compositional verification of sequential programs with procedures (Q937300) (← links)
- Local proofs for global safety properties (Q1039842) (← links)
- Assumption-commitment support for CSP model checking (Q1040778) (← links)
- Theory and methodology of assumption/commitment based system interface specification and architectural contracts (Q1654563) (← links)
- Designing a semantic model for a wide-spectrum language with concurrency (Q1682288) (← links)
- Semantic models of a timed distributed dataspace architecture (Q1770360) (← links)
- A system for compositional verification of asynchronous objects (Q1951610) (← links)
- Verifying correctness of persistent concurrent data structures: a sound and complete method (Q1982636) (← links)
- (Co)inductive proof systems for compositional proofs in reachability logic (Q1996855) (← links)
- A unified approach of program verification (Q2013885) (← links)
- Encoding fairness in a synchronous concurrent program algebra (Q2024348) (← links)
- RGITL: a temporal logic framework for compositional reasoning about interleaved programs (Q2251128) (← links)
- Compositional reasoning using intervals and time reversal (Q2251129) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- A verification-driven framework for iterative design of controllers (Q2335947) (← links)
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos (Q2377304) (← links)
- An application of temporal projection to interleaving concurrency (Q2403529) (← links)
- A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency (Q2414249) (← links)
- A framework for compositional verification of security protocols (Q2482454) (← links)
- Towards a Thread-Local Proof Technique for Starvation Freedom (Q2814127) (← links)
- Proving Reachability-Logic Formulas Incrementally (Q2827839) (← links)
- Towards a Hybrid Dynamic Logic for Hybrid Dynamic Systems (Q2867948) (← links)
- Formal Sequentialization of Distributed Systems via Program Rewriting (Q2867960) (← links)
- Local Symmetry and Compositional Verification (Q2891426) (← links)
- On Rely-Guarantee Reasoning (Q2941165) (← links)
- Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs (Q3000591) (← links)
- A Coinductive Calculus for Asynchronous Side-Effecting Processes (Q3088290) (← links)
- Formal Verification of a Lock-Free Stack with Hazard Pointers (Q3105753) (← links)
- Compositional Reasoning (Q3176370) (← links)
- AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES (Q3395145) (← links)
- Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification (Q3535380) (← links)
- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties (Q3602799) (← links)
- Contracts for BIP: Hierarchical Interaction Models for Compositional Verification (Q3614835) (← links)
- Convolution and concurrency (Q5084483) (← links)
- Compositional CSP Traces Refinement Checking (Q5178982) (← links)
- Assumption-Commitment Support for CSP Model Checking (Q5178998) (← links)
