Reachability Problems

s of Invited Talks On the Computational Complexity of Solving Ordinary Differential Equations

[1]  Pawel Parys,et al.  The Complexity of the Diagonal Problem for Recursion Schemes , 2017, FSTTCS.

[2]  Naoki Kobayashi.  Higher-Order Model Checking: From Theory to Practice , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[3]  C.-H. Luke Ong,et al.  Winning Regions of Pushdown Parity Games: A Saturation Method , 2009, CONCUR.

[4]  Stefan Schwoon,et al.  Model checking pushdown systems , 2002 .

[5]  Vincent Penelle,et al.  Constrained Dynamic Tree Networks , 2018, RP.

[6]  Kazutaka Matsuda,et al.  Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking , 2014, CONCUR.

[7]  Anil Seth.  Games on Higher Order Multi-stack Pushdown Systems , 2009, RP.

[8]  Javier Esparza,et al.  jMoped: A Test Environment for Java Programs , 2007, CAV.

[9]  Olivier Serre,et al.  C-SHORe: a collapsible approach to higher-order verification , 2013, ICFP.

[10]  Anca Muscholl,et al.  Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable , 2015, CONCUR.

[11]  C.-H. Luke Ong,et al.  On Model-Checking Trees Generated by Higher-Order Recursion Schemes , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[12]  Jakob Rehof,et al.  Context-Bounded Model Checking of Concurrent Software , 2005, TACAS.

[13]  Lorenzo Clemente,et al.  Ordered Tree-Pushdown Systems , 2015, FSTTCS.

[14]  Philippe Schnoebelen,et al.  The regular viewpoint on PA-processes , 1998, Theor. Comput. Sci..

[15]  Tayssir Touili,et al.  Model checking dynamic pushdown networks , 2014, Formal Aspects of Computing.

[16]  Christof Löding,et al.  Infinite graphs generated by tree rewriting , 2003 .

[17]  Tayssir Touili,et al.  Verifying Parallel Programs with Dynamic Communication Structures , 2009, CIAA.

[18]  Anca Muscholl,et al.  Reachability for Dynamic Parametric Processes , 2017, VMCAI.

[19]  Andrzej S. Murawski,et al.  Collapsible Pushdown Automata and Recursion Schemes , 2008, LICS.

[20]  Naoki Kobayashi.  A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes , 2011, FoSSaCS.

[21]  Atsushi Igarashi,et al.  Model-Checking Higher-Order Programs with Recursive Types , 2013, ESOP.

[22]  Helmut Seidl,et al.  Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation , 2011, VMCAI.

[23]  C. Aiswarya,et al.  MSO Decidability of Multi-Pushdown Systems via Split-Width , 2012, CONCUR.

[24]  Helmut Seidl,et al.  Contextual Locking for Dynamic Pushdown Networks , 2013, SAS.

[25]  Markus Müller-Olm,et al.  Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints , 2009, CAV.

[26]  Denis Lugiez.  Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order , 2009, RP.

[27]  Javier Esparza,et al.  Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.

[28]  C.-H. Luke Ong,et al.  A type-directed abstraction refinement approach to higher-order model checking , 2014, POPL.

[29]  Matthew Hague,et al.  Saturation of Concurrent Collapsible Pushdown Systems , 2013, FSTTCS.

[30]  Tayssir Touili,et al.  Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems , 2005, CONCUR.

[31]  Lorenzo Clemente,et al.  The Diagonal Problem for Higher-Order Recursion Schemes is Decidable* , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[32]  Markus Müller-Olm,et al.  Iterable Forward Reachability Analysis of Monitor-DPNs , 2013, Festschrift for Dave Schmidt.

[33]  Naoki Kobayashi.  Model-checking higher-order functions , 2009, PPDP '09.

[34]  Walter S. Brainerd,et al.  Tree Generating Regular Systems , 1969, Inf. Control..

[35]  Naoki Kobayashi,et al.  Saturation-Based Model Checking of Higher-Order Recursion Schemes , 2013, CSL.

[36]  Naoki Kobayashi,et al.  Verification of Higher-Order Concurrent Programs with Dynamic Resource Creation , 2016, APLAS.

[37]  C.-H. Luke Ong,et al.  A traversal-based algorithm for higher-order model checking , 2012, ICFP '12.

[38]  C.-H. Luke Ong,et al.  Unboundedness and downward closures of higher-order pushdown automata , 2015, POPL.

[39]  Mahesh Viswanathan,et al.  Decidability Results for Well-Structured Transition Systems with Auxiliary Storage , 2007, CONCUR.

[40]  Olivier Serre,et al.  A Saturation Method for Collapsible Pushdown Systems , 2012, ICALP.

[41]  Vincent Penelle.  Rewriting Higher-Order Stack Trees , 2015, CSR.

[42]  Gennaro Parlato,et al.  The tree width of auxiliary storage , 2011, POPL '11.