The benefits of exposing calls and returns

Authors:
Rajeev Alur
Affiliations:
University of Pennsylvania
Venue:
CONCUR 2005 - Concurrency Theory
Year:
2005

Citing 2
Cited 2

Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Congruences for visibly pushdown languages

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Open bisimulation for aspects

Proceedings of the 6th international conference on Aspect-oriented software development
Open Bisimulation for Aspects

Transactions on Aspect-Oriented Software Development V

Quantified Score

Hi-index	0.00

Visualization

Abstract

Regular languages have robust theoretical foundations leading to numerous applications including model checking. Context-free languages and pushdown automata have been indispensable in program analysis due to their ability to model control flow in procedural languages, but the corresponding theory is fragile. In particular, non-closure under intersection and undecidability of the language inclusion problem disallows context-free specifications in model checking applications.