Filters








32,798 Hits in 5.9 sec

Compositional Model Checking with Incremental Counter-Example Construction [chapter]

Anton Wijs, Thomas Neele
2017 Lecture Notes in Computer Science  
In this paper, we propose a new approach to checking regular safety properties, which we call Incremental Counter-Example Construction (ICC).  ...  In compositional model checking, the approach is to reason about the correctness of a system by lifting results obtained in analyses of subsystems to the system-level.  ...  Conclusions We presented a new compositional model checking technique, called Incremental Counter-example Construction.  ... 
doi:10.1007/978-3-319-63387-9_28 fatcat:4cy7wj2uhzevje7uv2j6ctnd4m

Incremental Verification and Synthesis of Discrete-Event Systems Guided by Counter Examples

B.A. Brandin, R. Malik, P. Malik
2004 IEEE Transactions on Control Systems Technology  
This article presents new approaches to system verification and synthesis based on subsystem verification and the novel combined use of counter-examples and heuristics to identify suitable subsystems incrementally  ...  The verification examples considered provide a comparison of the approaches presented with straightforward state exploration, and an understanding of their applicability in an industrial context.  ...  Fig. 9 . 9 Number of automata used in incremental behavioural inclusion check an automaton on the basis of counter-examples acceptance.  ... 
doi:10.1109/tcst.2004.824795 fatcat:4w75ju7mivewfczl75vq72x3cm

Omega-Regular Model Checking [chapter]

Bernard Boigelot, Axel Legay, Pierre Wolper
2004 Lecture Notes in Computer Science  
Section 3 presents the (ω-)Regular Model Checking framework as well as the problems we want to solve. Sections 4, 5, 6, and 7 describe our main results.  ...  Going further, the problem of using Regular Model Checking technique for systems whose states are represented by infinite (omega) words has been addressed.  ...  We are grateful to Frederic Herbreteau who helped us with HAT.  ... 
doi:10.1007/978-3-540-24730-2_41 fatcat:gmipr4rdlnbyxnbodifax5oqhq

On (Omega-)regular model checking

Axel Legay, Pierre Wolper
2010 ACM Transactions on Computational Logic  
Section 3 presents the (ω-)Regular Model Checking framework as well as the problems we want to solve. Sections 4, 5, 6, and 7 describe our main results.  ...  Going further, the problem of using Regular Model Checking technique for systems whose states are represented by infinite (omega) words has been addressed.  ...  We are grateful to Frederic Herbreteau who helped us with HAT.  ... 
doi:10.1145/1838552.1838554 fatcat:jii2bh45kve7thy6yk7pifb2li

On (Omega-)Regular Model Checking [article]

