Rajeev Alur & P. Madhusudan (2009):
Adding nesting structure to words.
J. ACM 56(3),
doi:10.1145/1516512.1516518.
Sanjeev Arora & Boaz Barak (2009):
Computational Complexity–A Modern Approach.
Cambridge University Press,
doi:10.1017/CBO9780511804090.
Mohamed Faouzi Atig & Pierre Ganty (2011):
Approximating Petri Net Reachability Along Context-free Traces.
In: FSTTCS 2011,
LIPIcs 13,
pp. 152–163,
doi:10.4230/LIPIcs.FSTTCS.2011.152.
Javier Esparza, Pierre Ganty, Stefan Kiefer & Michael Luttenberger (2011):
Parikh's theorem: A simple and direct automaton construction.
Inf. Process. Lett. 111(12),
pp. 614–619,
doi:10.1016/j.ipl.2011.03.019.
Javier Esparza, Pierre Ganty & Tomás Poch (2014):
Pattern-Based Verification for Multithreaded Programs.
ACM Trans. Program. Lang. Syst. 36(3),
pp. 9:1–9:29,
doi:10.1145/2629644.
Javier Esparza, Stefan Kiefer & Michael Luttenberger (2007):
An Extension of Newton's Method to omega -Continuous Semirings.
In: DLT 2007 4588.
Springer,
pp. 157–168,
doi:10.1007/978-3-540-73208-2_17.
Pierre Ganty, Radu Iosif & Filip Konecný (2013):
Underapproximation of Procedure Summaries for Integer Programs.
In: TACAS 2013 7795.
Springer,
pp. 245–259,
doi:10.1007/978-3-642-36742-7_18.
Seymour Ginsburg & Edwin H. Spanier (1966):
Finite-Turn Pushdown Automata.
SIAM Journal on Control 4(3),
pp. 429–453,
doi:10.1137/0304034.
Jozef Gruska (1971):
A Few Remarks on the Index of Context-Free Grammars and Languages.
Information and Control 19(3),
pp. 216–223,
doi:10.1016/S0019-9958(71)90095-7.
Michael Luttenberger & Maximilian Schlund (2016):
Convergence of Newton's Method over Commutative Semirings.
Inf. Comput. 246,
pp. 43–61,
doi:10.1016/j.ic.2015.11.008.
eptcs@eptcs.org