Results 31 to 40 of about 1,197,742 (268)

Modular Checking with Model Checking

Electronic Notes in Theoretical Computer Science, 2009
AbstractAutomatic static checkers based on model checking, particularly SAT-based bounded model checkers, are used in industry, but they sometimes suffer from the scalability problem. Scalability can be achieved with the notions of Design by Contract(DbC) and modular checking. However, modular checking with DbC still have some problems.
Hashimoto, Yuusuke, Nakajima, Shin
openaire   +1 more source

Model checking polygonal differential inclusions using invariance kernels [PDF]

, 2004
Polygonal hybrid systems are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. Here, we identify and compute an important object of such systems’ phase portrait, namely invariance kernels.
Fifth International Conference on Verification, Model Checking and Abstract Interpretation, Pace, Gordon J., Schneider, Gerardo   +2 more
core   +1 more source

Fluid Model Checking

, 2012
In this paper we investigate a potential use of fluid approximation techniques in the context of stochastic model checking of CSL formulae. We focus on properties describing the behaviour of a single agent in a (large) population of agents, exploiting a limit result known also as fast simulation.
BORTOLUSSI, LUCA, J. Hillston
openaire   +5 more sources

Towards Light-Weight Probabilistic Model Checking

Journal of Applied Mathematics, 2014
Model checking has been extensively used to verify various systems. However, this usually has been done by experts who have a good understanding of model checking and who are familiar with the syntax of both modelling and property specification languages.
Savas Konur
doaj   +1 more source

Model Checking CTL is Almost Always Inherently Sequential [PDF]

, 2011
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations---restrictions already ...
A. L. Selman, A. Meier, M. Mundhenk, M. Thomas, and H., A. Sistla and E. Clarke, Arne Meier, E. A. Emerson and C.-L. Lei, E. A. Emerson and E. M. Clarke, E. A. Emerson and J. Y. Halpern, E. A. Emerson and J. Y. Halpern, E. Clarke, E. A. Emerson, and A. Sistla, F. Laroussinie, H. Schnoor, Heribert Vollmer, K. Regan and H. Vollmer, Martin Mundhenk, Michael Thomas, N. Markey, Neil Immerman, O. Kupferman, M. Y. Vardi, and P. Wolper, Olaf Beyersdorff, Thomas Schneider, W. L. Ruzzo   +20 more
core   +5 more sources

Advancing verification of process mining models with quantitative model checking in stochastic environment [PDF]

ITM Web of Conferences
The study of business process analysis and optimization has attracted significant scholarly interest in the recent past, due to its integral role in boosting organizational performance.
Mangi Fawad Ali, Su Guoxin, Zhang Minjie
doaj   +1 more source

Model Checking in Bits and Pieces [PDF]

Electronic Proceedings in Theoretical Computer Science, 2013
Fully automated verification of concurrent programs is a difficult problem, primarily because of state explosion: the exponential growth of a program state space with the number of its concurrently active components.
Kedar S. Namjoshi
doaj   +1 more source

Quantifying Information Leaks Using Reliability Analysis [PDF]

, 2014
acmid: 2632367 keywords: Model Counting, Quantitative Information Flow, Reliability Analysis, Symbolic Execution location: San Jose, CA, USA numpages: 4acmid: 2632367 keywords: Model Counting, Quantitative Information Flow, Reliability Analysis, Symbolic
d Amorim, M, Malacaria, P, Pasareanu, CS, Phan, Q-S, SPIN 2014 Proceedings of the 2014 International SPIN Symposium on Model Checking of Software   +4 more
core   +1 more source

Model Checking One-clock Priced Timed Automata [PDF]

Logical Methods in Computer Science, 2008
We consider the model of priced (a.k.a. weighted) timed automata, an extension of timed automata with cost information on both locations and transitions, and we study various model-checking problems for that model based on extensions of classical ...
Patricia Bouyer, Kim G. Larsen, Nicolas Markey   +2 more
doaj   +1 more source

Model Checking CTL is Almost Always Inherently Sequential [PDF]

, 2009
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations—restrictions already ...
Beyersdorff, Olaf, Meier, Arne, Mundhenk, Martin, Schneiden, Thomas, Schneider, Thomas, Thomas, Michael, Vollmer, Heribert   +6 more
core   +4 more sources