Axel Legay, Pierre Wolper
2008 arXiv   pre-print
Checking infinite-state systems is frequently done by encoding infinite sets of states as regular languages.  ...  This new approach builds on earlier work, but exploits a number of new conceptual and algorithmic ideas, often induced with the help of experiments, that give it a broad scope, as well as good performances  ...  As an example, we cannot test the values of the counters.3 As an example, one could associate constraints on each transition. 4 As an example, models that can recognize nonregular languages [Klaedtke  ... 
arXiv:0809.2214v1 fatcat:2qpicd4dhzalbfksd4d7h5ugsm

Invariant-based specification, synthesis, and verification of synchronization in concurrent programs

Xianghua Deng, Matthew B. Dwyer, John Hatcliff, Masaaki Mizuno
2002 Proceedings of the 24th international conference on Software engineering - ICSE '02  
Moreover, the generated coded is designed to be processed easily by software model-checking tools such as Bandera.  ...  Using current technologies developers are faced with a tension between correct synchronization and performance.  ...  This work was supported primarily by DARPA/ITO's PCES program through AFRL Contract F33615-00-C-3044, with additional support from NSF under grants CCR-9703094, CCR-9708184, CCR-9896354 and CCR-9901605  ... 
doi:10.1145/581392.581394 fatcat:fwafkve7sbeenkmk3isvlprmjm

Invariant-based specification, synthesis, and verification of synchronization in concurrent programs

Xianghua Deng, Matthew B. Dwyer, John Hatcliff, Masaaki Mizuno
2002 Proceedings of the 24th international conference on Software engineering - ICSE '02  
Moreover, the generated coded is designed to be processed easily by software model-checking tools such as Bandera.  ...  Using current technologies developers are faced with a tension between correct synchronization and performance.  ...  This work was supported primarily by DARPA/ITO's PCES program through AFRL Contract F33615-00-C-3044, with additional support from NSF under grants CCR-9703094, CCR-9708184, CCR-9896354 and CCR-9901605  ... 
doi:10.1145/581339.581394 dblp:conf/icse/DengDHM02 fatcat:rd2o2iifanegbbffct7xm3gd5u

Handling state space explosion in verification of component-based systems: A review [article]

Faranak Nejati, Abdul Azim Abd. Ghani, Ng Keng Yap, Azmi Jaafar
2017 arXiv   pre-print
Nevertheless, model checking is limited by a critical problem so-called State Space Explosion (SSE). To benefit from model checking, appropriate methods to reduce SSE, is required.  ...  Model checking is one of the reliable methods that automatically and systematically analyse the correctness of a given system.  ...  Incremental verification it can be done before the system construction completes; the counter examples can be found as early as possible [refer to section 4].  ... 
arXiv:1709.10379v1 fatcat:rnywyiaadbbcdlsd7amzpwsjui

What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms [chapter]

Igor Konnov, Helmut Veith, Josef Widder
2016 Lecture Notes in Computer Science  
In the last two decades we have witnessed a revolutionary progress in software model checking due to the development of powerful techniques such as abstract model checking, SMT solving, and partial order  ...  In this paper, we survey our recent results in this area which extend and combine abstraction, partial orders, and bounded model checking.  ...  , parameterized model checking requires us to check whether ∀n.  ... 
doi:10.1007/978-3-319-41579-6_2 fatcat:x4eudoyzafbt3asccajklncncu

Compositional verification by model checking for counter-examples

Tevfik Bultan, Jeffrey Fischer, Richard Gerber
1996 Proceedings of the 1996 international symposium on Software testing and analysis - ISSTA '96  
In this approach an abstract, nite-state model of the system is constructed; then an automatic check is made to ensure that the requirements are satis ed by the model.  ...  Our solution depends on three key space-saving ingredients: (1) checking for counter-examples, which leads to simpler search algorithms; (2) automatic extraction of interfaces, which allows a re nement  ...  compositional checker check exploits simple facts like these, and hunts for \local" counter-examples to the input formula.  ... 
doi:10.1145/229000.226321 dblp:conf/issta/BultanFG96 fatcat:k3up2lfsfnhgzcifboxfvbnwqm

The reachability problem for Petri nets is not elementary

Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, Filip Mazowiecki
2019 Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019  
ACKNOWLEDGEMENTS We thank Alain Finkel for promoting the study of one-dimensional Petri nets with a pushdown stack, and Matthias Englert, Piotr Hofman and Radosław Piórkowski for working with us on open  ...  Construction Example 3.  ...  B, and the max tests are interpreted as checks for equality with B.  ... 
doi:10.1145/3313276.3316369 dblp:conf/stoc/CzerwinskiLLLM19 fatcat:iz5jnw2kxjbuxo3vmq2buh2h3a

Verifying Reference Counting Implementations [chapter]

Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Majumdar
2009 Lecture Notes in Computer Science  
The finite state instances are discharged by symbolic model checking, with an auxiliary invariant correlating reference counts with the number of held references.  ...  Our algorithm performs compositional verification through the combination of symbolic temporal case splitting and predicate abstraction-based reachability.  ...  Model checking ensures the auxiliary counters are equal to JOS's reference counters.  ... 
doi:10.1007/978-3-642-00768-2_30 fatcat:g2ixivbhcrc6hadpjf3zt4q5h4

On the Linguistic Capacity of Real-Time Counter Automata [article]

William Merrill
2021 arXiv   pre-print
Therefore, we study the abilities of real-time counter machines as formal grammars, focusing on formal properties that are relevant for NLP models.  ...  This has implications for the interpretability and evaluation of neural network systems: successfully matching syntactic patterns does not guarantee that counter memory accurately encodes compositional  ...  The construction in Theorem 4 can be directly adapted to show that a general counter machine can simulate checking =m in addition to =0.  ... 
arXiv:2004.06866v2 fatcat:dj6luyahcvdy5ga2txeugmoy5q

Iterating Transducers in the Large [chapter]

Bernard Boigelot, Axel Legay, Pierre Wolper
2003 Lecture Notes in Computer Science  
Checking infinite-state systems is frequently done by encoding infinite sets of states as regular languages.  ...  This new approach builds on earlier work, but exploits a number of new conceptual and algorithmic ideas, often induced with the help of experiments, that give it a broad scope, as well as good performance  ...  To check inductive preciseness, we use automata with counters, the counters being used to count the number of visits to the iterated increment.  ... 
doi:10.1007/978-3-540-45069-6_24 fatcat:cizskz4gnjhzphpnh532oyau7q

The Reachability Problem for Petri Nets is Not Elementary [article]

Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Jerome Leroux, Filip Mazowiecki
2019 arXiv   pre-print
Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and database systems, as well  ...  Thirdly, it makes obsolete the currently best lower bounds for the reachability problems for two key extensions of Petri nets: with branching and with a pushdown stack.  ...  Acknowledgements We thank Alain Finkel for promoting the study of one-dimensional Petri nets with a pushdown stack, and Matthias Englert, Piotr Hofman and Rados law Piórkowski for working with us on open  ... 
arXiv:1809.07115v4 fatcat:onvig44jz5bojdda6naekj6t2i
« Previous Showing results 1 — 15 out of 32,798 results