Stem pushdown$ (all stems)

141 papers:

CIAA-J-2013-CaralpRT15 #automaton

Trimming visibly pushdown automata (MC, PAR, JMT), pp. 13–29.

CIAA-2015-HeamJ15a #automaton #generative #random #realtime

Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata (PCH, JLJ), pp. 153–164.

ICALP-v2-2015-ChatterjeeHIO #automaton #distance #edit distance

Edit Distance for Pushdown Automata (KC, TAH, RIJ, JO), pp. 121–133.

ICALP-v2-2015-LerouxST #automaton #on the #problem

On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (JL, GS, PT), pp. 324–336.

CSL-2015-ClementeL #analysis #automaton #first-order #reachability

Reachability Analysis of First-order Definable Pushdown Systems (LC, SL), pp. 244–259.

LICS-2015-ClementeL #automaton #revisited

Timed Pushdown Automata Revisited (LC, SL), pp. 738–749.

FoSSaCS-2014-Jancar #automaton

Equivalences of Pushdown Systems Are Hard (PJ), pp. 1–28.

FoSSaCS-2014-Lang #automaton #game studies #graph #reachability

Resource Reachability Games on Pushdown Graphs (ML0), pp. 195–209.

SCAM-2014-LiangSMKH #analysis #automaton #exception

Pruning, Pushdown Exception-Flow Analysis (SL, WS, MM, AWK, DVH), pp. 265–274.

FLOPS-2014-CaiO #automaton

Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata (XC, MO), pp. 336–352.

DLT-J-2013-AtigKS14 #multi #order

Adjacent Ordered Multi-Pushdown Systems (MFA, KNK, PS), pp. 1083–1096.

AFL-2014-CarayolH #algorithm #automaton #model checking

Saturation algorithms for model-checking pushdown systems (AC, MH), pp. 1–24.

AFL-2014-Loding #automaton #infinity #problem #word

Decision Problems for Deterministic Pushdown Automata on Infinite Words (CL), pp. 55–73.

CIAA-2014-Osterholzer #automaton #context-free grammar

Pushdown Machines for Weighted Context-Free Tree Translation (JO), pp. 290–303.

DLT-2014-OkhotinS #automaton #nondeterminism

Input-Driven Pushdown Automata with Limited Nondeterminism — (Invited Paper) (AO, KS), pp. 84–102.

DLT-2014-ReynierT #automaton #transducer

Visibly Pushdown Transducers with Well-Nested Outputs (PAR, JMT), pp. 129–141.

DLT-2014-TorreNP #automaton #bound

Scope-Bounded Pushdown Languages (SLT, MN, GP), pp. 116–128.

ICALP-v2-2014-ChistikovM #automaton #source code

Unary Pushdown Automata and Straight-Line Programs (DVC, RM), pp. 146–157.

LATA-2014-AbdullaAS #automaton #reachability

Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata (PAA, MFA, JS), pp. 62–75.

LATA-2014-BednarovaG #automaton

Two Double-Exponential Gaps for Automata with a Limited Pushdown (ZB, VG), pp. 113–125.

CAV-2014-DAntoniA #automaton

Symbolic Visibly Pushdown Automata (LD, RA), pp. 209–225.

LICS-CSL-2014-LerouxPS #automaton #bound

Hyper-Ackermannian bounds for pushdown vector addition systems (JL, MP, GS), p. 10.

VLDB-2013-OgdenTP #automaton #parallel #query #scalability #transducer #using #xml

Scalable XML Query Processing using Parallel Pushdown Transducers (PO, DBT, PP), pp. 1738–1749.

TACAS-2013-Minamide #automaton

Weighted Pushdown Systems with Indexed Weight Domains (YM), pp. 230–244.

SAS-2013-LammichMSW #automaton #network

Contextual Locking for Dynamic Pushdown Networks (PL, MMO, HS, AW), pp. 477–498.

CIAA-2013-CaralpRT #automaton

Trimming Visibly Pushdown Automata (MC, PAR, JMT), pp. 84–96.

DLT-2013-AtigKS #multi #order

Adjacent Ordered Multi-Pushdown Systems (MFA, KNK, PS), pp. 58–69.

