[. Alur, K. Etessami, and M. Yannakakis, Analysis of recursive state machines, Proceedings of CAV, pp.207-220, 2001.

P. Baldan, A. Bruni, A. Corradini, B. König, and S. Schwoon, On the Computation of McMillan???s Prefix for Contextual Nets and Graph Grammars, Proceedings of ICGT, pp.91-106, 2010.
DOI : 10.1007/978-3-642-15928-2_7

P. Baldan, A. Bruni, A. Corradini, B. König, C. Rodríguez et al., Efficient unfolding of contextual Petri nets, Theoretical Computer Science, vol.449, issue.1, pp.2-22, 2012.
DOI : 10.1016/j.tcs.2012.04.046
URL : https://hal.archives-ouvertes.fr/hal-00776752

S. Balaguer, T. Chatain, and S. Haar, Building Tight Occurrence Nets from Reveals Relations, 2011 Eleventh International Conference on Application of Concurrency to System Design, pp.44-53, 2011.
DOI : 10.1109/ACSD.2011.16
URL : https://hal.archives-ouvertes.fr/inria-00638232

C. H. Broadbent, A. Carayol, M. Hague, and O. Serre, A Saturation Method for Collapsible Pushdown Systems, Proceedings of ICALP, Part II, pp.165-176, 2012.
DOI : 10.1007/978-3-642-31585-5_18
URL : https://hal.archives-ouvertes.fr/hal-00694991

P. Baldan, A. Corradini, B. König, and S. Schwoon, McMillan???s Complete Prefix for Contextual Nets, Proceedings of the UFO workshop, pp.32-49, 2007.
DOI : 10.1007/BFb0055644

[. Baldan, A. Corradini, B. König, and S. Schwoon, McMillan's complete prefix for contextual nets. Transactions on Petri Nets and Other Models of Concurrency, LNCS, vol.1, issue.5100, pp.199-220, 2008.

P. Baldan, A. Corradini, and U. Montanari, An event structure semantics for P/T contextual nets: Asymmetric event structures, Proceeding of FoSSaCS, pp.63-80, 1998.
DOI : 10.1007/BFb0053542

P. Baldan, A. Corradini, and U. Montanari, Contextual Petri Nets, Asymmetric Event Structures, and Processes, Information and Computation, vol.171, issue.1, pp.1-49, 2001.
DOI : 10.1006/inco.2001.3060
URL : http://doi.org/10.1006/inco.2001.3060

A. Bouajjani and M. Emmi, Bounded phase analysis of message-passing programs, Proceedings of TACAS, pp.451-465, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00653085

[. Bellman, On a routing problem, Quarterly of Applied Mathematics, vol.16, issue.1, pp.87-90, 1958.
DOI : 10.1090/qam/102435

A. Bouajjani, J. Esparza, and O. Maler, Reachability analysis of pushdown automata: Application to model-checking, Proceedings of CONCUR 1997, pp.135-150, 1997.
DOI : 10.1007/3-540-63141-0_10

A. Bouajjani, J. Esparza, S. Schwoon, and J. Strej?ek, Reachability Analysis of Multithreaded Software with Asynchronous Communication, Proceedings of FSTTCS, pp.348-359, 2005.
DOI : 10.1007/11590156_28

A. Bouajjani, J. Esparza, S. Schwoon, and D. Suwimonteerabuth, SDSIrep: A Reputation System Based on SDSI, Proceedings of TACAS, pp.501-516, 2008.
DOI : 10.1007/978-3-540-78800-3_39

[. Bouajjani, J. Esparza, and T. Touili, A Generic Approach to the Static Analysis of Concurrent Programs with Procedures, International Journal of Foundations of Computer Science, vol.14, issue.04, pp.551-582, 2003.
DOI : 10.1142/S0129054103001893
URL : https://hal.archives-ouvertes.fr/hal-00161121

A. Bouajjani, J. Esparza, and T. Touili, A generic approach to the static analysis of concurrent programs with procedures, Proceedings of POPL, pp.62-73, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00161121

[. Benveniste, E. Fabre, S. Haar, and C. Jard, Diagnosis of asynchronous discrete-event systems: a net unfolding approach, IEEE Transactions on Automatic Control, vol.48, issue.5, pp.714-727, 2003.
DOI : 10.1109/TAC.2003.811249
URL : https://hal.archives-ouvertes.fr/inria-00638345

A. Bouajjani, S. Fratani, and S. Qadeer, Contextbounded analysis of multithreaded programs with dynamic linked structures, Proceedings of CAVBGR01] Michael Benedikt, Patrice Godefroid, and Thomas W. Reps. Model checking of unrestricted hierarchical state machines Proceedings of ICALP, pp.207-220, 2001.

R. Balakrishnan, T. W. Gruian, T. Reps, and . Teitelbaum, CodeSurfer/x86???A Platform for Analyzing x86 Executables, Conference on Compiler Construction, pp.250-254, 2005.
DOI : 10.1007/978-3-540-31985-6_19

[. Bouajjani, M. Müller-olm, and T. Touili, Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems, Proceedings of CONCUR, pp.473-487, 2005.
DOI : 10.1007/11539452_36
URL : https://hal.archives-ouvertes.fr/hal-00161107

V. Ronald, F. Book, and . Otto, String-Rewriting Systems. Texts and Monographs in Computer Science, 1993.

T. Ball and S. K. Rajamani, Bebop: A Symbolic Model Checker for Boolean Programs, Proceedings of the SPIN Workshop, pp.113-130, 2000.
DOI : 10.1007/10722468_7

T. Ball and S. K. Rajamani, Automatically validating temporal safety properties of interfaces, Proceedings of SPIN, pp.103-122, 2001.
DOI : 10.1007/3-540-45139-0_7

R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.35677-691, 1986.
DOI : 10.1109/TC.1986.1676819

[. Bauer and K. Samelson, Verfahren zur automatischen verarbeitung von kodierten daten und rechenmaschine zur ausbung des verfahrens, 1957.

[. Büchi, Regular canonical systems and finite automata, Arch. Math. Logik, vol.6, pp.91-111, 1964.

D. Caucal, On the regular structure of prefix rewriting, Theoretical Computer Science, vol.106, issue.1, pp.61-86, 1992.
DOI : 10.1016/0304-3975(92)90278-N

E. Sagar-chaki, A. Clarke, and . Groce, Somesh Jha, and Helmut Veith. Modular verification of software components in C, Proceedings of ICSE, pp.385-395, 2003.

E. M. Sagar-chaki, N. Clarke, T. W. Kidd, T. Reps, and . Touili, Verifying concurrent message-passing C programs with recursive calls, Proceedings of TACAS, pp.334-349, 2006.

O. Clarke, S. Grumberg, Y. Jha, H. Lu, and . Veith, Counterexample-guided abstraction refinement, Proceedings of CAV, LNCS 1855, pp.154-169, 2000.
DOI : 10.1109/time.2003.1214874
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.407

[. Codish, S. Genaim, and P. J. Stuckey, A declarative encoding of telecommunications feature subscription in SAT, Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, PPDP '09, pp.255-266, 2009.
DOI : 10.1145/1599410.1599442

W. Edsger and . Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.1, pp.269-271, 1959.

W. Edsger and . Dijkstra, Solution of a problem in concurrent programming control, Communications of the ACM, vol.8, issue.9, p.569, 1965.

J. Esparza, P. Ganty, and S. Schwoon, Locality-Based Abstractions, Proceedings of SAS, pp.118-134, 2005.
DOI : 10.1007/11547662_10

J. Esparza and K. Heljanko, Implementing LTL model checking with net unfoldings, Proceedings of SPIN, pp.37-56, 2001.
DOI : 10.1007/3-540-45139-0_4

J. Esparza and K. Heljanko, Unfoldings -A Partial-Order Approach to Model Checking, EATCS Monographs in Theoretical Computer Science, 2008.

[. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon, Efficient Algorithms for Model Checking Pushdown Systems, Proceedings of CAV, pp.232-247, 2000.
DOI : 10.1007/10722167_20

J. Esparza, L. Jezequel, and S. Schwoon, Computation of summaries using net unfoldings, Proceedings of FSTTCS, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00925457

J. Esparza and J. Knoop, An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis, Proceedings of FoSSaCS, pp.14-30, 1999.
DOI : 10.1007/3-540-49019-1_2

J. Esparza and C. Kern, Reactive and Proactive Diagnosis of Distributed Systems Using Net Unfoldings, 2012 12th International Conference on Application of Concurrency to System Design, pp.154-163, 2012.
DOI : 10.1109/ACSD.2012.19

[. Esparza, S. Kiefer, and M. Luttenberger, An Extension of Newton???s Method to ??-Continuous Semirings, Proceedings of DLT, pp.157-168, 2007.
DOI : 10.1007/978-3-540-73208-2_17

[. Esparza, S. Kiefer, and M. Luttenberger, On Fixed Point Equations over Commutative Semirings, Proceedings of STACS, pp.296-307, 2007.
DOI : 10.1007/978-3-540-70918-3_26

J. Esparza, S. Kiefer, and M. Luttenberger, Newton???s Method for ??-Continuous Semirings, Proceedings of ICALP, pp.14-26, 2008.
DOI : 10.1007/978-3-540-70583-3_2

J. Esparza, S. Kiefer, and S. Schwoon, Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems, Proceedings of TACAS, pp.489-503, 2006.
DOI : 10.2307/2963593

[. Esparza, P. Kanade, and S. Schwoon, A negative result on depth-first unfoldings. Software Tools for Technology Transfer, pp.161-166, 2008.

[. Esparza, S. Kiefer, and S. Schwoon, Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems, Journal on Satisfiability Boolean Modeling and Computation, vol.22, pp.27-56, 2008.
DOI : 10.2307/2963593

J. Esparza, P. Rossmanith, and S. Schwoon, A uniform framework for problems on context-free grammars, EATCS Bulletin, vol.72, pp.169-177, 2000.

J. Esparza, S. Römer, and W. Vogler, An improvement of McMillan's unfolding algorithm. Formal Methods in System Design, pp.285-310, 2002.

J. Esparza and S. Schwoon, A BDD-Based Model Checker for Recursive Programs, Proceedings of CAV, pp.324-336, 2001.
DOI : 10.1007/3-540-44585-4_30

[. Eén and N. Sörensson, An extensible SAT-solver, Proceedings of SAT, pp.502-518, 2003.

R. Lester and . Ford, Network flow theory, 1956.

A. Finkel, B. Willems, and P. Wolper, A direct symbolic approach to model checking pushdown systems, Electronic Notes in Theoretical Computer Science, vol.9, 1997.

A. Gaiser, Erreichbarkeitsanalyse funktionaler programme mit grundtermersetzungssystemen, 2008.

T. Gawlitza and H. Seidl, Precise Fixpoint Computation Through Strategy Iteration, Proceedings of ESOP, pp.300-315, 2007.
DOI : 10.1007/978-3-540-71316-6_21

T. Gawlitza and H. Seidl, Precise Relational Invariants Through Strategy Iteration, Proceedings of CSL, pp.23-40, 2007.
DOI : 10.1007/978-3-540-74915-8_6

A. Gaiser and S. Schwoon, Comparison of algorithms for checking emptiness on Büchi automata, Proceedings of the MEMICS workshop, pp.69-77, 2009.

S. Haar, Unfold and cover: Qualitative diagnosability for Petri Nets, 2007 46th IEEE Conference on Decision and Control, pp.1886-1891, 2007.
DOI : 10.1109/CDC.2007.4434691
URL : https://hal.archives-ouvertes.fr/inria-00638308

S. Haar, Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets, IEEE Transactions on Automatic Control, vol.55, issue.10, pp.2310-2320, 2010.
DOI : 10.1109/TAC.2010.2063490
URL : https://hal.archives-ouvertes.fr/inria-00379540

[. Hamblin, Computer languages, The Australian Journal of Science, vol.20, pp.135-139, 1957.

[. Haar, S. Haddad, T. Melliti, and S. Schwoon, Optimal constructions for active diagnosis, Proceedings of FSTTCS, 2013.
DOI : 10.1016/j.jcss.2016.04.007
URL : https://hal.archives-ouvertes.fr/hal-00926098

A. Tom, R. Henzinger, R. Jhala, G. Majumdar, and . Sutre, Lazy abstraction, Proceedings of POPL, pp.58-70, 2002.

W. Mark, D. Hopkins, and . Kozen, Parikh's theorem in commutative Kleene algebra Computing the reveals relation in occurrence nets, Proceedings of LICS Proceedings of GandALF, volume 54 of Electronic Proceedings in Theoretical Computer Science, pp.394-401, 1999.

[. Haar, C. Kern, and S. Schwoon, Computing the reveals relation in occurrence nets, Theoretical Computer Science, vol.493, pp.66-79, 2013.
DOI : 10.1016/j.tcs.2013.04.028
URL : https://hal.archives-ouvertes.fr/inria-00638262

[. Heußner, J. Leroux, A. Muscholl, and G. Sutre, Reachability analysis of communicating pushdown systems, Proceedings of FOSSACS, pp.267-281, 2010.

M. Hague and C. Ong, Symbolic backwardsreachability analysis for higher-order pushdown systems, Proceedings of FOSSACS, pp.213-227, 2007.

J. Gerard and . Holzmann, The SPIN Model Checker -primer and reference manual, 2004.

[. Haar, C. Rodríguez, and S. Schwoon, Reveal Your Faults: It's Only Fair!, 2013 13th International Conference on Application of Concurrency to System Design, pp.127-136, 2013.
DOI : 10.1109/ACSD.2013.15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.9818

M. Hs04a, S. Holzer, and . Schwoon, Assembling molecules in Atomix is hard, Theoretical Computer Science, vol.303, issue.3, pp.447-462, 2004.

M. Holzer and S. Schwoon, Reflections on Reflexion ? computational complexity considerations on a puzzle game, Proceedings of the Third International Conference on FUN with Algorithms, pp.90-105, 2004.

R. Janicki and M. Koutny, Invariant semantics of nets with inhibitor arcs, Proceedings of CONCUR, pp.317-331, 1991.
DOI : 10.1007/3-540-54430-5_97

[. Jha and T. Reps, Analysis of SPKI/SDSI certificates using model checking, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15, pp.129-146, 2002.
DOI : 10.1109/CSFW.2002.1021812

[. Jha, S. Schwoon, H. Wang, and T. Reps, Weighted Pushdown Systems and Trust-Management Systems, Proceedings of TACAS, pp.1-26, 2006.
DOI : 10.1016/j.scico.2005.02.009

[. Kahlon, Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks, 2009 24th Annual IEEE Symposium on Logic In Computer Science, pp.27-36, 2009.
DOI : 10.1109/LICS.2009.45

V. Kho and . Khomenko, The Punf unfolding tool

F. Vineet-kahlon, A. Ivancic, and . Gupta, Reasoning about threads communicating via locks, Proceedings of CAV, pp.505-518, 2005.

V. Khomenko and M. Koutny, LP Deadlock Checking Using Partial Order Dependencies, Proc. CONCUR, LNCS 1877, pp.410-425, 2000.
DOI : 10.1007/3-540-44618-4_30

V. Khomenko and M. Koutny, Towards an Efficient Algorithm for Unfolding Petri Nets, Proc. CONCUR, LNCS 2154, pp.366-380, 2001.
DOI : 10.1007/3-540-44685-0_25

V. Khomenko and M. Koutny, Verification of bounded Petri nets using integer programming. Formal Methods in System Design, pp.143-176, 2007.

[. Khomenko, A. Kondratyev, M. Koutny, and W. Vogler, Merged processes: a new condensed representation of Petri net behaviour, Acta Informatica, vol.77, issue.5, pp.307-330, 2006.
DOI : 10.1007/s00236-006-0023-y

[. Khomenko, M. Koutny, and W. Vogler, Canonical prefixes of Petri net unfoldings, Acta Informatica, vol.40, issue.2, pp.95-118, 2003.
DOI : 10.1007/s00236-003-0122-y

V. Khomenko and A. Mokhov, An Algorithm for Direct Construction of Complete Merged Processes, Proceedings of Petri Nets, pp.89-108, 2011.
DOI : 10.1007/3-540-45657-0_2

[. Kidd, T. Reps, D. Melski, and A. Lal, WALi: the weighted automata library, 2006.

[. Kühnrich, S. Schwoon, J. Srba, and S. Kiefer, Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains, Proceedings of FOSSACS, pp.440-455, 2009.
DOI : 10.1007/978-3-540-71389-0_25

[. Kühnrich, S. Schwoon, J. Srba, and S. Kiefer, Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains, 2009.
DOI : 10.1007/978-3-540-71389-0_25

S. La-torre, P. Madhusudan, and G. Parlato, Context-Bounded Analysis of Concurrent Queue Systems, Proceedings of TACAS, pp.299-314, 2008.
DOI : 10.1007/978-3-540-78800-3_21

S. La-torre, P. Madhusudan, and G. Parlato, Reducing Context-Bounded Concurrent Reachability to Sequential Reachability, Proceedings of CAV, pp.477-492, 2009.
DOI : 10.1007/978-3-642-02658-4_36

S. L. , T. , and M. Napoli, Reachability of multistack pushdown systems with scope-bounded matching relations, Proceedings of CONCUR, pp.203-218, 2011.

[. Löding, Reachability Problems on Regular Ground Tree Rewriting Graphs, Theory of Computing Systems, pp.347-383, 2006.
DOI : 10.1007/s00224-004-1170-6

A. Lal and T. W. Reps, Reducing concurrent analysis under a context bound to sequential analysis. Formal Methods in System Design, pp.73-97, 2009.

[. Lal, T. W. Reps, and G. Balakrishnan, Extended Weighted Pushdown Systems, Proceedings of CAV, pp.434-448, 2005.
DOI : 10.1007/11513988_44

J. Leroux and G. Sutre, Accelerated Data-Flow Analysis, Proceedings of SAS, pp.184-199, 2007.
DOI : 10.1007/978-3-540-74061-2_12
URL : https://hal.archives-ouvertes.fr/hal-00346005

[. Lal, T. Touili, N. Kidd, and T. W. Reps, Interprocedural Analysis of Concurrent Programs Under a Context Bound, Proceedings of TACAS, pp.282-298, 2008.
DOI : 10.1007/978-3-540-78800-3_20

R. Mayr, Decidability and Complexity of Model Checking Problems for Infinite-State Systems, 1998.

K. L. Mcmillan, Symbolic Model Checking: an approach to the state explosion problem, 1992.

K. L. Mcmillan, Interpolation and SAT-Based Model Checking, Proceedings of CAV, pp.1-13, 2003.
DOI : 10.1007/978-3-540-45069-6_1

[. Müller-olm and H. Seidl, Precise interprocedural analysis through linear algebra, Proceedings of POPL, pp.330-341, 2004.

U. Montanari and F. Rossi, Contextual occurrence nets and concurrent constraint programming, Dagstuhl Seminar 9301, pp.280-295, 1994.
DOI : 10.1007/3-540-57787-4_18

U. Montanari and F. Rossi, Contextual nets, Acta Informatica, vol.112, issue.6, pp.545-596, 1995.
DOI : 10.1007/BF01178907

S. Melzer and S. Römer, Deadlock checking using net unfoldings, Proceedings of CAV, pp.352-363, 1997.
DOI : 10.1007/3-540-63166-6_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.3517

[. Nielsen, G. D. Plotkin, and G. Winskel, Petri nets, event structures and domains, part I, Theoretical Computer Science, vol.13, issue.1, pp.85-108, 1981.
DOI : 10.1016/0304-3975(81)90112-2

[. Naldurg, S. Schwoon, S. Rajamani, and J. Lambert, :, Proceedings of the fourth ACM workshop on Formal methods in security , FMSE '06, pp.55-66, 2006.
DOI : 10.1145/1180337.1180343

A. Newell, J. C. Shaw, and H. A. Simon, Report on a general problem-solving program, International Conference on Information Processing, pp.256-264, 1959.

C. Adam and P. , Kommunikation mit Automaten, 1962.

S. Qadeer and J. Rehof, Context-Bounded Model Checking of Concurrent Software, Proceedings of TACAS 2005, pp.93-107, 2005.
DOI : 10.1007/978-3-540-31980-1_7

S. Qadeer and D. Wu, KISS: keep it simple and sequential, Proceedings of PLDI, pp.14-24, 2004.

[. Ramalingam, Bounded Incremental Computation, LNCS, vol.1089, 1996.
DOI : 10.1007/BFb0028290

[. Ramalingam, Context-sensitive synchronization-sensitive analysis is undecidable, ACM Transactions on Programming Languages and Systems, vol.22, issue.2, pp.416-430, 2000.
DOI : 10.1145/349214.349241
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.538

]. M. Ray86, Algorithms for Mutual Exclusion, 1986.

[. Reisig, Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets, 1998.
DOI : 10.1007/978-3-662-03687-7

[. Ristori, Modelling Systems with Shared Resources via Petri Nets, 1994.

[. Rodríguez and S. Schwoon, Verification of Petri Nets with Read Arcs, Proceedings of Concur, pp.471-485, 2012.
DOI : 10.1007/978-3-642-32940-1_33

[. Rodríguez and S. Schwoon, An improved construction of Petri net unfoldings, Proceedings of the FSFMA workshop, pp.47-52, 2013.

[. Rodríguez, S. Schwoon, and P. Baldan, Efficient Contextual Unfolding, Proceedings of Concur, pp.342-357, 2011.
DOI : 10.1007/BFb0055644

[. Reps, S. Schwoon, and S. Jha, Weighted pushdown systems and their application to interprocedural dataflow analysis, Proceedings of SAS, pp.189-213, 2003.

[. Reps, S. Schwoon, S. Jha, and D. Melski, Weighted pushdown systems and their application to interprocedural dataflow analysis, Special Issue on the Static Analysis Symposium, pp.206-263, 2003.
DOI : 10.1016/j.scico.2005.02.009

C. Rodríguez, S. Schwoon, and V. Khomenko, Contextual Merged Processes, Proceedings of ICATPN, pp.29-48, 2013.
DOI : 10.1007/978-3-642-38697-8_3

[. Suwimonteerabuth, F. Berger, S. Schwoon, and J. Esparza, jMoped: A Test Environment for Java Programs, Proceedings of CAV, pp.164-167, 2007.
DOI : 10.1007/978-3-540-73368-3_19

S. Schwoon, WPDS: A library for weighted pushdown systems

S. Schwoon, Determinization and Complementation of Streett Automata, Automata, Logics, and Infinite Games, pp.79-91, 2002.
DOI : 10.1007/3-540-36387-4_5

S. Schwoon, Model-Checking Pushdown Systems, 2002.

S. Schwoon and J. Esparza, A Note on On-the-Fly Verification Algorithms, Proceedings of TACAS, pp.174-190, 2005.
DOI : 10.1007/978-3-540-31980-1_12

[. Suwimonteerabuth, J. Esparza, and S. Schwoon, Symbolic Context-Bounded Analysis of Multithreaded Java Programs, Proceedings of SPIN, pp.270-287, 2008.
DOI : 10.1007/978-3-540-85114-1_19

[. Schwoon, S. Jha, T. Reps, and S. Stubblebine, On generalized authorization problems, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings., pp.202-218, 2003.
DOI : 10.1109/CSFW.2003.1212714

M. Sharir and A. Pnueli, Two approaches to interprocedural data flow analysis, Program Flow Analysis: Theory and Applications, pp.189-234

M. Sachenbacher and S. Schwoon, Model-based test generation using quantified CSPs: A map, Proceedings of the ECAI 2008 Workshop on Model-Based Systems, pp.37-41, 2008.

D. Suwimonteerabuth, S. Schwoon, and J. Esparza, jMoped: A Java Bytecode Checker Based on Moped, Proceedings of TACAS, pp.541-545, 2005.
DOI : 10.1007/978-3-540-31980-1_35

[. Suwimonteerabuth, S. Schwoon, and J. Esparza, Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains, Proceedings of ATVA, pp.141-153, 2006.
DOI : 10.1007/11901914_13

[. Suwimonteerabuth, Reachability in Pushdown Systems: Algorithms and Applications, 2009.

A. Tozawa and Y. Minamide, Complexity Results on Balanced Context-Free Languages, Proceedings of FoSSaCS, pp.346-360, 2007.
DOI : 10.1007/978-3-540-71389-0_25

A. M. Turing, Proposal for the development in the mathematics division of an automatic computing engine, 1945.

[. Vogler, A. L. Semenov, and A. Yakovlev, Unfolding and finite prefix for nets with read arcs, Proceedings of CONCUR, LNCS 1466, pp.501-516, 1998.
DOI : 10.1007/BFb0055644

Y. Moshe, P. Vardi, and . Wolper, Automata theoretic techniques for modal logics of programs, Journal of Computer and System Sciences, vol.32, pp.183-221, 1986.

I. Walukiewicz, Pushdown Processes: Games and Model Checking, Proceedings of CAV, pp.62-74, 1996.
DOI : 10.7146/brics.v3i54.20057
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.4162

I. Walukiewicz, Model Checking CTL Properties of Pushdown Systems, Proceedings of FSTTCS, pp.127-138, 2000.
DOI : 10.1007/3-540-44450-5_10

A. Wenner, Weighted Dynamic Pushdown Networks, Proceedings of ESOP, pp.590-609, 2010.
DOI : 10.1007/978-3-642-11957-6_31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.3993

J. Winkowski, Reachability in contextual nets, Fundamenta Informaticae, vol.51, issue.12, pp.235-250, 2002.

S. [. Woo and . Lam, A semantic model for authentication protocols, Proceedings 1993 IEEE Computer Society Symposium on Research in Security and Privacy, pp.178-194, 1993.
DOI : 10.1109/RISP.1993.287633