Sciweavers

208 search results - page 1 / 42
» Fair Model Checking with Process Counter Abstraction
Sort
View
FM
2009
Springer
90views Formal Methods» more  FM 2009»
14 years 1 months ago
Fair Model Checking with Process Counter Abstraction
Jun Sun 0001, Yang Liu 0003, Abhik Roychoudhury, S...
CSL
2009
Springer
14 years 1 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To
LICS
2009
IEEE
14 years 2 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
FOSSACS
2008
Springer
13 years 9 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...
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
14 years 2 months ago
Boom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Gérard Basler, Matthew Hague, Daniel Kroeni...