522 search results - page 52 / 105 » Real-time Logics: Complexity and Expressiveness |
189
click to vote
CC
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
166
click to vote
WOLLIC
2010
Springer
15 years 11 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
140
click to vote
LICS
2008
IEEE
16 years 15 days ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
164
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We consider an extension of the guarded fragment in which one can guard quanti ers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
166
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...