Sciweavers

15 search results - page 1 / 3
» Model-Checking LTL with Regular Valuations for Pushdown Syst...
Sort
View
80
Voted
TACS
2001
Springer
15 years 2 months ago
Model-Checking LTL with Regular Valuations for Pushdown Systems
Javier Esparza, Antonín Kucera, Stefan Schw...
FSTTCS
2001
Springer
15 years 2 months ago
Beyond Regular Model Checking
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
Dana Fisman, Amir Pnueli
FOSSACS
2008
Springer
14 years 11 months ago
Model Checking Freeze LTL over One-Counter Automata
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
FSTTCS
2006
Springer
15 years 1 months ago
On Decidability of LTL Model Checking for Process Rewrite Systems
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
Laura Bozzelli, Mojmír Kretínsk&yacu...
POPL
2007
ACM
15 years 10 months ago
On the analysis of interacting pushdown systems
Pushdown Systems (PDSs) has become an important paradigm for program analysis. Indeed, recent work has shown a deep connection between inter-procedural dataflow analysis for seque...
Vineet Kahlon, Aarti Gupta