Results 271 to 280 of about 221,743 (312)
Some of the next articles are maybe not open access.
1999
Model checking is traditionally applied to computer system design. It has proven to be a valuable technique. However, it requires detailed specifications of systems and requirements, and is therefore not very accessible. In this paper we show how model checking can be applied in the context of business modeling and analysis by people that are not ...
Janssen, W. +4 more
openaire +2 more sources
Model checking is traditionally applied to computer system design. It has proven to be a valuable technique. However, it requires detailed specifications of systems and requirements, and is therefore not very accessible. In this paper we show how model checking can be applied in the context of business modeling and analysis by people that are not ...
Janssen, W. +4 more
openaire +2 more sources
2003
Safety is increasingly important for software based, critical systems. Fault tree analysis (FTA) is a safety technique from engineering, developed for analyzing and assessing system safety by uncovering safety flaws and weaknesses of the system. The main drawback of this analysis technique is, that it is based on informal grounds, so safety flaws may ...
Thums, Andreas, Schellhorn, Gerhard
openaire +2 more sources
Safety is increasingly important for software based, critical systems. Fault tree analysis (FTA) is a safety technique from engineering, developed for analyzing and assessing system safety by uncovering safety flaws and weaknesses of the system. The main drawback of this analysis technique is, that it is based on informal grounds, so safety flaws may ...
Thums, Andreas, Schellhorn, Gerhard
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 +1 more source
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 +1 more source
[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 +1 more source
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 +1 more source
Checking and Distributing Statistical Model Checking
2012In this paper we propose a general framework for distributed statistical model checking of networks of priced timed automata. The first contribution is a new algorithm to distribute sequential hypothesis testing without introducing bias in the results. The second contribution is an implementation of this algorithm in Uppaal.
Peter E. Bulychev +5 more
openaire +1 more source
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 +2 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 +2 more sources
ACM SIGSOFT Software Engineering Notes, 2012
We introduce ranged model checking, a novel technique for more effective checking of Java programs using the Java PathFinder (JPF) model checker. Our key insight is that the order in which JPF makes non-deterministic choices denes a total ordering of execution paths it explores in the program it checks.
Diego Funes +2 more
openaire +1 more source
We introduce ranged model checking, a novel technique for more effective checking of Java programs using the Java PathFinder (JPF) model checker. Our key insight is that the order in which JPF makes non-deterministic choices denes a total ordering of execution paths it explores in the program it checks.
Diego Funes +2 more
openaire +1 more source
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 +1 more source
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 +1 more source
Formal Methods in System Design, 1993
We show how to exploit symmetry in model checking for concurrent systems containing many identical or isomorphic components. We focus in particular on those composed of many isomorphic processes. In many cases we are able to obtain significant, even exponential, savings in the complexity of model checking.
E. Allen Emerson, A. Prasad Sistla
openaire +1 more source
We show how to exploit symmetry in model checking for concurrent systems containing many identical or isomorphic components. We focus in particular on those composed of many isomorphic processes. In many cases we are able to obtain significant, even exponential, savings in the complexity of model checking.
E. Allen Emerson, A. Prasad Sistla
openaire +1 more source