Theoretical Computer Science
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Temporal Logic with Forgettable Past
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
An algebraic approach to data languages and timed languages
Information and Computation
DP Lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Computation: finite and infinite machines
Computation: finite and infinite machines
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Memoryful Branching-Time Logic
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
Alternation-free modal mu-calculus for data trees
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
The Effects of Bounding Syntactic Resources on Presburger LTL
TIME '07 Proceedings of the 14th International Symposium on Temporal Representation and Reasoning
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
Two-variable logic on data trees and XML reasoning
Journal of the ACM (JACM)
Bounded-variable fragments of hybrid logics
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Model checking freeze LTL over one-counter automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On metric temporal logic and faulty turing machines
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On the complexity of hybrid logics with binders
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
When model-checking freeze LTL over counter machines becomes decidable
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
On notions of regularity for data languages
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Shuffle expressions and words with nested data
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Artifact systems with data dependencies and arithmetic
ACM Transactions on Database Systems (TODS)
| Hi-index | 5.23 |
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL"^@7) and for first-order logic with data equality tests (written FO^(~,