Security Applications of Formal Language Theory Dartmouth Computer Science Technical Report TR2011-709 Len Sassaman, Meredith L. Patterson, Sergey Bratus, Michael E. Locasto, Anna Shubina

Source URL: langsec.org

• Mathematics
• Deterministic pushdown automaton
• Parsing
• Computability
• Context-free grammar
• Context-free language
• Formal grammar
• Finite-state machine
• Recursive language
• Formal languages
• Theoretical computer science
• Theory of computation

Pruning, Pushdown Exception-Flow Analysis Shuying Liang Weibin Sun Matthew Might

Source URL: shuying.me

CFA2: Pushdown Flow Analysis for Higher-Order Languages A dissertation presented by Dimitrios Vardoulakis

Source URL: dimvar.github.io

Pushdown systems in Polarized deduction modulo Gilles Dowek∗ and Ying Jiang† Abstract We introduce a new saturation method for polarized rewrite systems and prove a cut-elimination theorem for the Polarized sequent c

Source URL: who.rocq.inria.fr

Cut-elimination and the decidability of reachability in alternating pushdown systems Gilles Dowek, Ying Jiang To cite this version: Gilles Dowek, Ying Jiang. Cut-elimination and the decidability of reachability in altern

Source URL: who.rocq.inria.fr

Pushdown Control-Flow Analysis of Higher Order Programs Christopher Earl1 Matthew Might1

Source URL: www.schemeworkshop.org

Pushdown Automata in Statistical Machine Translation Cyril Allauzen∗ Bill Byrne∗∗

Source URL: mi.eng.cam.ac.uk

Bisimilarity of Pushdown Automata is Nonelementary Michael Benedikt Stefan G¨oller

Source URL: www.informatik.uni-bremen.de

Congruences for Visibly Pushdown Languages⋆ Rajeev Alur1 , Viraj Kumar2 , P. Madhusudan2 , and Mahesh Viswanathan2 1 2

Source URL: www.cis.upenn.edu

Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems Ahmed Bouajjani1 , Markus M¨uller-Olm2, and Tayssir Touili1 1 2

Source URL: www.liafa.jussieu.fr