Results 1  10
of
706,648
AssumeGuarantee Based Compositional Reasoning for Synchronous Timing Diagrams
"... The explosion in the number of states due to several interacting components limits the application of model checking in practice. Compositional reasoning ameliorates this problem by reducing reasoning about the entire system to reasoning about individual components. Such reasoning is often carried o ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
how to apply it, in a fully automated manner, to properties specified as synchronous timing diagrams. We show that timing diagram properties have a natural decomposition into assumeguarantee pairs, and liveness restrictions that result in simple subgoals which can be checked efficiently. We have
Assumeguarantee reasoning for deadlock
 IN: PROC. OF FMCAD.
, 2006
"... We extend the learningbased automated assume guarantee paradigm to perform compositional deadlock detection. We define Failure Automata, a generalization of finite automata that accept regular failure sets. We develop a learning algorithm L F that constructs the minimal deterministic failure autom ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
We extend the learningbased automated assume guarantee paradigm to perform compositional deadlock detection. We define Failure Automata, a generalization of finite automata that accept regular failure sets. We develop a learning algorithm L F that constructs the minimal deterministic failure
Decomposing Refinement Proofs using AssumeGuarantee Reasoning
, 2000
"... Modelchecking algorithms can be used to verify, formally and automatically, if a lowlevel description of a design conforms with a highlevel description. However, for designs with very large state spaces, prior to the application of an algorithm, the refinementchecking task needs to be decomposed ..."
Abstract

Cited by 32 (2 self)
 Add to MetaCart
assuming the correctness of A. The assumeguarantee paradigm provides a systematic theory and methodology for ensuring the soundness of the circular style of postulating and discharging assumptions in componentbased reasoning. We give a tutorial introduction to the assumeguarantee paradigm
1AssumeGuarantee Reasoning for Deadlock
"... Abstract — We extend the learningbased automated assume guarantee paradigm to perform compositional deadlock detection. We define Failure Automata, a generalization of finite automata that accept regular failure sets. We develop a learning algorithm LF that constructs the minimal deterministic fai ..."
Abstract
 Add to MetaCart
Abstract — We extend the learningbased automated assume guarantee paradigm to perform compositional deadlock detection. We define Failure Automata, a generalization of finite automata that accept regular failure sets. We develop a learning algorithm LF that constructs the minimal deterministic
AssumeGuarantee Reasoning with Local Specifications
"... Abstract. We investigate assumeguarantee reasoning for global specifications consisting of conjunctions of local specifications. We present a sound and complete assumeguarantee rule that permits reasoning about individual modules for local specifications and draws conclusions on global specificati ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We investigate assumeguarantee reasoning for global specifications consisting of conjunctions of local specifications. We present a sound and complete assumeguarantee rule that permits reasoning about individual modules for local specifications and draws conclusions on global
AssumeGuarantee Model Checking
, 2003
"... We present assumeguarantee model checking, a novel technique for verifying correctness properties of looselycoupled multithreaded software systems. Assumeguarantee model checking verifies each thread of a multithreaded system separately by constraining the actions of other threads with an aut ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present assumeguarantee model checking, a novel technique for verifying correctness properties of looselycoupled multithreaded software systems. Assumeguarantee model checking verifies each thread of a multithreaded system separately by constraining the actions of other threads
algorithm to automate assumeguarantee reasoning
, 2008
"... conquer: applying the L algorithm to automate ..."
AssumeGuarantee Refinement Between Different Time Scales
, 1999
"... Refinement checking is used to verify implementations against more abstract specifications. Assumeguarantee reasoning is used to decompose re nement proofs in order to avoid statespace explosion. In previous approaches, specifications are forced to operate on the same time scale as the implementa ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
Refinement checking is used to verify implementations against more abstract specifications. Assumeguarantee reasoning is used to decompose re nement proofs in order to avoid statespace explosion. In previous approaches, specifications are forced to operate on the same time scale
Assumeguarantee verification for probabilistic systems
, 2009
"... Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assumeguarantee approach to verification, where both the assumptions made about system components and the guarantees that they provide are regular sa ..."
Abstract

Cited by 41 (15 self)
 Add to MetaCart
safety properties, represented by finite automata. Unlike previous proposals for assumeguarantee reasoning about probabilistic systems, our approach does not require that components interact in a fully synchronous fashion. In addition, the compositional verification method is efficient and fully
Compositional and AssumeGuarantee Reasoning for Switching Linear Systems
"... Abstract: Modular modeling techniques play an important role in the analysis of engineering processes as well as in control applications. While individual components of aggregated models can be relatively simple, complexity increases significantly when interconnections are considered. To address the ..."
Abstract
 Add to MetaCart
to approximate interconnections of systems based on approximations of the individual components. While results with regard to compositional analysis have been presented for discrete and recently also for continuoustime systems, it is our aim to develop compositional and assumeguarantee reasoning for a specific
Results 1  10
of
706,648