Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

On local reasoning in verification


Ihlemann,  Carsten
Automation of Logic, MPI for Informatics, Max Planck Society;


Jacobs,  Swen
Automation of Logic, MPI for Informatics, Max Planck Society;


Sofronie-Stokkermans,  Viorica
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Ihlemann, C., Jacobs, S., & Sofronie-Stokkermans, V. (2008). On local reasoning in verification. In C. R. Ramakrishnan, & J. Rehof (Eds.), Tools and Algorithms for the Construction and Analysis of Systems: 14th International Conference, TACAS 2008 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008 (pp. 265-281). New York: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1C78-1
We present a general framework which allows to identify complex theories important in verification for which efficient reasoning methods exist. The framework we present is based on a general notion of locality. We show that locality considerations allow us to obtain parameterized decidability and complexity results for many (combinations of) theories important in verification in general and in the verification of parametric systems in particular. We give numerous examples; in particular we show that several theories of data structures studied in the verification literature are local extensions of a base theory. The general framework we use allows us to identify situations in which some of the syntactical restrictions imposed in previous papers can be relaxed.