First-Order and Temporal Logics for Nested Words

Authors:
Rajeev Alur;Marcelo Arenas;Pablo Barcelo;Kousha Etessami;Neil Immerman;Leonid Libkin
Affiliations:
University of Pennsylvania;Pontificia Universidad Catolica de Chile;Universidad de Chile;University of Edinburgh;University of Massachusetts;University of Edinburgh
Venue:
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Year:
2007

Citing 0
Cited 16

XPath, transitive closure logic, and nested tree walking automata

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Compositional verification of sequential programs with procedures

Information and Computation
Reasoning about XML with Temporal Logics and Automata

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reducing Behavioural to Structural Properties of Programs with Procedures

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
CaRet With Forgettable Past

Electronic Notes in Theoretical Computer Science (ENTCS)
State Complexity of Nested Word Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Model Checking Dynamic Memory Allocation in Operating Systems

Journal of Automated Reasoning
Transitive closure logic, nested tree walking automata, and XPath

Journal of the ACM (JACM)
Procedure-modular verification of control flow safety properties

Proceedings of the 12th Workshop on Formal Techniques for Java-Like Programs
CVPP: a tool set for compositional verification of control-flow safety properties

FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Descriptional complexity of unambiguous nested word automata

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Hybrid and first-order complete extensions of CaRet

TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
ProMoVer: modular verification of temporal safety properties

SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Temporal reasoning for procedural programs

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Regular languages of nested words: fixed points, automata, and synchronization

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Reducing behavioural to structural properties of programs with procedures

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The decidability of equality is proved for Martin-Lof type theory with a universe á la Russell and typed beta-eta- equality judgements. A corollary of this result is that the constructor for dependent function types is injective, a property which ...