18 search results - page 3 / 4 » Generic Complexity of Presburger Arithmetic |
LICS
2009
IEEE
14 years 2 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...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
CADE
2012
Springer
11 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...
PEPM
2000
ACM
13 years 11 months ago
2000
ACM
Many program optimisations and analyses, such as arraybound checking, termination analysis, etc, dependon knowing the size of a function's input and output. However, size inf...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...