Filters








27 Hits in 3.8 sec

The sweep-line state space exploration method

Kurt Jensen, Lars M. Kristensen, Thomas Mailund
2012 Theoretical Computer Science  
The sweep-line method exploits intrinsic progress in concurrent systems to alleviate the state explosion problem in explicit state model checking.  ...  Second, we survey a selection of case studies where the sweep-line method has been put into practical use for the verification of concurrent systems.  ...  Acknowledgements The sweep-line method has been influenced by several co-authors of papers. In particular, we acknowledge the contributions of Jonathan Billington, Søren Christensen, Guy E.  ... 
doi:10.1016/j.tcs.2011.12.036 fatcat:ajwaohtrgzffzkrngki7vcjgcm

A Compositional Sweep-Line State Space Exploration Method [chapter]

Lars Michael Kristensen, Thomas Mailund
2002 Lecture Notes in Computer Science  
We present a new sweep-line algorithm for a compositional setting where systems are composed of subsystems.  ...  The sweep-line method exploits a certain kind of progress present in many systems to reduce peak memory usage during state space exploration.  ...  The authors would like to thank Michael Westergaard for assisting in the implementation of the prototype.  ... 
doi:10.1007/3-540-36135-9_21 fatcat:xg3crkf4ija4lnun2ffp3dr5ni

Abstraction Refinement-Based Verification of Timed Automata

Tamás Tóth, István Majzik
2021 Zenodo  
Model checking is an automatic formal verification technique that is based on exhaustive traversal of the design model's state space.  ...  Formal verification techniques are formal methods for reasoning about the correctness of systems with respect to a formal specification or property.  ...  We compared the proposed interpolation based method and the non-convex LU -abstraction based method [HSW13] on the usual benchmark models for timed automata.  ... 
doi:10.5281/zenodo.4759046 fatcat:3vrprqrhfjeknjjdn74uqoreo4

Abstract regular (tree) model checking

Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomáš Vojnar
2011 International Journal on Software Tools for Technology Transfer (STTT)  
Regular model checking is a generic technique for verification of infinite-state and/or parametrised systems which uses finite word automata or finite tree automata to finitely represent potentially infinite  ...  We then show how abstract regular tree model checking can be used for verification of programs manipulating tree-like dynamic data structures.  ...  The Method of Abstract Regular Model Checking We now describe the general principle of abstract regular model checking (ARMC) using a generic framework for automata abstraction based on collapsing states  ... 
doi:10.1007/s10009-011-0205-y fatcat:z6on6nl64reybd4rf4rrxxmljy

Parallel Partial Order Reduction with Topological Sort Proviso

Jiri Barnat, Lubos Brim, Petr Rockai
2010 2010 8th IEEE International Conference on Software Engineering and Formal Methods  
While for verification of safety properties, there are a few rather successful approaches to parallel partial order reduction, for LTL model checking all suggested approaches are either too technically  ...  Partial order reduction and distributed-memory processing are the two essential techniques to fight the wellknown state space explosion problem in explicit state model checking.  ...  For a particular class of verification problems, namely for model checking properties expressible by weak Büchi automata, this corresponds to the best sequential solution available.  ... 
doi:10.1109/sefm.2010.35 dblp:conf/sefm/BarnatBR10 fatcat:ntzmipofofam7l3nbhdiutc5rq

A BSP Algorithm for On-the-fly Checking LTL Formulas on Security Protocols

Frederic Gava, Michael Guedj, Franck Pommereau
2012 2012 11th International Symposium on Parallel and Distributed Computing  
This paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute on-the-fly whether a structured model of a security protocol satisfies a LTL formula.  ...  A prototype implementation has been developed, allowing to run benchmarks.  ...  The common method for LTL checking is using a Büchi automaton.  ... 
doi:10.1109/ispdc.2012.10 dblp:conf/ispdc/GavaGP12 fatcat:zx65px4cc5a3zods2hccg76vxy

A New Approach to Stateless Model Checking of LTL Properties [article]

Elaheh Ghassabani, Mohammad Abdollahi Azgomi
2016 arXiv   pre-print
Stateless model checking is an appropriate method for systematically and automatically testing of large programs, which has proved its power in verifying code of large programs.  ...  This paper proposes a novel encoding of one of the recent LTL semantics on finite paths into an actor-based system.  ...  Acknowledgement We are grateful to Iran National Science Foundation (INSF) for financial support of this research.  ... 
arXiv:1603.03535v1 fatcat:vsh7kkdfnjdkhb4j4v53vrhpwy

Presentation of the 9th Edition of the Model Checking Contest [chapter]