ICALP-v2-2013-ChretienCD #automaton #protocol #security

From Security Protocols to Pushdown Automata (RC, VC, SD), pp. 137–149.

ICALP-v2-2013-FriedmannKL #automaton

Ramsey Goes Visibly Pushdown (OF, FK, ML), pp. 224–237.

LATA-2013-BruyereDG #anti #automaton

Visibly Pushdown Automata: Universality and Inclusion via Antichains (VB, MD, OG), pp. 190–201.

LATA-2013-Ong #automaton #higher-order #model checking #recursion

Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking (LO), pp. 13–41.

LATA-2013-Otto #automaton

Asynchronous PC Systems of Pushdown Automata (FO), pp. 456–467.

ESEC-FSE-2013-SongT #automaton #detection #model checking #named

PoMMaDe: pushdown model-checking for malware detection (FS, TT), pp. 607–610.

LICS-2013-BenediktGKM #automaton #similarity

Bisimilarity of Pushdown Automata is Nonelementary (MB, SG, SK, ASM), pp. 488–498.

CASE-2012-KobayashiH #automaton #on the

On opacity and diagnosability in discrete event systems modeled by pushdown automata (KK, KH), pp. 662–667.

FoSSaCS-2012-Kartzow #automaton #exponential #first-order #model checking

First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time (AK), pp. 376–390.

TACAS-2012-SongT #automaton #detection #model checking

Pushdown Model Checking for Malware Detection (FS, TT), pp. 110–125.

CIAA-2012-AllauzenR #automaton #library #transducer

A Pushdown Transducer Extension for the OpenFst Library (CA, MR), pp. 66–77.

DLT-2012-CaralpRT #automaton #bound #multi

Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness (MC, PAR, JMT), pp. 226–238.

ICALP-v2-2012-Broadbent #automaton

Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata (CHB), pp. 153–164.

ICALP-v2-2012-BroadbentCHS #automaton

A Saturation Method for Collapsible Pushdown Systems (CHB, AC, MH, OS), pp. 165–176.

LATA-2012-AbdullaAS #automaton #low cost #problem #reachability

The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems (PAA, MFA, JS), pp. 58–69.

LATA-2012-IbarraT #automaton #multi #turing machine

Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines (OHI, NQT), pp. 337–350.

LATA-2012-TangO #automaton #model checking #on the

On Model Checking for Visibly Pushdown Automata (NVT, HO), pp. 408–419.

ICFP-2012-EarlSMH #analysis #automaton #higher-order #source code

Introspective pushdown analysis of higher-order programs (CE, IS, MM, DVH), pp. 177–188.

CAV-2012-HarrisJR #automaton #game studies #programming #safety

Secure Programming via Visibly Pushdown Safety Games (WRH, SJ, TWR), pp. 581–598.

CSL-2012-Parys #automaton

Variants of Collapsible Pushdown Systems (PP), pp. 500–515.

LICS-2012-AbdullaAS #automaton

Dense-Timed Pushdown Automata (PAA, MFA, JS), pp. 35–44.

LICS-2012-CarayolS #automaton #effectiveness #equivalence #recursion #safety

Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective Selection (AC, OS), pp. 165–174.

LICS-2012-ChatterjeeV #automaton #game studies

Mean-Payoff Pushdown Games (KC, YV), pp. 195–204.

FASE-2011-LiXBL #automaton #model checking

Model Checking Büchi Pushdown Systems (JL, FX, TB, VL), pp. 141–155.

AFL-2011-CermakM #automaton #strict

n-Accepting Restricted Pushdown Automata Systems (MC, AM), pp. 168–183.

AFL-2011-NagyO

Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-Automata (BN, FO), pp. 328–342.

CIAA-2011-FlouriJMIP #automaton #order

Tree Template Matching in Ranked Ordered Trees by Pushdown Automata (TF, JJ, BM, CSI, SPP), pp. 273–281.

DLT-2011-TasdemirS #automaton #modelling

Models of Pushdown Automata with Reset (NT, ACCS), pp. 417–428.

ICALP-v2-2011-HopkinsMO #automaton #decidability #ml

A Fragment of ML Decidable by Visibly Pushdown Automata (DH, ASM, CHLO), pp. 149–161.

