Conditions of contracts for separating responsibilities in heterogeneous systems
From MaRDI portal
Publication:1742989
DOI10.1007/s10703-017-0294-7zbMath1390.68442DBLPjournals/fmsd/WestmanN18OpenAlexW2740333172WikidataQ59612349 ScholiaQ59612349MaRDI QIDQ1742989
Publication date: 12 April 2018
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-017-0294-7
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algebraic theory of interface automata
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects
- Assumption/guarantee specifications in linear-time temporal logic
- The existence of refinement mappings
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Compositional verification of sequential programs with procedures
- Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
- A calculus of communicating systems
- Proving assertions about parallel programs
- An axiomatic proof technique for parallel programs
- Contracts, games, and refinement.
- Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency
- Taming Dr. Frankenstein: contract-based design for cyber-physical systems
- Probabilistic contracts for component-based design
- Specification and Development of Interactive Systems
- A Modal Interface Theory for Component-based Design
- On the completeness of compositional reasoning methods
- Timed I/O automata
- Multiple Viewpoint Contract-Based Specification and Design
- Contracts for BIP: Hierarchical Interaction Models for Compositional Verification
- Tentative steps toward a development method for interfering programs
- A Theory of Communicating Sequential Processes
- Proofs of Networks of Processes
- Guarded commands, nondeterminacy and formal derivation of programs
- Proving the Correctness of Multiprocess Programs
- Compositional refinement of interactive systems
- Refinement Calculus
- The Algebra of Connectors—Structuring Interaction in BIP
- An automata-theoretic approach to branching-time model checking
- An axiomatic basis for computer programming
- CONCUR 2003 - Concurrency Theory
This page was built for publication: Conditions of contracts for separating responsibilities in heterogeneous systems