Filters








980,460 Hits in 1.9 sec

Regular model checking

Parosh Aziz Abdulla
2011 International Journal on Software Tools for Technology Transfer (STTT)  
Paper [C] was written during my visit in Paris, and is a general description of regular model checking.  ...  We show how to reduce model checking of ω-regular properties of parameterized systems into a non-finite composition of regular relations.  ...  Regular Relations Regular model checking is based on formal languages and automata.  ... 
doi:10.1007/s10009-011-0216-8 fatcat:qlxxcewbybhedgibfn2asihwui

Regular Model Checking [chapter]

Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson, Tayssir Touili
2000 Lecture Notes in Computer Science  
We present regular model checking, a framework for algorithmic verification of infinite-state systems with, e.g., queues, stacks, integers, or a parameterized linear topology.  ...  States are represented by strings over a finite alphabet and the transition relation by a regular length-preserving relation on strings.  ...  Regular model checking can be seen as symbolic model checking, in which regular sets words over a finite alphabet is used as a symbolic representation of sets of states, and in which regular length-preserving  ... 
doi:10.1007/10722167_31 fatcat:2alyobcqofgzxfa6bwxux4xq3y

Regular Model Checking with Regular Relations [article]

Vrunda Dave, Taylor Dohmen, Shankara Narayana Krishna, Ashutosh Trivedi
2021 arXiv   pre-print
We further explore theoretical properties of omega-NSSTs required to effectively carry out regular model checking.  ...  Instead, we utilize the fact that regular relations are closed under composition, which, together with our decidability result, provides a foundation for regular model checking with regular relations.  ...  Bounded model checking with regular relations is decidable. Despite the fact that unbounded regular model checking is undecidable, bounded regular model checking provides a refutation procedure.  ... 
arXiv:1910.09072v2 fatcat:m7onavavczaz3hrmydgw65bpwu

Regular Tree Model Checking [chapter]

Parosh Aziz Abdulla, Bengt Jonsson, Pritha Mahata, Julien d'Orso
2002 Lecture Notes in Computer Science  
Our work is a generalization of regular model checking, where we extend the work done with strings toward trees.  ...  States are represented by trees over a finite alphabet, and transition relations by regular, structure preserving relations on trees.  ...  Introduction Regular model checking has recently been advocated for model checking of parameterized systems, i.e. systems whose description is parameterized by the number of components in them (e.g.  ... 
doi:10.1007/3-540-45657-0_47 fatcat:hfyurt545bcjhj2b3j3byh2kju

Abstract Regular Model Checking [chapter]

Ahmed Bouajjani, Peter Habermehl, Tomáš Vojnar
2004 Lecture Notes in Computer Science  
in regular model checking.  ...  Abstract Regular Model Checking 373  ...  The technique called abstract regular model checking combines the approach of regular model checking with the abstract-check-refine paradigm.  ... 
doi:10.1007/978-3-540-27813-9_29 fatcat:yl7yraoirvgxncnrpspaqazva4

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.  ...  model checking).  ... 
doi:10.1007/978-3-540-24730-2_41 fatcat:gmipr4rdlnbyxnbodifax5oqhq

Abstract regular (tree) model checking

Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomáš Vojnar
2011 International Journal on Software Tools for Technology Transfer (STTT)  
Regular (Tree) Model Checking Abstract.  ...  The problems addressed by regular model checking are typically undecidable.  ...  Checking of liveness properties within regular model checking is considerably more difficult.  ... 
doi:10.1007/s10009-011-0205-y fatcat:z6on6nl64reybd4rf4rrxxmljy

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.  ...  model checking).  ... 
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.  ...  Computing such a regular representation of, say, the set of reachable states of a system requires acceleration techniques that can finitely compute the effect of an unbounded number of transitions.  ...  This setting is referred to as Regular Model Checking [Kesten et al. 1997; Wolper and Boigelot 1998 ].  ... 
arXiv:0809.2214v1 fatcat:2qpicd4dhzalbfksd4d7h5ugsm

Model Checking Regular Language Constraints [article]

Arlen Cox, Jason Leasure
2017 arXiv   pre-print
By applying the IC3 model checking algorithm to Boolean finite automata, not only can we efficiently answer emptiness and universality problems, but through an extension, we can decide satisfiability of  ...  Even the fastest SMT solvers have performance problems with regular expressions from real programs.  ...  Is there a good way to solve word equations along with the model-checking-based regular language membership checks?  ... 
arXiv:1708.09073v1 fatcat:yd3tqtdn7vezdowbejjv5qzgui

Regular Model Checking Using Inference of Regular Languages

Peter Habermehl, Tomáš Vojnar
2005 Electronical Notes in Theoretical Computer Science  
We introduce a new general approach to regular model checking based on inference of regular languages.  ...  Furthermore, in contrast to all other existing regular model checking methods, termination is guaranteed in general for all systems with regular sets of reachable configurations.  ...  The Model Checking Algorithm In this section, we describe our model checking algorithm based on inference of regular languages.  ... 
doi:10.1016/j.entcs.2005.01.044 fatcat:y2eyefuo4vdupf53rw4sa5m2ba

Regular Model Checking Revisited (Technical Report) [article]

Anthony W. Lin, Philipp Rümmer
2021 arXiv   pre-print
We provide a reformulation of regular model checking with length-preserving transducers in terms of existential second-order theory over automatic structures.  ...  In this contribution we revisit regular model checking, a powerful framework that has been successfully applied for the verification of infinite-state systems, especially parameterized systems (concurrent  ...  systems, dubbed regular model checking (e.g  ... 
arXiv:2005.00990v2 fatcat:kvmcpfh3x5actialupmareevru

Regular Model Checking using Widening Techniques

Tayssir Touili
2001 Electronical Notes in Theoretical Computer Science  
doi:10.1016/s1571-0661(04)00187-2 fatcat:mfiximvaxbafblxtodkyxcgzzi

Regular model checking for LTL(MSO)

Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena
2011 International Journal on Software Tools for Technology Transfer (STTT)  
, and regular model checking techniques are used to search for models.  ...  Regular model checking is a form of symbolic model checking for parameterized and infinite-state systems whose states can be represented as words of arbitrary length over a finite alphabet, in which regular  ...  In addition to the work on regular model checking, cited earlier, there is a large body of research on the problem of model checking parameterized systems of identical processes, in which there is no ordering  ... 
doi:10.1007/s10009-011-0212-z fatcat:435xg5il4jhd3opeoohexw6vvm

A Survey of Regular Model Checking [chapter]

Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena
2004 Lecture Notes in Computer Science  
Regular model checking is being developed for algorithmic verification of several classes of infinite-state systems whose configurations can be modeled as words over a finite alphabet.  ...  The main idea is to use regular languages as the representation of sets of configurations, and finite-state transducers to describe transition relations.  ...  Regular model checking was advocated by Kesten et al.  ... 
doi:10.1007/978-3-540-28644-8_3 fatcat:xblrrywqhzhpbfqvudbhfrl5za
« Previous Showing results 1 — 15 out of 980,460 results