ICFP-2011-VardoulakisS #analysis #automaton

Pushdown flow analysis of first-class control (DV, OS), pp. 69–80.

CSL-2011-Kartzow #automaton #graph

A Pumping Lemma for Collapsible Pushdown Graphs of Level 2 (AK), pp. 322–336.

ICST-2011-BelliBTF #automaton #mutation testing #testing

Mutation Testing of “Go-Back” Functions Based on Pushdown Automata (FB, MB, TT, ZF), pp. 249–258.

ICST-2011-ChanderDSY #automaton #finite #generative #modelling #sequence

Optimal Test Input Sequence Generation for Finite State Models and Pushdown Systems (AC, DD, KS, DY), pp. 140–149.

TAP-2011-HeamM #approach #automaton #random testing #testing #using

A Random Testing Approach Using Pushdown Automata (PCH, CM), pp. 119–133.

ESOP-2010-Wenner #automaton #network

Weighted Dynamic Pushdown Networks (AW), pp. 590–609.

FoSSaCS-2010-HeussnerLMS #analysis #automaton #communication #reachability

Reachability Analysis of Communicating Pushdown Systems (AH, JL, AM, GS), pp. 267–281.

PEPM-2010-LiO #automaton

Conditional weighted pushdown systems and applications (XL, MO), pp. 141–150.

AFL-J-2008-KutribMO10 #automaton #on the

On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 781–798.

ICALP-v2-2010-BraudC #automaton #linear #order

Linear Orders in the Pushdown Hierarchy (LB, AC), pp. 88–99.

LATA-2010-Crespi-ReghizziM #automaton #precedence

Operator Precedence and the Visibly Pushdown Property (SCR, DM), pp. 214–226.

LATA-2010-KutribM #automaton

Reversible Pushdown Automata (MK, AM), pp. 368–379.

LATA-2010-Melichar #automaton #named

Arbology: Trees and Pushdown Automata (BM), pp. 32–49.

SAC-2010-FlouriMJ #automaton #multi

Aho-Corasick like multiple subtree matching by pushdown automata (TF, BM, JJ), pp. 2157–2158.

CAV-2010-LiXBL #analysis #automaton #hardware #performance #reachability

Efficient Reachability Analysis of Büchi Pushdown Systems for Hardware/Software Co-verification (JL, FX, TB, VL), pp. 339–353.

CAV-2010-Seth #automaton #bound #multi #reachability

Global Reachability in Bounded Phase Multi-stack Pushdown Systems (AS), pp. 615–628.

CIAA-J-2008-Pighizzini09 #automaton

Deterministic Pushdown Automata and Unary Languages (GP), pp. 629–645.

DLT-2009-FriscoI #automaton #finite #multi #on the

On Stateless Multihead Finite Automata and Multihead Pushdown Automata (PF, OHI), pp. 240–251.

LATA-2009-LimayeM #automaton #multi #testing

Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata (NL, MM), pp. 493–504.

CAV-2009-LammichMW #automaton #constraints #network #set

Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints (PL, MMO, AW), pp. 525–539.

AFL-2008-KutribMO #automaton #on the

On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 257–268.

AFL-2008-MasopustM #automaton #multi #on the

On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops (TM, AM), pp. 325–336.

CIAA-2008-Pighizzini #automaton

Deterministic Pushdown Automata and Unary Languages (GP), pp. 232–241.

DLT-2008-AtigBH #automaton #multi

Emptiness of Multi-pushdown Automata Is 2ETIME-Complete (MFA, BB, PH), pp. 121–133.

ICALP-B-2008-RaskinS #automaton #transducer

Visibly Pushdown Transducers (JFR, FS), pp. 386–397.

CIKM-2008-ThomoV #automaton #integration #xml

Rewriting of visibly pushdown languages for xml data integration (AT, SV), pp. 521–530.

LICS-2008-CarayolHMOS #automaton #game studies #higher-order

Winning Regions of Higher-Order Pushdown Games (AC, MH, AM, CHLO, OS), pp. 193–204.

LICS-2008-HagueMOS #automaton #recursion

