69 search results - page 1 / 14 » The Bedwyr System for Model Checking over Syntactic Expressi... |
CADE
2007
Springer
14 years 4 months ago
2007
Springer
FOSSACS
2008
Springer
13 years 5 months ago
2008
Springer
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...
CSL
2009
Springer
13 years 11 months ago
2009
Springer
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...
IANDC
2011
12 years 11 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
TASE
2008
IEEE
13 years 10 months ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...