Regular model checking
We present regular model checking, a framework for algorithmic verification of infinite-state
systems with, eg, queues, stacks, integers, or a parameterized linear topology. States are …
systems with, eg, queues, stacks, integers, or a parameterized linear topology. States are …
Transitive closures of regular relations for verifying infinite-state systems
We consider a model for representing infinite-state and parameterized systems, in which
states are represented as strings over a finite alphabet. Actions are transformations on …
states are represented as strings over a finite alphabet. Actions are transformations on …
Symbolic techniques for parametric reasoning about counter and clock systems
A Annichini, E Asarin, A Bouajjani - … , CAV 2000, Chicago, IL, USA, July 15 …, 2000 - Springer
We address the problem of automatic analysis of parametric counter and clock automata.
We propose a semi-algorithmic approach based on using (1) expressive symbolic …
We propose a semi-algorithmic approach based on using (1) expressive symbolic …
Abstract regular (tree) model checking
A Bouajjani, P Habermehl, A Rogalewicz… - International Journal on …, 2012 - Springer
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 …
parametrised systems which uses finite word automata or finite tree automata to finitely …
Learning to prove safety over parameterised concurrent systems
We revisit the classic problem of proving safety over parameterised concurrent systems, ie,
an infinite family of finite-state concurrent systems that are represented by some finite …
an infinite family of finite-state concurrent systems that are represented by some finite …
[PDF][PDF] Structural invariants for the verification of systems with parameterized architectures
Structural Invariants for the Verification of Systems with Parameterized Architectures Page 1
Structural Invariants for the Verification of Systems with Parameterized Architectures Marius …
Structural Invariants for the Verification of Systems with Parameterized Architectures Marius …
Regular model checking using widening techniques
T Touili - Electronic Notes in Theoretical Computer Science, 2001 - Elsevier
In this paper, we consider symbolic model checking of safety properties of linear
parametrized systems. Sets of configurations are represented by regular languages and …
parametrized systems. Sets of configurations are represented by regular languages and …
Regular model checking using inference of regular languages
P Habermehl, T Vojnar - Electronic Notes in Theoretical Computer Science, 2005 - Elsevier
Regular model checking is a method for verifying infinite-state systems based on coding
their configurations as words over a finite alphabet, sets of configurations as finite automata …
their configurations as words over a finite alphabet, sets of configurations as finite automata …
Regular model checking
M Nilsson - 2000 - diva-portal.org
We present regular model checking, a framework for algorithmic verification of infinite-state
systems with, eg, queues, stacks, integers, or a parameterized linear topology. States are …
systems with, eg, queues, stacks, integers, or a parameterized linear topology. States are …
Extrapolating tree transformations
A Bouajjani, T Touili - … Conference, CAV 2002 Copenhagen, Denmark, July …, 2002 - Springer
We consider the framework of regular tree model checking where sets of configurations of a
system are represented by regular tree languages and its dynamics is modeled by a term …
system are represented by regular tree languages and its dynamics is modeled by a term …