Collapsible Pushdown Automata and Recursion Schemes (MH, ASM, CHLO, OS), pp. 452–461.

FoSSaCS-2007-HagueO #analysis #automaton #higher-order

Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems (MH, CHLO), pp. 213–227.

CIAA-2007-KutribMW #automaton #nondeterminism

Regulated Nondeterminism in Pushdown Automata (MK, AM, LW), pp. 85–96.

DLT-2007-CarotenutoMP #automaton

2-Visibly Pushdown Automata (DC, AM, AP), pp. 132–144.

LATA-2007-FrancezK #automaton

Pushdown automata with cancellation and commutation-augmented pregroups grammars (NF, MK), pp. 7–26.

POPL-2007-KahlonG #analysis #automaton #on the

On the analysis of interacting pushdown systems (VK, AG), pp. 303–314.

TACAS-2006-EsparzaKS #abstraction #automaton #refinement

Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems (JE, SK, SS), pp. 489–503.

TACAS-2006-JhaSWR #automaton #trust

Weighted Pushdown Systems and Trust-Management Systems (SJ, SS, HW, TWR), pp. 1–26.

DLT-2006-Caucal #automaton

Synchronization of Pushdown Automata (DC), pp. 120–132.

DLT-2006-KutribM #automaton #nondeterminism

Context-Dependent Nondeterminism for Pushdown Automata (MK, AM), pp. 133–144.

CAV-2006-LalR #automaton #model checking

Improving Pushdown System Model Checking (AL, TWR), pp. 343–357.

CSL-2006-Srba #automaton #bisimulation #equivalence #simulation

Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation (JS), pp. 89–103.

LICS-2006-KuskeL #automaton #logic #monad

Monadic Chain Logic Over Iterations and Applications to Pushdown Systems (DK, ML), pp. 91–100.

VMCAI-2006-Bozzelli #automaton #complexity #model checking

Complexity Results on Branching-Time Pushdown Model Checking (LB), pp. 65–79.

VMCAI-2006-HristovaL #algorithm #automaton #linear #logic #model checking

Improved Algorithm Complexities for Linear Temporal Logic Model Checking of Pushdown Systems (KH, YAL), pp. 190–206.

CIAA-2005-AnselmoM #2d #automaton #queue #simulation

Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata (MA, MM), pp. 43–53.

CIAA-2005-FujiyoshiK #automaton #linear #recognition

Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton (AF, IK), pp. 129–140.

ICALP-2005-AlurKMV #automaton

Congruences for Visibly Pushdown Languages (RA, VK, PM, MV), pp. 1102–1114.

CAV-2005-LalRB #automaton

Extended Weighted Pushdown Systems (AL, TWR, GB), pp. 434–448.

LICS-2005-EsparzaKM #analysis #automaton #probability

Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances (JE, AK, RM), pp. 117–126.

STOC-2004-AlurM #automaton

Visibly pushdown languages (RA, PM), pp. 202–211.

DLT-2004-BordihnHK #automaton #geometry

Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages (HB, MH, MK), pp. 102–113.

LICS-2004-EsparzaKM #automaton #model checking #probability

Model Checking Probabilistic Pushdown Automata (JE, AK, RM), pp. 12–21.

SAS-2003-RepsSJ #analysis #automaton #data flow #interprocedural

Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis (TWR, SS, SJ), pp. 189–213.

DLT-2003-Csuhaj-VarjuMV #automaton #distributed

Distributed Pushdown Automata Systems: Computational Power (ECV, VM, GV), pp. 218–229.

DLT-2003-HolzerK03a #automaton #nondeterminism

Flip-Pushdown Automata: Nondeterminism Is Better than Determinism (MH, MK), pp. 361–372.

DLT-2003-Rahonis #automaton #transducer

Alphabetic Pushdown Tree Transducers (GR), pp. 423–436.

ICALP-2003-Cachat #automaton #game studies #graph #higher-order

Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games (TC), pp. 556–569.

ICALP-2003-HolzerK #automaton

Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k (MH, MK), pp. 490–501.

ICALP-2003-HromkovicS #automaton #comparison #multi

Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes (JH, GS), pp. 66–80.

FoSSaCS-2002-KnapikNU #automaton #higher-order

