Reachability Problems

s of Invited Talks The Ideal Theory for WSTS

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

[2]  Kedar S. Namjoshi,et al.  Uncovering Symmetries in Irregular Process Networks , 2013, VMCAI.

[3]  Margherita Napoli,et al.  Scope-Bounded Pushdown Languages , 2014, Developments in Language Theory.

[4]  Giorgio Delzanno,et al.  A Logic-based Approach to Verify Distributed Protocols , 2016, CILC.

[5]  Madan Musuvathi,et al.  Iterative context bounding for systematic testing of multithreaded programs , 2007, PLDI '07.

[6]  Kedar S. Namjoshi,et al.  On model checking for non-deterministic infinite-state systems , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[7]  B. Scarpellini.  Complexity of subcases of Presburger arithmetic , 1984 .

[8]  Tayssir Touili,et al.  Interprocedural Analysis of Concurrent Programs Under a Context Bound , 2008, TACAS.

[9]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[10]  Jan Stückrath,et al.  Uncover: Using Coverability Analysis for Verifying Graph Transformation Systems , 2015, ICGT.

[11]  Christof Löding,et al.  Modeling and Verification of Infinite Systems with Resources , 2013, Log. Methods Comput. Sci..

[12]  Giorgio Delzanno,et al.  On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks , 2012, FSTTCS.

[13]  Constantin Enea,et al.  A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes , 2007, Log. Methods Comput. Sci..

[14]  Arend Rensink,et al.  Modelling and analysis using GROOVE , 2010, International Journal on Software Tools for Technology Transfer.

[15]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.

[16]  Javier Esparza,et al.  Symbolic Context-Bounded Analysis of Multithreaded Java Programs , 2008, SPIN.

[17]  G. Ramalingam,et al.  Context-sensitive synchronization-sensitive analysis is undecidable , 2000, TOPL.

[18]  Alberto Pettorossi,et al.  Improving Reachability Analysis of Infinite State Systems by Specialization , 2011, Fundam. Informaticae.

[19]  Salvatore La Torre,et al.  A Robust Class of Context-Sensitive Languages , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[20]  Roland Meyer,et al.  Petruchio: From Dynamic Networks to Nets , 2010, CAV.

[21]  Laure Petrucci,et al.  FAST: acceleration from theory to practice , 2008, International Journal on Software Tools for Technology Transfer.

[22]  Richard Mayr.  Decidability and complexity of model checking problems for infinite state systems , 1998 .

[23]  Grégoire Sutre,et al.  Hyper-Ackermannian bounds for pushdown vector addition systems , 2014, CSL-LICS.

[24]  Shaz Qadeer.  The Case for Context-Bounded Verification of Concurrent Programs , 2008, SPIN.

[25]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

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

[27]  Anthony Widjaja Lin,et al.  Weakly-Synchronized Ground Tree Rewriting - (with Applications to Verifying Multithreaded Programs) , 2012, MFCS.

[28]  Nathalie Bertrand,et al.  On the Decidability Status of Reachability and Coverability in Graph Transformation Systems , 2012, RTA.

[29]  Christof Löding.  Reachability Problems on Regular Ground Tree Rewriting Graphs , 2004, Theory of Computing Systems.

[30]  Barbara König,et al.  Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems , 2008, GT-VMT@ETAPS.

[31]  Anthony Widjaja Lin,et al.  Model Checking Recursive Programs with Numeric Data Types , 2011, CAV.

[32]  Anthony Widjaja Lin,et al.  Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters , 2012, CAV.

[33]  Anthony Widjaja Lin,et al.  Algorithmic metatheorems for decidable LTL model checking over infinite systems , 2010, FoSSaCS.

[34]  Vojtech Rehák,et al.  Extended Process Rewrite Systems: Expressiveness and Reachability , 2004, CONCUR.