Proofs of Networks of Processes
From MaRDI portal
Cited in
(69)- Processes with local and global liveness requirements
- The incompleteness of Misra and Chandy's proof systems
- A model and temporal proof system for networks of processes
- Compositional semantics for real-time distributed computing
- A proof technique for communicating sequential processes
- Correctness of concurrent processes
- A compositional axiomatization of statecharts
- A class of systems with nearly zero distributed simulation overhead
- Efficient distributed simulation of acyclic systems
- An explanatory presentation of composition rules for assumption- commitment specifications
- The Rely-Guarantee method for verifying shared variable concurrent programs
- A foundation for modular reasoning about safety and progress properties of state-based concurrent programs
- Theory and methodology of assumption/commitment based system interface specification and architectural contracts
- Automated circular assume-guarantee reasoning
- Conditions of contracts for separating responsibilities in heterogeneous systems
- Semantic models of a timed distributed dataspace architecture
- Applicability of fair simulation
- Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency
- A system for compositional verification of asynchronous objects
- Compositional reasoning for shared-variable concurrent programs
- RGITL: a temporal logic framework for compositional reasoning about interleaved programs
- Semantic specification and verification of data flow diagrams
- Using logic to solve the submodule construction problem
- Assume-guarantee reasoning with local specifications
- Protocol composition logic (PCL)
- Local symmetry and compositional verification
- Axiomatic semantics of projection temporal logic programs
- Compositional reasoning
- Model checking parameterized systems
- Compositional system security with interface-confined adversaries
- Modeling actor systems using dynamic I/O automata
- The Birth of Model Checking
- Processes with infinite liveness requirements
- An interface theory for service-oriented design
- Reasoning about programs by exploiting the environment
- Assume, guarantee or repair
- Application of the composition principle to unity-like specifications
- Towards a complete hierarchy of compositional dataflow models
- Logical foundations for compositional verification and development of concurrent programs in UNITY
- Assumption/guarantee specifications in linear-time temporal logic (extended abstract)
- Analysis of executable software models
- Compositional CSP traces refinement checking
- Assumption-commitment support for CSP model checking
- Automated circular assume-guarantee reasoning
- A contract-based approach to adaptivity
- Modular verification of multithreaded programs
- Conditional reactive simulatability
- An introduction to compositional methods for concurrency and their application to real-time.
- Compositional analysis for linear systems
- Automated program repair using formal verification techniques
- Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs
- Assumption/guarantee specifications in linear-time temporal logic
- A logical view of composition
- Automatic assume-guarantee reasoning for safety and liveness using passive learning
- Contract-based distributed logical controller synthesis
- Compositional reasoning using the assumption-commitment paradigm
- Lazy compositional verication
- Modular model checking
- Deductive verification of modular systems
- Compositional reasoning in model checking
- The need for compositional proof systems: a survey
- Compositional verification in rewriting logic
- Contract-based multi-agent logical controller synthesis under uncertainty
- ConcurrentHOL
- P-A logic - a compositional proof system for distributed programs
- A semantics for concurrent separation logic
- Resources, concurrency, and local reasoning
- Equational reasoning about nondeterministic processes
- Proof theory for exception handling in a tasking environment
This page was built for publication: Proofs of Networks of Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922150)
