Results 1  10
of
21
Compositional Model Checking
, 1999
"... We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approac ..."
Abstract

Cited by 3218 (68 self)
 Add to MetaCart
(Show Context)
We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approach is that local properties are often not preserved at the global level. We present a general framework for using additional interface processes to model the environment for a component. These interface processes are typically much simpler than the full environment of the component. By composing a component with its interface processes and then checking properties of this composition, we can guarantee that these properties will be preserved at the global level. We give two example compositional systems based on the logic CTL*.
Verification Tools for FiniteState Concurrent Systems
"... Temporal logic model checking is an automatic technique for verifying finitestate concurrent systems. Specifications are expressed in a propositional temporal logic, and the concurrent system is modeled as a statetransition graph. An efficient search procedure is used to determine whether or not t ..."
Abstract

Cited by 129 (3 self)
 Add to MetaCart
(Show Context)
Temporal logic model checking is an automatic technique for verifying finitestate concurrent systems. Specifications are expressed in a propositional temporal logic, and the concurrent system is modeled as a statetransition graph. An efficient search procedure is used to determine whether or not the statetransition graph satisfies the specification. When the technique was first developed ten years ago, it was only possible to handle concurrent systems with a few thousand states. In the last few years, however, the size of the concurrent systems that can be handled has increased dramatically. By representing transition relations and sets of states implicitly using binary decision diagrams, it is now possible to check concurrent systems with more than 10 120 states. In this paper we describe in detail how the new implementation works and
Automatic verification of sequential circuits using temporal logic
 Dubois ACM Computing Surveys
, 1997
"... Automatic verification of sequential circuits using temporal logic ..."
Abstract

Cited by 84 (13 self)
 Add to MetaCart
(Show Context)
Automatic verification of sequential circuits using temporal logic
On the Decision Problem for TwoVariable FirstOrder Logic
, 1997
"... We identify the computational complexity of the satisfiability problem for FO², the fragment of firstorder logic consisting of all relational firstorder sentences with at most two distinct variables. Although this fragment was shown to be decidable a long time ago, the computational complexity ..."
Abstract

Cited by 78 (1 self)
 Add to MetaCart
We identify the computational complexity of the satisfiability problem for FO², the fragment of firstorder logic consisting of all relational firstorder sentences with at most two distinct variables. Although this fragment was shown to be decidable a long time ago, the computational complexity of its decision problem has not been pinpointed so far. In 1975 Mortimer proved that FO² has the finitemodel property, which means that if an FO²sentence is satisfiable, then it has a finite model. Moreover, Mortimer showed that every satisfiable FO²sentence has a model whose size is at most doubly exponential in the size of the sentence. In this paper, we improve Mortimer's bound by one exponential and show that every satisfiable FO²sentence has a model whose size is at most exponential in the size of the sentence. As a consequence, we establish that the satisfiability problem for FO² is NEXPTIMEcomplete.
BDDBased Decision Procedures for the Modal Logic K
 Journal of Applied Nonclassical Logics
, 2005
"... We describe BDDbased decision procedures for the modal logic K. Our approach is inspired by the automatatheoretic approach, but we avoid explicit automata construction. Instead, we compute certain fixpoints of a set of typeswhich can be viewed as an onthefly emptiness of the automaton. We use ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
We describe BDDbased decision procedures for the modal logic K. Our approach is inspired by the automatatheoretic approach, but we avoid explicit automata construction. Instead, we compute certain fixpoints of a set of typeswhich can be viewed as an onthefly emptiness of the automaton. We use BDDs to represent and manipulate such type sets, and investigate different kinds of representations as well as a "levelbased" representation scheme. The latter turns out to speed up construction and reduce memory consumption considerably. We also study the effect of formula simplification on our decision procedures. To proof the viability of our approach, we compare our approach with a representative selection of other approaches, including a translation of to QBF. Our results indicate that the BDDbased approach dominates for modally heavy formulae, while searchbased approaches dominate for propositionally heavy formulae.
Timing Verification Using HDTV
 Proc. 27th Design Automation Conference
, 1990
"... In this paper, we provide an overview of a system designed for verifying the consistency of timing specifications for digital circuits. The utility of the system comes from the need to verify that existing digital components will interact correctly when placed together in a system. The system can al ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
In this paper, we provide an overview of a system designed for verifying the consistency of timing specifications for digital circuits. The utility of the system comes from the need to verify that existing digital components will interact correctly when placed together in a system. The system can also be used in the case of verifying specifications of unimplemented components. 1
Specification and Verification of Realtime Embedded Systems using Timeconstrained Reactive Automata
, 1991
"... The vital role that realtime embedded systems are playing and will continue to play in our world, coupled with their increasingly complex and critical nature, demand a rigorous and systematic treatment that recognizes their unique requirements. The Timeconstrained Reactive Automaton (TRA) is a for ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
(Show Context)
The vital role that realtime embedded systems are playing and will continue to play in our world, coupled with their increasingly complex and critical nature, demand a rigorous and systematic treatment that recognizes their unique requirements. The Timeconstrained Reactive Automaton (TRA) is a formal model of computation that admits these requirements. Among its salient features is a fundamental notion of space and time that restricts the expressiveness of the model in a way that allows the specification of only reactive, spontaneous, and causal computations. Using the TRA formalism, there is no conceptual distinction between a system and a property; both are specified as formal objects. This reduces the verification process to that of establishing correspondences  namely preservation and implementation relationships  between such objects. In this paper, we present the TRA model and briefly overview our experience in using it in the specification and verification of realtime embedded systems.
Hardware Design Based on Verilog HDL
, 1998
"... Up to a few years ago, the approaches taken to check whether a hardware component works as expected could be classified under one of two styles: hardware engineers in the industry would tend to exclusively use simulation to (empirically) test their circuits, whereas computer scientists would tend to ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Up to a few years ago, the approaches taken to check whether a hardware component works as expected could be classified under one of two styles: hardware engineers in the industry would tend to exclusively use simulation to (empirically) test their circuits, whereas computer scientists would tend to advocate an approach based almost exclusively on formal verification. This thesis proposes a unified approach to hardware design in which both simulation and formal verification can coexist. Relational Duration Calculus (an extension of Duration Calculus) is developed and used to define the formal semantics of Verilog HDL (a standard industry hardware description language). Relational Duration Calculus is a temporal logic which can deal with certain issues raised by the behaviour of typical hardware description languages and which are hard to describe in a pure temporal logic. These semantics are then used to unify the simulation of Verilog programs, formal verification and the use of algebraic laws during the design stage.
An Automata Theoretic Approach to Temporal Logic
 PROCEEDINGS OF 3 RD WORKSHOP ON COMPUTER AIDED VERIFICATION (CAV91), VOLUME 575 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1991
"... A syntax directed mapping is presented from Propositional Temporal Logic (PTL) formulae to Müller type finite automata. This is a direct and much more elegant and easier to implement approach than previously described methods. Most of these methods are based on tableau methods for satisfiability che ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
A syntax directed mapping is presented from Propositional Temporal Logic (PTL) formulae to Müller type finite automata. This is a direct and much more elegant and easier to implement approach than previously described methods. Most of these methods are based on tableau methods for satisfiability checking, and after that a Buchi type of automaton is extracted. Büchi and Müller automata are equally expressive. However, Müller automata have nicer properties than Büchi automata, for instance deterministic Müller automata are expressive as nondeterministic ones, while this is not true for Büchi automata. Also deterministic Büchi automata are not closed under complement. This transformation is the first step in a decision procedure, since the resulting Müller automaton represents the models of the temporal logic formula, and on which further verification and analysis can be performed.
A Runtime Environment for a Validation Language
, 1993
"... Our Department is currently engaged in a project to validate the correctness of reactive systems, specifically operating system kernels. Model checking is used as a validation technique. A model checker was implemented using transition systems as a modelling formalism and computation tree logic (CTL ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Our Department is currently engaged in a project to validate the correctness of reactive systems, specifically operating system kernels. Model checking is used as a validation technique. A model checker was implemented using transition systems as a modelling formalism and computation tree logic (CTL) to specify correctness requirements. Although transition systems are powerful enough to specify the behaviour of reactive systems, it is inconvenient to use because it is too low level. Therefore a highlevel validation language is required. Since the behaviour of an operating system kernel is often dependent on the manipulation of complex data the validation language must support complex data structures. This thesis describes the design and implementation...