4617 search results - page 814 / 924 » Automation of Diagrammatic Reasoning |
151
click to vote
LICS
2009
IEEE
16 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...
174
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
202
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
159
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
187
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...