Results 231 to 240 of about 192,874 (264)
Some of the next articles are maybe not open access.
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
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 +2 more sources
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 +2 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
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 +2 more sources
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 +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
1994
Fitting data by a certain generalized linear model means choosing appropriate forms for the predictor, the link function, and the exponential family or variance function. In the previous chapters Pearsons’s X 2, the deviance and, in the multinomial case, the power-divergence family were introduced as general goodness-of-fit statistics.
Ludwig Fahrmeir, Gerhard Tutz
openaire +1 more source
Fitting data by a certain generalized linear model means choosing appropriate forms for the predictor, the link function, and the exponential family or variance function. In the previous chapters Pearsons’s X 2, the deviance and, in the multinomial case, the power-divergence family were introduced as general goodness-of-fit statistics.
Ludwig Fahrmeir, Gerhard Tutz
openaire +1 more source
Model checking for performability
Mathematical Structures in Computer Science, 2013This paper gives a bird's-eye view of the various ingredients that make up a modern, model-checking-based approach to performability evaluation: Markov reward models, temporal logics and continuous stochastic logic, model-checking algorithms, bisimulation and the handling of non-determinism.
Christel Baier +4 more
openaire +3 more sources
Proceedings of the second international joint conference on Autonomous agents and multiagent systems, 2003
This paper introduces ASF, a variation of the BDI logic programming language ASL intended to permit the model-theoretic verification of multi-agent systems. After briefly introducing ASF and discussing its relationship to ASL, we show how ASF programs can be transformed into Prm, the model specification language for the Spin model-checking system.
Rafael H. Bordini +3 more
openaire +1 more source
This paper introduces ASF, a variation of the BDI logic programming language ASL intended to permit the model-theoretic verification of multi-agent systems. After briefly introducing ASF and discussing its relationship to ASL, we show how ASF programs can be transformed into Prm, the model specification language for the Spin model-checking system.
Rafael H. Bordini +3 more
openaire +1 more source
30th Annual International Computer Software and Applications Conference (COMPSAC'06), 2006
We have proposed inductive model checking (IMC) to alleviate the state explosion problem in model checking. IMC divides the whole verification tasks into several sub-tasks, and applies the three inductive steps (basis, hypothesis, and induction) to verify a system with model checking.
Kuangnan Chang, David Chenho Kung
openaire +1 more source
We have proposed inductive model checking (IMC) to alleviate the state explosion problem in model checking. IMC divides the whole verification tasks into several sub-tasks, and applies the three inductive steps (basis, hypothesis, and induction) to verify a system with model checking.
Kuangnan Chang, David Chenho Kung
openaire +1 more source