Elvio Amparore, Bernard Berthomieu, Gianfranco Ciardo, Silvano Dal Zilio, Francesco Gallà, Lom Messan Hillah, Francis Hulin-Hubard, Peter Gjøl Jensen, Loïg Jezequel, Fabrice Kordon, Didier Le Botlan, Torsten Liebke (+7 others)
2019 Msphere  
The Model Checking Contest (MCC) is an annual competition of software tools for model checking.  ...  For each examination and each model instance, participating tools are provided with up to 3600 s and 16 gigabyte of memory.  ...  When the sweep-line method is applied, LoLA automatically computes a progress measure that is a pre-requisite for applying that method. The method can thus be applied in push-button style.  ... 
doi:10.1007/978-3-030-17502-3_4 fatcat:i63wf7m4fzggxpl54xxwpv3jei

A Graphical Approach to Component-Based and Extensible Model Checking Platforms [chapter]

Michael Westergaard, Lars Michael Kristensen
2012 Lecture Notes in Computer Science  
A job can then be mapped onto components of an underlying model checking tool for execution.  ...  This paper proposes JoSEL, a graphical language for specification of executable model checking jobs.  ...  Support for the sweep-line method is illustrated in Fig. 11 .  ... 
doi:10.1007/978-3-642-29072-5_12 fatcat:diht3q2wibaqhkctl77jqnkh5m

Statistical Model Checking of Rich Models and Properties [article]

Danny Bøgsted Poulsen
2015 Ph.d.-serien for Det Teknisk-Naturvidenskabelige Fakultet, Aalborg Universitet  
The standard model checking technique for LTL is to negate the formula ϕ toφ = ¬ϕ, translateφ into a Büchi automaton A and construct the product M × A.  ...  Model Checking Model checking is a formal method developed independently by Clarke and Emerson [40] and Queille and Sifakis [101] .  ...  MC model checking. MTL metric temporal logic. MWTA monitoring weighted timed automaton. NPTA Network of priced timed automata. pdf probability density function.  ... 
doi:10.5278/vbn.phd.engsci.00031 fatcat:ymchwutcdzf23eugog22golc44

Polymorphic scenario-based specification models: semantics and applications

Shahar Maoz
2010 Journal of Software and Systems Modeling  
system models.  ...  We motivate the use of polymorphic scenarios, formally define their trace-based semantics, and present their application for scenario-based testing and execution, as implemented in the S2A compiler developed  ...  Acknowledgments I would like to thank Yoram Atir, David Harel, Amir Kantor, Assaf Marron, Itai Segall, and the anonymous reviewers of the MoDELS'09 conference for comments on drafts of [30] .  ... 
doi:10.1007/s10270-010-0168-6 fatcat:qrxji4o5hfacjiwcfx5fkcf5qa

Polymorphic Scenario-Based Specification Models: Semantics and Applications [chapter]

Shahar Maoz
2009 Lecture Notes in Computer Science  
system models.  ...  We motivate the use of polymorphic scenarios, formally define their trace-based semantics, and present their application for scenario-based testing and execution, as implemented in the S2A compiler developed  ...  Acknowledgments I would like to thank Yoram Atir, David Harel, Amir Kantor, Assaf Marron, Itai Segall, and the anonymous reviewers of the MoDELS'09 conference for comments on drafts of [30] .  ... 
doi:10.1007/978-3-642-04425-0_38 fatcat:unsx6ugpxjczxnta3mcq5fxxxu

Roadmap Document on Stochastic Analysis [article]

Bo Friis Nielsen and Flemming Nielson and Henrik Pilegaard and Michael James Andrew Smith and Ender Yüksel and Kebin Zeng and Lijun Zhang
2012 arXiv   pre-print
stochastic model checking.  ...  The research centre studies the Modelling of Information Technology and is a VKR Centre of Excellence funded for five years by the VILLUM Foundation.  ...  In both cases, we perform a parameter sweep such that we either verify the same property for a set of different models, or a set of different properties for the same model.  ... 
arXiv:1209.6578v1 fatcat:cqpa7xgamzdslgbioym5x2c4qi

Solving Parity Games in Practice [chapter]

Oliver Friedmann, Martin Lange
2009 Lecture Notes in Computer Science  
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model checking) for temporal  ...  is only called on parts of a game that cannot be solved faster by simpler methods.  ...  While the satisfiability problem for linear-time logics like LTL, PSL or the linear-time μcalculus reduces -in one form or the other -to the inclusion problem for nondeterministic Büchi automata (NBA)  ... 
doi:10.1007/978-3-642-04761-9_15 fatcat:lbvjz7tbwzgjvhae3ykkala2ei

Logical Data Expiration [chapter]

David Toman
2004 Logics for Emerging Applications of Databases  
We survey existing approaches to the problem in a unified framework and discuss their features and limits, and the limits of data expiration based techniques in general.  ...  The particular focus of the chapter is on comparing the space performance of various data expiration methods.  ...  Model Checking The connection between temporal logic (and other modal logics) and automata has been known since the 60s [39] .  ... 
doi:10.1007/978-3-642-18690-5_6 fatcat:jwkgqjaazbgu3i2byd533dwixi
« Previous Showing results 1 — 15 out of 27 results