b'@inproceedings{ihlemann-jacobs-sofronie-tacas2008,'b'\nTITLE = {On local reasoning in verification},\nAUTHOR = {Ihlemann, Carsten and Jacobs, Swen and Sofronie-Stokkermans, Viorica},\nLANGUAGE = {eng},\nISBN = {978-3-540-78799-0},\nURL = {http://dx.doi.org/10.1007/978-3-540-78800-3_19},\nDOI = {10.1007/978-3-540-78800-3_19},\nLOCALID = {Local-ID: C125756E0038A185-0445FFD4A7C94F83C12573AD0044C8AE-ihlemann-jacobs-sofronie-tacas2008},\nPUBLISHER = {Springer},\nYEAR = {2008},\nDATE = {2008},\nABSTRACT = {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.},\nBOOKTITLE = {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},\nEDITOR = {Ramakrishnan, C. R. and Rehof, Jakob},\nPAGES = {265--281},\nSERIES = {Lecture Notes in Computer Science},\n}\n'