Rajeev Alur, Marcelo Arenas, Pablo Barceló, Kousha Etessami, Neil Immerman & Leonid Libkin (2008):
First-Order and Temporal Logics for Nested Words.
Logical Methods in Computer Science 4(4),
doi:10.2168/LMCS-4(4:11)2008.
Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps & Mihalis Yannakakis (2005):
Analysis of recursive state machines.
ACM Trans. Program. Lang. Syst. 27(4),
pp. 786–818,
doi:10.1145/1075382.1075387.
Rajeev Alur, Kousha Etessami & P. Madhusudan (2004):
A Temporal Logic of Nested Calls and Returns.
In: Kurt Jensen & Andreas Podelski: TACAS,
Lecture Notes in Computer Science 2988.
Springer,
pp. 467–481,
doi:10.1007/978-3-540-24730-2_35.
Rajeev Alur & Salvatore La Torre (2004):
Deterministic generators and games for Ltl fragments.
ACM Trans. Comput. Log. 5(1),
pp. 1–25,
doi:10.1145/963927.963928.
Rajeev Alur, Salvatore La Torre & P. Madhusudan (2003):
Modular Strategies for Infinite Games on Recursive Graphs.
In: Warren A. Hunt Jr. & Fabio Somenzi: CAV,
Lecture Notes in Computer Science 2725.
Springer,
pp. 67–79,
doi:10.1007/978-3-540-45069-6_6.
Rajeev Alur, Salvatore La Torre & P. Madhusudan (2003):
Playing Games with Boxes and Diamonds.
In: Roberto M. Amadio & Denis Lugiez: CONCUR,
Lecture Notes in Computer Science 2761.
Springer,
pp. 127–141,
doi:10.1007/978-3-540-45187-7_8.
Rajeev Alur, Salvatore La Torre & P. Madhusudan (2006):
Modular strategies for recursive game graphs.
Theor. Comput. Sci. 354(2),
pp. 230–249,
doi:10.1016/j.tcs.2005.11.017.
Rajeev Alur & P. Madhusudan (2009):
Adding nesting structure to words.
J. ACM 56(3),
doi:10.1145/1516512.1516518.
Benjamin Aminof, Fabio Mogavero & Aniello Murano (2014):
Synthesis of hierarchical systems.
Sci. Comput. Program. 83,
pp. 56–79,
doi:10.1016/j.scico.2013.07.001.
Ilaria De Crescenzo & Salvatore La Torre (2013):
Modular Synthesis with Open Components.
In: Parosh Aziz Abdulla & Igor Potapov: RP,
Lecture Notes in Computer Science 8169.
Springer,
pp. 96–108,
doi:10.1007/978-3-642-41036-9_10.
William R. Harris, Somesh Jha & Thomas W. Reps (2012):
Secure Programming via Visibly Pushdown Safety Games.
In: P. Madhusudan & Sanjit A. Seshia: CAV,
Lecture Notes in Computer Science 7358.
Springer,
pp. 581–598,
doi:10.1007/978-3-642-31424-7_41.
Salvatore La Torre & Gennaro Parlato (2007):
On the Complexity of LtlModel-Checking of Recursive State Machines.
In: Lars Arge, Christian Cachin, Tomasz Jurdzinski & Andrzej Tarlecki: ICALP,
Lecture Notes in Computer Science 4596.
Springer,
pp. 937–948,
doi:10.1007/978-3-540-73420-8_80.
Christof Löding, P. Madhusudan & Olivier Serre (2004):
Visibly Pushdown Games.
In: Kamal Lodaya & Meena Mahajan: FSTTCS,
Lecture Notes in Computer Science 3328.
Springer,
pp. 408–420,
doi:10.1007/978-3-540-30538-5_34.
Yoad Lustig & Moshe Y. Vardi (2009):
Synthesis from Component Libraries.
In: Luca de Alfaro: FOSSACS,
Lecture Notes in Computer Science 5504.
Springer,
pp. 395–409,
doi:10.1007/978-3-642-00596-1_28.
Yoad Lustig & Moshe Y. Vardi (2011):
Synthesis from Recursive-Components Libraries.
In: Giovanna D'Agostino & Salvatore La Torre: GandALF,
EPTCS 54,
pp. 1–16,
doi:10.4204/EPTCS.54.1.
David E. Muller & Paul E. Schupp (1995):
Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra.
Theor. Comput. Sci. 141(1&2),
pp. 69–107,
doi:10.1016/0304-3975(94)00214-4.
Amir Pnueli (1977):
The Temporal Logic of Programs.
In: FOCS.
IEEE Computer Society,
pp. 46–57,
doi:10.1109/SFCS.1977.32.
Wolfgang Thomas (2002):
Infinite Games and Verification (Extended Abstract of a Tutorial).
In: Ed Brinksma & Kim Guldstrand Larsen: CAV,
Lecture Notes in Computer Science 2404.
Springer,
pp. 58–64,
doi:10.1007/3-540-45657-0_5.
Igor Walukiewicz (2001):
Pushdown Processes: Games and Model-Checking.
Inf. Comput. 164(2),
pp. 234–263,
doi:10.1006/inco.2000.2894.
eptcs@eptcs.org