scientific article; zbMATH DE number 3926220
From MaRDI portal
Publication:3700812
Recommendations
Cited in
(66)- Local proofs for global safety properties
- An explanatory presentation of composition rules for assumption- commitment specifications
- Program composition via unification
- Proving properties of dynamic process networks
- A foundation for modular reasoning about safety and progress properties of state-based concurrent programs
- Composing leads-to properties
- Automated circular assume-guarantee reasoning
- Verification of asynchronous systems with an unspecified component
- Conditions of contracts for separating responsibilities in heterogeneous systems
- Syntax-directed model checking of sequential programs
- Applicability of fair simulation
- Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency
- Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm
- Compositional reasoning for shared-variable concurrent programs
- Compositional verification of concurrent systems by combining bisimulations
- Cartesian difference categories
- RGITL: a temporal logic framework for compositional reasoning about interleaved programs
- Compositional reasoning using intervals and time reversal
- Compositional verification and 3-valued abstractions join forces
- A verification-driven framework for iterative design of controllers
- On the universal and existential fragments of the \(\mu\)-calculus
- Compositional analysis of C/C++ programs with veriSoft
- A framework for compositional verification of multi-valued systems via abstraction-refinement
- Fault-tolerant aggregate signatures
- Compositional failure-based equivalence of constraint automata
- Compositional reasoning
- Hierarchical network formation games
- The Birth of Model Checking
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Compositional Verification for Component-Based Systems and Application
- Improved model checking of hierarchical systems
- Synthesis of Reactive(1) designs
- Reasoning about programs by exploiting the environment
- Search strategies for resolution in temporal logics
- Automatic verification of reduction techniques in higher order logic
- Assume, guarantee or repair
- Compositional specification in rewriting logic
- Parametric linear dynamic logic
- Sharp congruences adequate with temporal logics combining weak and strong modalities
- Program composition via unification
- Automated circular assume-guarantee reasoning
- Modularity for timed and hybrid systems
- Automated program repair using formal verification techniques
- Modular verification for shared-variable concurrent programs
- A compositional partial order semantics for Petri net components
- Learning assumptions for compositional verification of timed automata
- Compositional verification of concurrent systems by combining bisimulations
- APML: an architecture proof modeling language
- On using temporal logic for refinement and compositional verification of concurrent systems
- 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
- Compositional proofs for concurrent objects
- Deductive verification of modular systems
- A compositional real-time semantics of STATEMATE designs
- Compositional reasoning in model checking
- The need for compositional proof systems: a survey
- Compositional verification in rewriting logic
- Safe orchestrated multicomposition of systems of communicating finite state machines
- Compositional reasoning for parametric probabilistic automata
- Contract-based multi-agent logical controller synthesis under uncertainty
- CEGAR for compositional analysis of qualitative properties in Markov decision processes
- Three optimizations for assume-guarantee reasoning with \(L^{*}\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3700812)
