Visibly Pushdown Languages

Simple item page
dc.contributor.authorAlur, Rajeev
dc.contributor.authorMadhusudan, P.
dc.date2023-05-16T22:30:47.000
dc.date.accessioned2023-05-22T12:46:34Z
dc.date.available2023-05-22T12:46:34Z
dc.date.issued2004-06-13
dc.date.submitted2005-06-07T10:35:26-07:00
dc.description.abstractWe propose the class of visibly pushdown languages as embeddings of context-free languages that is rich enough to model program analysis questions and yet is tractable and robust like the class of regular languages. In our definition, the input symbol determines when the pushdown automaton can push or pop, and thus the stack depth at every position. We show that the resulting class VPL of languages is closed under union, intersection, complementation, renaming, concatenation, and Kleene-*, and problems such as inclusion that are undecidable for context-free languages are EXPTIME-complete for visibly pushdown automata. Our framework explains, unifies, and generalizes many of the decision procedures in the program analysis literature, and allows algorithmic verification of recursive programs with respect to many context-free properties including access control properties via stack inspection and correctness of procedures with respect to pre and post conditions. We demonstrate that the class VPL is robust by giving two alternative characterizations: a logical characterization using the monadic second order (MSO) theory over words augmented with a binary matching predicate, and a correspondence to regular tree languages. We also consider visibly pushdown languages of infinite words and show that the closure properties, MSO-characterization and the characterization in terms of regular trees carry over. The main difference with respect to the case of finite words turns out to be determinizability: nondeterministic Büchi visibly pushdown automata are strictly more expressive than deterministic Muller visibly pushdown automata.
dc.description.commentsPostprint version. Copyright ACM, 2004. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 36th Annual ACM Symposium on Theory of Computing 2004, pages 202-211. Publisher URL: http://doi.acm.org/10.1145/1007352.1007390
dc.description.commentsPostprint version. Copyright ACM, 2004. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of the 36th Annual ACM Symposium on Theory of Computing 2004, pages 202-211. Publisher URL: http://doi.acm.org/10.1145/1007352.1007390
dc.identifier.urihttps://repository.upenn.edu/handle/20.500.14332/6224
dc.legacy.articleid1174
dc.legacy.fields10.1145/1007352.1007390
dc.legacy.fulltexturlhttps://repository.upenn.edu/cgi/viewcontent.cgi?article=1174&context=cis_papers&unstamped=1
dc.rights© ACM 2004. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in STOC '04, http://dx.doi.org/10.1007/10.1145/1007352.1007390.
dc.source.beginpage202
dc.source.endpage211
dc.source.issue191
dc.source.journalDepartmental Papers (CIS)
dc.source.journaltitleProceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing (STOC '04)
dc.source.statuspublished
dc.subject.otherCPS Theory
dc.subject.otherContext-free languages
dc.subject.otherpushdown automata
dc.subject.otherverification
dc.subject.otherlogic
dc.subject.otherregular tree languages
dc.subject.otheromega-languages
dc.subject.otheralgorithms
dc.titleVisibly Pushdown Languages
dc.typePresentation
digcom.contributor.authorisAuthorOfPublication|email:alur@cis.upenn.edu|institution:University of Pennsylvania|Alur, Rajeev
digcom.contributor.authorMadhusudan, P.
digcom.identifiercis_papers/191
digcom.identifier.contextkey77729
digcom.identifier.submissionpathcis_papers/191
digcom.typeconference
dspace.entity.typePublication
relation.isAuthorOfPublication0277bab3-1be2-4f99-9964-92e0ea36014e
relation.isAuthorOfPublication.latestForDiscovery0277bab3-1be2-4f99-9964-92e0ea36014e
upenn.schoolDepartmentCenterDepartmental Papers (CIS)
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
a10.pdf
Size:
211.19 KB
Format:
Adobe Portable Document Format
Download
Collection
Presentations