1. L. de Alfaro & T.A. Henzinger (2005): Interface-based design. In: M. Broy, J. Grünbauer, D. Harel & C.A.R. Hoare: Engineering Theories of Software-intensive Systems, NATO Science Series: Mathematics, Physics, and Chemistry 195. Springer, pp. 83–104.
  2. R. Alur (2007): Marrying words and trees. In: Proc. 26th ACM Symp. on Principles of Database Systems, pp. 233–242, doi:10.1007/978-3-540-74510-5_3.
  3. R. Alur, M. Arenas, P. Barceló, K. Etessami, N. Immerman & L. Libkin (2008): First-Order and Temporal Logics for Nested Words. Logical Methods in Computer Science 4(4).
  4. R. Alur, M. Benedikt, K. Etessami, P. Godefroid, T. W. Reps & M. Yannakakis (2005): Analysis of recursive state machines. ACM Transactions on Programming Languagues and Systems 27(4), pp. 786–818, doi:10.1145/1075382.1075387.
  5. R. Alur, K. Etessami & P. Madhusudan (2004): A temporal logic of nested calls and returns. In: Proc. 10th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 2725. Springer, pp. 67–79.
  6. R. Alur & P. Madhusudan (2009): Adding nesting structure to words. Journal of the ACM 56(3), pp. 1–43, doi:10.1007/11779148_1.
  7. T. Ball, B. Cook, V. Levin & S.K. Rajamani (2004): SLAM and Static Driver Verifier: Technology Transfer of Formal Methods inside Microsoft. In: Integrated Formal Methods, pp. 1–20, doi:10.1007/978-3-540-24756-2_1.
  8. D. Berardi, D. Calvanese, G. De Giacomo, M. Lenzerini & M. Mecella (2003): Automatic Composition of E-services That Export Their Behavior. In: ICSOC, pp. 43–58, doi:10.1007/978-3-540-24593-3_4.
  9. G.J. Holzmann (1997): The Model Checker SPIN. IEEE Transactions on Software Engineering 23(5), pp. 279–295.
  10. O. Kupferman, Y. Lustig, M.Y. Vardi & M. Yannakakis (2011): Temporal Synthesis for Bounded Systems and Environments. In: Proc. 28th Symp. on Theoretical Aspects of Computer Science, pp. 615–626.
  11. O. Kupferman & M.Y. Vardi (2005): Safraless Decision Procedures. In: Proc. 46th IEEE Symp. on Foundations of Computer Science, pp. 531–540, doi:10.1109/SFCS.2005.66.
  12. Y. Lustig & Moshe Y. Vardi (2009): Synthesis from Component Libraries. In: Proc. 12th International Conference on Foundations of Software Science and Computational Structures (FOSSACS), Lecture Notes in Computer Science 5504. Springer, pp. 395 – 409, doi:10.1007/978-3-642-00596-1_28.
  13. N. Piterman & M. Vardi (2001): From Bidirectionality to Alternation. In: 26th Int. Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 2136. Springer, pp. 598–609, doi:10.1016/S0304-3975(02)00410-3.
  14. A. Pnueli & R. Rosner (1989): On the Synthesis of a Reactive Module. In: Proc. 16th ACM Symp. on Principles of Programming Languages, pp. 179–190.
  15. S. Sardiña, F. Patrizi & G. De Giacomo (2007): Automatic Synthesis of a Global Behavior from Multiple Distributed Behaviors. In: AAAI, pp. 1063–1069.
  16. J. Sifakis (2005): A Framework for Component-based Construction Extended Abstract. In: Proc. 3rd Int. Conf. on Software Engineering and Formal Methods. IEEE Computer Society, pp. 293–300, doi:10.1109/SEFM.2005.3.
  17. M.Y. Vardi (1998): Reasoning about the past with two-way automata. In: Proc. 25th Int. Colloq. on Automata, Languages, and Programming, Lecture Notes in Computer Science 1443. Springer, Berlin, pp. 628–641.
  18. M.Y. Vardi & P. Wolper (1994): Reasoning about Infinite Computations. Information and Computation 115(1), pp. 1–37.

Comments and questions to:
For website issues: