Skip to main content
SpringerLink
Log in

Verifying Programs by Bounded Tree-Width Behavior Graphs

  • Conference paper
  • First Online:
Multi-Agent Systems (EUMAS 2023)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 14282))

Included in the following conference series:

  • 375 Accesses

Abstract

We present a novel framework to reason about programs based on encodings of computations as graphs. The main insight here is to rearrange the programs such that given a bound k, each computation can be explored according to any tree decomposition of width k of the corresponding behaviour graph. This produces under-approximations parameterized on k, which result in a complete method when we restrict to classes of behaviour graphs of bounded tree-width. As an additional feature, the transformation of the input program can be targeted to existing tools for the analysis. Thus, off-the-shelf tools based on fixed-point, or capable of analyzing sequential programs with scalar variables and nondeterminism, can be used. To illustrate our approach, we develop this framework for sequential programs and discuss how to extend it to handle concurrency. For the case of sequential programs, we develop a compositional approach to generate on-the-fly tree decompositions of nested words, which is based on graph-summaries.

This work was partially supported by INDAM-GNCS 2022 and 2023, AWS 2021 Amazon Research Awards, the MUR project ‘Innovation, digitalisation and sustainability for the diffused economy in Central Italy’, Spoke 1 MEGHALITIC, VITALITY Ecosystem, and FARB 2021–2023 grants Università degli Studi di Salerno.

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

Access this chapter

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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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

Institutional subscriptions

Notes

  1. 1.

    We assume that there are no unmatched calls and returns, differently from [1].

References

  1. Alur, R., Madhusudan, P.: Adding nesting structure to words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 1–13. Springer, Heidelberg (2006). https://doi.org/10.1007/11779148_1

    Chapter  Google Scholar 

  2. Bouajjani, A., Emmi, M., Parlato, G.: On sequentializing concurrent programs. In: Yahav, E. (ed.) SAS 2011. LNCS, vol. 6887, pp. 129–145. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-23702-7_13

    Chapter  Google Scholar 

  3. Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990). https://doi.org/10.1016/0890-5401(90)90043-H

    Article  MathSciNet  MATH  Google Scholar 

  4. Emmi, M., Qadeer, S., Rakamaric, Z.: Delay-bounded scheduling. In: Ball, T., Sagiv, M. (eds.) Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, 26–28 January 2011, pp. 411–422. ACM (2011). https://doi.org/10.1145/1926385.1926432

  5. Enea, C., Habermehl, P., Inverso, O., Parlato, G.: On the path-width of integer linear programming. In: Peron, A., Piazza, C. (eds.) Proceedings Fifth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2014. EPTCS, Verona, Italy, 10–12 September 2014, vol. 161, pp. 74–87 (2014). https://doi.org/10.4204/EPTCS.161.9

  6. Enea, C., Habermehl, P., Inverso, O., Parlato, G.: On the path-width of integer linear programming. Inf. Comput. 253, 257–271 (2017). https://doi.org/10.1016/j.ic.2016.07.010

    Article  MathSciNet  MATH  Google Scholar 

  7. Grebenshchikov, S., Lopes, N.P., Popeea, C., Rybalchenko, A.: Synthesizing software verifiers from proof rules. In: Vitek, J., Lin, H., Tip, F. (eds.) ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2012, Beijing, China, 11–16 June 2012, pp. 405–416. ACM (2012). https://doi.org/10.1145/2254064.2254112

  8. Hoder, K., Bjørner, N., de Moura, L.: \({{\mu }Z}\) – an efficient engine for fixed points with constraints. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 457–462. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22110-1_36

    Chapter  Google Scholar 

  9. La Torre, S., Madhusudan, P., Parlato, G.: Reducing context-bounded concurrent reachability to sequential reachability. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 477–492. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02658-4_36

    Chapter  Google Scholar 

  10. La Torre, S., Madhusudan, P., Parlato, G.: Sequentializing parameterized programs. In: Bauer, S.S., Raclet, J. (eds.) Proceedings Fourth Workshop on Foundations of Interface Technologies, FIT 2012. EPTCS, Tallinn, Estonia, 25th March 2012, vol. 87, pp. 34–47 (2012). https://doi.org/10.4204/EPTCS.87.4

  11. La Torre, S., Madhusudan, P., Parlato, G.: Analyzing recursive programs using a fixed-point calculus. In: Hind, M., Diwan, A. (eds.) Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2009, Dublin, Ireland, 15–21 June 2009, pp. 211–222. ACM (2009). https://doi.org/10.1145/1542476.1542500

  12. La Torre, S., Napoli, M.: Reachability of multistack pushdown systems with scope-bounded matching relations. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 203–218. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-23217-6_14

    Chapter  Google Scholar 

  13. La Torre, S., Napoli, M., Parlato, G.: A unifying approach for multistack pushdown automata. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds.) MFCS 2014. LNCS, vol. 8634, pp. 377–389. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44522-8_32

    Chapter  Google Scholar 

  14. La Torre, S., Napoli, M., Parlato, G.: Reachability of scope-bounded multistack pushdown systems. Inf. Comput. 275, 104588 (2020). https://doi.org/10.1016/j.ic.2020.104588

    Article  MathSciNet  MATH  Google Scholar 

  15. La Torre, S., Parlato, G.: Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width. In: D’Souza, D., Kavitha, T., Radhakrishnan, J. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012. LIPIcs, Hyderabad, India, 15–17 December 2012, vol. 18, pp. 173–184. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012). https://doi.org/10.4230/LIPIcs.FSTTCS.2012.173

  16. Lal, A., Reps, T.W.: Reducing concurrent analysis under a context bound to sequential analysis. Formal Methods Syst. Des. 35(1), 73–97 (2009). https://doi.org/10.1007/s10703-009-0078-9

    Article  MATH  Google Scholar 

  17. Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: Ball, T., Sagiv, M. (eds.) Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, 26–28 January 2011, pp. 283–294. ACM (2011). https://doi.org/10.1145/1926385.1926419

  18. Qadeer, S., Wu, D.: KISS: keep it simple and sequential. In: Pugh, W.W., Chambers, C. (eds.) Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation 2004, Washington, DC, USA, 9–11 June 2004, pp. 14–24. ACM (2004). https://doi.org/10.1145/996841.996845

  19. Seese, D.: The structure of models of decidable monadic theories of graphs. Ann. Pure Appl. Log. 53(2), 169–195 (1991). https://doi.org/10.1016/0168-0072(91)90054-P

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Gran Sasso Science Institute, L’Aquila, Italy

    Omar Inverso & Ermenegildo Tomasco

  2. Università degli Studi di Salerno, Fisciano, Italy

    Salvatore La Torre & Ermenegildo Tomasco

  3. Università degli Studi del Molise, Pesche, Italy

    Gennaro Parlato & Ermenegildo Tomasco

Authors
  1. Omar Inverso
    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

  3. Gennaro Parlato
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ermenegildo Tomasco
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gennaro Parlato .

Editor information

Editors and Affiliations

  1. Télécom Paris, Paris, France

    Vadim Malvone

  2. Universitá degli Studi di Napoli Federico II, Naples, Italy

    Aniello Murano

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Inverso, O., La Torre, S., Parlato, G., Tomasco, E. (2023). Verifying Programs by Bounded Tree-Width Behavior Graphs. In: Malvone, V., Murano, A. (eds) Multi-Agent Systems. EUMAS 2023. Lecture Notes in Computer Science(), vol 14282. Springer, Cham. https://doi.org/10.1007/978-3-031-43264-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-43264-4_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-43263-7

  • Online ISBN: 978-3-031-43264-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation