Results 181 to 190 of about 3,818 (217)
Some of the next articles are maybe not open access.
[1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, 2003
Abstract: "We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. Thegoal is to check properties of the components of a system and then deduce globalproperties from these local properties.
Edmund M. Clarke +2 more
openaire +2 more sources
Abstract: "We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. Thegoal is to check properties of the components of a system and then deduce globalproperties from these local properties.
Edmund M. Clarke +2 more
openaire +2 more sources
Model checking and abstraction
ACM Transactions on Programming Languages and Systems, 1992We describe a method for using abstraction to reduce the complexity of temporal-logic model checking. Using techniques similar to those involved in abstract interpretation, we construct an abstract model of a program without ever examining the corresponding unabstracted model.
Edmund M. Clarke +2 more
openaire +2 more sources
1998
In modular verification the specification of a module consists of two parts. One part describes the guaranteed behavior of the module. The other part describes the assumed behavior of the system in which the module is interacting. This is called the assume-guarantee paradigm.
Orna Kupferman, Moshe Y. Vardi
openaire +2 more sources
In modular verification the specification of a module consists of two parts. One part describes the guaranteed behavior of the module. The other part describes the assumed behavior of the system in which the module is interacting. This is called the assume-guarantee paradigm.
Orna Kupferman, Moshe Y. Vardi
openaire +2 more sources
Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering, 2000
This paper presents initial results in model checking multi-threaded Java programs. Java programs are translated into the SAL (Symbolic Analysis Laboratory) intermediate language, which supports dynamic constructs such as object instantiations and thread call stacks.
David Y. W. Park +3 more
openaire +2 more sources
This paper presents initial results in model checking multi-threaded Java programs. Java programs are translated into the SAL (Symbolic Analysis Laboratory) intermediate language, which supports dynamic constructs such as object instantiations and thread call stacks.
David Y. W. Park +3 more
openaire +2 more sources
International Journal on Software Tools for Technology Transfer, 2011
Regular model checking has been studied extensively during recent years as a framework for algorithmic verification of systems with infinite state spaces. We describe the main concepts of the framework, and some of its applications.
openaire +2 more sources
Regular model checking has been studied extensively during recent years as a framework for algorithmic verification of systems with infinite state spaces. We describe the main concepts of the framework, and some of its applications.
openaire +2 more sources
2003
Symbolic model checking with Binary Decision Diagrams (BDDs) has been successfully used in the last decade for formally verifying finite state systems such as sequential circuits and protocols. Since its introduction in the beginning of the 90’s, it has been integrated in the quality assurance process of several major hardware companies.
Armin Biere +4 more
openaire +3 more sources
Symbolic model checking with Binary Decision Diagrams (BDDs) has been successfully used in the last decade for formally verifying finite state systems such as sequential circuits and protocols. Since its introduction in the beginning of the 90’s, it has been integrated in the quality assurance process of several major hardware companies.
Armin Biere +4 more
openaire +3 more sources
Model Checking and Preprocessing
2007Temporal Logic Model Checking is a verification method having many industrial applications. This method describes a system as a formal structure called model; some properties, expressed in a temporal logic formula, can be then checked over this model.
ANDREA FERRARA +2 more
openaire +2 more sources
2003
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” but it also appears in many other situations. By considering several extended temporal logics, we show that the problem of model checking a path can usually be solved efficiently ...
Nicolas Markey, Philippe Schnoebelen
openaire +1 more source
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” but it also appears in many other situations. By considering several extended temporal logics, we show that the problem of model checking a path can usually be solved efficiently ...
Nicolas Markey, Philippe Schnoebelen
openaire +1 more source
Model checking and equivalence checking
2009Introduction Owing to the advances in semiconductor technology, a large and complex system that has a wide variety of functionalities has been integrated on a single chip. It is called system-on-a-chip (SoC) or system LSI , since all of the components in an electronics system are built on a single chip.
openaire +1 more source
ACM Inroads, 2010
Model checking is a widely used formal method for the verification of concurrent programs. This article starts with an introduction to the concepts of model checking, followed by a description of Spin, one of the foremost model checkers. Software tools for teaching concurrency and nondeterminism using model checking are described: Erigone, a model ...
openaire +2 more sources
Model checking is a widely used formal method for the verification of concurrent programs. This article starts with an introduction to the concepts of model checking, followed by a description of Spin, one of the foremost model checkers. Software tools for teaching concurrency and nondeterminism using model checking are described: Erigone, a model ...
openaire +2 more sources