POPL 2016 (series) / Research Papers /
Unboundedness and Downward Closures of Higher-Order Pushdown Automata
Wed 20 Jan 2016 15:35 - 16:00 at Grand Bay North - Track 1: Decision Procedures Chair(s): Loris D'Antoni
We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous unboundedness problem, is decidable. From recent work by Zetsche this means that we can construct the downwards closure of the set of words accepted by a given HOPDA. This also means we can construct the downwards closure of the Parikh image of a HOPDA. Both of these consequences can play an important role in verifying concurrent higher-order programs expressed as HOPDA or safe higher-order recursion schemes.
Wed 20 JanDisplayed time zone: Guadalajara, Mexico City, Monterrey change
Wed 20 Jan
Displayed time zone: Guadalajara, Mexico City, Monterrey change
14:20 - 16:00 | Track 1: Decision ProceduresResearch Papers at Grand Bay North Chair(s): Loris D'Antoni University of Pennsylvania | ||
14:20 25mTalk | Query-Guided Maximum Satisfiability Research Papers Xin Zhang Georgia Tech, Ravi Mangal Georgia Institute of Technology, Aditya Nori Microsoft Research, UK, Mayur Naik Georgia Tech File Attached | ||
14:45 25mTalk | String Solving with Word Equations and Transducers: Decidability and Applications to Detecting Mutation XSS Research Papers Media Attached | ||
15:10 25mTalk | Symbolic Computation of Differential Equivalences Research Papers Luca Cardelli Microsoft Research and University of Oxford, Mirco Tribastone IMT Institute for Advanced Studies Lucca, Italy, Max Tschaikowski IMT Institute for Advanced Studies Lucca, Italy, Andrea Vandin IMT Institute for Advanced Studies Lucca, Italy Media Attached | ||
15:35 25mTalk | Unboundedness and Downward Closures of Higher-Order Pushdown Automata Research Papers Matthew Hague Royal Holloway University of London, UK, Jonathan Kochems Department of Computer Science, University of Oxford, C.-H. Luke Ong University of Oxford, UK Media Attached | ||