Skip to main content
SpringerLink
Log in
Book cover

International Conference on Verification, Model Checking, and Abstract Interpretation

VMCAI 2016: Verification, Model Checking, and Abstract Interpretation pp 495–513Cite as

A General Modular Synthesis Problem for Pushdown Systems

  • Conference paper
  • First Online:

  • 1035 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9583))

Abstract

The modular synthesis from a library of components (Lms) asks to compose a recursive state machine satisfying a given specification, by modularly controlling a finite set of component instances taken from the library. It combines and subsumes two synthesis problems studied in the literature: the synthesis from libraries of recursive components and the modular strategy synthesis. We consider standard specifications as reachability and safety (expressed by finite automata), and visibly pushdown automata specifications, and show that for all these classes of specifications the Lms problem is EXPTIME-complete.

This work was partially funded by the MIUR grants FARB 2013-15, Università di Salerno.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T.W., Yannakakis, M.: Analysis of recursive state machines. ACM Trans. Program. Lang. Syst. 27(4), 786–818 (2005)

    Article  Google Scholar 

  2. Alur, R., Etessami, K., Madhusudan, P.: A temporal logic of nested calls and returns. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 467–481. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Alur, R., La Torre, S., Madhusudan, P.: Modular strategies for infinite games on recursive graphs. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 67–79. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Alur, R., La Torre, S., Madhusudan, P.: Modular strategies for recursive game graphs. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 363–378. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Alur, R., La Torre, S., Madhusudan, P.: Modular strategies for recursive game graphs. Theor. Comput. Sci. 354(2), 230–249 (2006)

    Article  MATH  Google Scholar 

  6. Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3), 1–43 (2009)

    Article  MathSciNet  Google Scholar 

  7. Aminof, B., Mogavero, F., Murano, A.: Synthesis of hierarchical systems. Sci. Comput. Program. 83, 56–79 (2014)

    Article  Google Scholar 

  8. De Crescenzo, I., La Torre, S.: Winning CaRet games with modular strategies. In: CILC. CEUR Workshop Proceedings, vol. 810, pp. 327–331. CEUR-WS.org (2011)

    Google Scholar 

  9. De Crescenzo, I., La Torre, S.: Modular synthesis with open components. In: Abdulla, P.A., Potapov, I. (eds.) RP 2013. LNCS, vol. 8169, pp. 96–108. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  10. De Crescenzo, I., La Torre, S., Velner, Y.: Visibly pushdown modular games. GandALF. EPTCS, vol. 161, pp. 260–274 (2014)

    Google Scholar 

  11. Harris, W.R., Jha, S., Reps, T.: Secure programming via visibly pushdown safety games. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 581–598. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  12. Jha, S., Gulwani, S., Seshia, S.A., Tiwari, A.: Oracle-guided component-based program synthesis. In: ICSE, pp. 215–224. ACM (2010)

    Google Scholar 

  13. Jobstmann, B., Griesmayer, A., Bloem, R.: Program repair as a game. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 226–238. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Jobstmann, B., Staber, S., Griesmayer, A., Bloem, R.: Finding and fixing faults. J. Comput. Syst. Sci. 78(2), 441–460 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  15. La Torre, S., Napoli, M., Parente, M., Parlato, G.: Verification of scope-dependent hierarchical state machines. Inf. Comput. 206(9–10), 1161–1177 (2008)

    Article  MATH  Google Scholar 

  16. La Torre, S., Parlato, G.: On the complexity of Ltl model-checking of recursive state machines. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 937–948. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Löding, C., Madhusudan, P., Serre, O.: Visibly pushdown games. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 408–420. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Lustig, Y., Vardi, M.Y.: Synthesis from component libraries. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 395–409. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  19. Lustig, Y., Vardi, M.Y.: Synthesis from recursive-components libraries. In: GandALF. EPTCS vol. 54, pp. 1–16 (2011)

    Google Scholar 

  20. Madhusudan, P.: Synthesizing reactive programs. In: CSL. LIPIcs, vol. 12, pp. 428–442 (2011)

    Google Scholar 

  21. Salvati, S., Walukiewicz, I.: Evaluation is MSOL-compatible. In: FSTTCS. LIPIcs, vol. 24, pp. 103–114 (2013)

    Google Scholar 

  22. Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 133–192 (1990)

    Google Scholar 

  23. Thomas, W.: Infinite games and verification (Extended abstract of a tutorial). In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 58–64. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  24. Thomas, W.: Facets of synthesis: revisiting church’s problem. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 1–14. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  25. Walukiewicz, I.: Pushdown processes: Games and model-checking. Inf. Comput. 164(2), 234–263 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università degli Studi di Salerno, Via Giovanni Paolo II, 132, 84084, Fisciano, Salerno, Italy

    Ilaria De Crescenzo & Salvatore La Torre

Authors
  1. Ilaria De Crescenzo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Salvatore La Torre
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ilaria De Crescenzo .

Editor information

Editors and Affiliations

  1. EPFL IC-DO, Lausanne, Switzerland

    Barbara Jobstmann

  2. Microsoft Research, Redmond, Washington, USA

    K. Rustan M. Leino

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Crescenzo, I., La Torre, S. (2016). A General Modular Synthesis Problem for Pushdown Systems. In: Jobstmann, B., Leino, K. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2016. Lecture Notes in Computer Science(), vol 9583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49122-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49122-5_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49121-8

  • Online ISBN: 978-3-662-49122-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation