1113 search results - page 1 / 223 » Counter Systems for Data Logics |
JELIA
2010
Springer
14 years 5 months ago
2010
Springer
CADE
2012
Springer
12 years 9 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
CSL
2009
Springer
15 years 1 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...
LICS
2009
IEEE
15 years 1 months ago
2009
IEEE
—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...
LICS
1994
IEEE
14 years 11 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...