Higher-Order Pushdown Trees Are Easy (TK, DN, PU), pp. 205–222.

ICALP-2002-Cachat #automaton #game studies #graph #synthesis

Symbolic Strategy Synthesis for Games on Pushdown Graphs (TC), pp. 704–715.

CSL-2002-CachatDT #automaton #game studies

Solving Pushdown Games with a Σ₃ Winning Condition (TC, JD, WT), pp. 322–336.

CIAA-2001-DangBIK #automaton

Past Pushdown Timed Automata (ZD, TB, OHI, RAK), pp. 74–86.

DLT-2001-HromkovicS #automaton #on the #power of #random

On the Power of Randomized Pushdown Automata (JH, GS), pp. 262–271.

CAV-2001-Dang #analysis #automaton #reachability

Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks (ZD), pp. 506–518.

CAV-2000-DangIBKS #analysis #automaton #reachability

Binary Reachability Analysis of Discrete Pushdown Timed Automata (ZD, OHI, TB, RAK, JS), pp. 69–84.

CAV-2000-EsparzaHRS #algorithm #automaton #model checking #performance

Efficient Algorithms for Model Checking Pushdown Systems (JE, DH, PR, SS), pp. 232–247.

DLT-1997-Neumann #ambiguity #automaton #modelling #revisited

Unambiguity of SGML Content Models — Pushdown Automata Revisited (AN), pp. 507–518.

ICALP-1997-Senizergues #automaton #decidability #equivalence #problem

The Equivalence Problem for Deterministic Pushdown Automata is Decidable (GS), pp. 671–681.

CAV-1996-Walukiewicz #automaton #game studies #model checking #process

Pushdown Processes: Games and Model Checking (IW), pp. 62–74.

DLT-1995-KutribR #automaton #realtime

Real-Time One-Way Pushdown Cellular Automata Languages (MK, JR), pp. 420–429.

DLT-1995-Nederhof #automaton #bidirectional #parsing

Reversible Pushdown Automata and Bidirectional Parsing (MJN), pp. 472–481.

RTA-1991-CoquideDGV #automaton #bottom-up #term rewriting

Bottom-Up Tree Pushdown Automata and Rewrite Systems (JLC, MD, RG, SV), pp. 287–298.

ICALP-1990-Kuich #algebra #automaton

ω-Continuous Semirings, Algebraic Systems and Pushdown Automata (WK), pp. 103–110.

ICALP-1984-Girault-Beauquier #automaton #behaviour #finite #infinity

Some Results About Finite and Infinite Behaviours of a Pushdown Automaton (DB), pp. 187–195.

STOC-1983-Engelfriet #automaton #complexity

Iterated Pushdown Automata and Complexity Classes (JE), pp. 365–373.

ICALP-1982-DurisG #automaton #bound #on the

On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store (PD, ZG), pp. 166–175.

STOC-1981-DurisG #automaton

Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version) (PD, ZG), pp. 177–188.

STOC-1981-MullerS #automaton #graph #higher-order #logic #problem #reachability

Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems (DEM, PES), pp. 46–54.

STOC-1980-Pippenger #comparative

Comparative Schematology and Pebbling with Auxiliary Pushdowns (Preliminary Version) (NP), pp. 351–356.

STOC-1980-Ukkonen #automaton #equivalence #realtime

A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown Automata (EU), pp. 29–38.

STOC-1977-Sudborough #automaton #bound

Separating Tape Bounded Auxiliary Pushdown Automata Classes (IHS), pp. 208–217.

STOC-1976-Sudborough #automaton #context-free grammar #multi #on the #power of

On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store (IHS), pp. 141–148.

STOC-1974-Valiant #automaton #decidability #equivalence

The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata (LGV), pp. 27–32.

ICALP-1972-Monien #automaton #bound #turing machine

Relationship between Pushdown Automata and Tape-Bounded Turing Machines (BM), pp. 575–583.

STOC-1969-Cole #automaton #realtime

Pushdown Store Machines and Real-Time Computation (SNC), pp. 233–245.

STOC-1969-Cook #automaton

Variations on Pushdown Machines (Detailed Abstract) (SAC), pp. 229–231.