{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T06:40:15Z","timestamp":1738910415959,"version":"3.37.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,1,27]],"date-time":"2009-01-27T00:00:00Z","timestamp":1233014400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Softw Tools Technol Transfer"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s10009-009-0098-1","type":"journal-article","created":{"date-parts":[[2009,1,26]],"date-time":"2009-01-26T06:04:26Z","timestamp":1232949866000},"page":"105-116","source":"Crossref","is-referenced-by-count":6,"title":["A low-level memory model and an accompanying reachability predicate"],"prefix":"10.1007","volume":"11","author":[{"given":"Shaunak","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuvendu K.","family":"Lahiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaz","family":"Qadeer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zvonimir","family":"Rakamari\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,1,27]]},"reference":[{"key":"98_CR1","doi-asserted-by":"crossref","unstructured":"Babi\u0107, D., Hu, A.J.: Calysto: scalable and precise extended static checking. In: International Conference on Software Engineering (ICSE\u201908), pp. 211\u2013220 (2008)","DOI":"10.1145\/1368088.1368118"},{"key":"98_CR2","doi-asserted-by":"crossref","unstructured":"Balaban, I., Pnueli, A., Zuck, L.D.: Shape analysis by predicate abstraction. In: International Conference on Verification, Model checking, and Abstract Interpretation (VMCAI\u201905), pp. 164\u2013180 (2005)","DOI":"10.1007\/978-3-540-30579-8_12"},{"key":"98_CR3","doi-asserted-by":"crossref","unstructured":"Ball, T., Majumdar, R., Millstein, T., Rajamani, S.K.: Automatic predicate abstraction of C programs. In: ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201901), pp. 203\u2013213 (2001)","DOI":"10.1145\/378795.378846"},{"key":"98_CR4","doi-asserted-by":"crossref","unstructured":"Barnett, M., Chang, B.-Y.E., DeLine, R., Jacobs, B., Leino, K.R.M.: Boogie: a modular reusable verifier for object-oriented programs. In: International Symposium on Formal Methods for Objects and Components (FMCO\u201905), pp. 364\u2013387 (2005)","DOI":"10.1007\/11804192_17"},{"key":"98_CR5","doi-asserted-by":"crossref","unstructured":"Barnett, M., Leino, K.R.M.: Weakest-precondition of unstructured programs. In: ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering (PASTE\u201905), pp. 82\u201387 (2005)","DOI":"10.1145\/1108792.1108813"},{"key":"98_CR6","doi-asserted-by":"crossref","unstructured":"Barnett, M., Leino, K.R.M., Schulte, W.: The Spec# programming system: An overview. In: Construction and Analysis of Safe, Secure and Interoperable Smart Devices (CASSIS\u201905), pp. 49\u201369 (2005)","DOI":"10.1007\/978-3-540-30569-9_3"},{"key":"98_CR7","doi-asserted-by":"crossref","unstructured":"Berdine, J., Calcagno, C., Cook, B., Distefano, D., O\u2019Hearn, P.W., Wies, T., Yang, H.: Shape analysis for composite data structures. In: International Conference on Computer Aided Verification (CAV\u201907), pp. 178\u2013192 (2007)","DOI":"10.1007\/978-3-540-73368-3_22"},{"key":"98_CR8","doi-asserted-by":"crossref","unstructured":"Bingham, J., Rakamari\u0107, Z.: A logic and decision procedure for predicate abstraction of heap-manipulating programs. In: International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI\u201906), pp. 207\u2013221 (2006)","DOI":"10.1007\/11609773_14"},{"key":"98_CR9","doi-asserted-by":"crossref","unstructured":"Calcagno, C., Distefano, D., O\u2019Hearn, P.W., Yang, H.: Beyond reachability: Shape abstraction in the presence of pointer arithmetic. In: Static Analysis Symposium (SAS\u201906), pp. 182\u2013203 (2006)","DOI":"10.1007\/11823230_13"},{"key":"98_CR10","doi-asserted-by":"crossref","unstructured":"Chatterjee, S., Lahiri, S.K., Qadeer, S., Rakamari\u0107, Z.: A reachability predicate for analyzing low-level software. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201907), pp. 19\u201333 (2007)","DOI":"10.1007\/978-3-540-71209-1_4"},{"key":"98_CR11","doi-asserted-by":"crossref","unstructured":"Chou, A., Yang, J., Chelf, B., Hallem, S., Engler, D.R.: An empirical study of operating system errors. In: ACM Symposium on Operating Systems Principles (SOSP\u201901), pp. 73\u201388 (2001)","DOI":"10.1145\/502034.502042"},{"key":"98_CR12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/B:FORM.0000040025.89719.f3","volume":"25","author":"E. Clarke","year":"2004","unstructured":"Clarke E., Kroening D., Sharygina N., Yorav K.: Predicate abstraction of ANSI\u2013C programs using SAT. Formal Methods Syst. Des. (FMSD) 25, 105\u2013127 (2004)","journal-title":"Formal Methods Syst. Des. (FMSD)"},{"key":"98_CR13","doi-asserted-by":"crossref","unstructured":"Das, M., Lerner, S., Seigle, M.: ESP: Path-sensitive program verification in polynomial time. In: ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201902), pp. 57\u201368 (2002)","DOI":"10.1145\/512529.512538"},{"key":"98_CR14","doi-asserted-by":"crossref","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201908), pp. 337\u2013340 (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"98_CR15","unstructured":"DeLine, R., Leino, K.R.M.: BoogiePL: a typed procedural language for checking object-oriented programs. Technical Report MSR-TR-2005-70, Microsoft Research (2005)"},{"issue":"3","key":"98_CR16","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/1066100.1066102","volume":"52","author":"D. Detlefs","year":"2005","unstructured":"Detlefs D., Nelson G., Saxe J.B.: Simplify: a theorem prover for program checking. J. ACM 52(3), 365\u2013473 (2005)","journal-title":"J. ACM"},{"key":"98_CR17","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","volume":"18","author":"E.W. Dijkstra","year":"1975","unstructured":"Dijkstra E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM 18, 453\u2013457 (1975)","journal-title":"Commun. ACM"},{"key":"98_CR18","doi-asserted-by":"crossref","unstructured":"Distefano, D., O\u2019Hearn, P., Yang, H.: A local shape analysis based on separation logic. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS\u201906), pp. 287\u2013302 (2006)","DOI":"10.1007\/11691372_19"},{"key":"98_CR19","doi-asserted-by":"crossref","unstructured":"Filli\u00e2tre, J., March\u00e9, C.: Multi-prover verification of C programs. In: International Conference on Formal Engineering Methods (ICFEM\u201904), pp. 15\u201329 (2004)","DOI":"10.1007\/978-3-540-30482-1_10"},{"key":"98_CR20","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Leino, K.R.M., Lillibridge, M., Nelson, G., Saxe, J.B., Stata, R.: Extended static checking for Java. In: ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201902), pp. 234\u2013245 (2002)","DOI":"10.1145\/512557.512558"},{"key":"98_CR21","doi-asserted-by":"crossref","unstructured":"Gotsman, A., Berdine, J., Cook, B.: Interprocedural shape analysis with separated heap abstractions. In: Static Analysis Symposium (SAS), pp. 240\u2013260 (2006)","DOI":"10.1007\/11823230_16"},{"key":"98_CR22","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201902), pp. 58\u201370 (2002)","DOI":"10.1145\/503272.503279"},{"key":"98_CR23","doi-asserted-by":"crossref","unstructured":"Lahiri, S.K., Qadeer, S.: Verifying properties of well-founded linked lists. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201906), pp. 115\u2013126 (2006)","DOI":"10.1145\/1111037.1111048"},{"key":"98_CR24","unstructured":"Lahiri, S.K., Qadeer, S.: A decision procedure for well-founded reachability. Technical Report MSR-TR-2007-43, Microsoft Research, (2007)"},{"key":"98_CR25","doi-asserted-by":"crossref","unstructured":"Lahiri, S.K., Qadeer, S.: Back to the future: Revisiting precise program verification using SMT solvers. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201908), pp. 171\u2013182 (2008)","DOI":"10.1145\/1328438.1328461"},{"key":"98_CR26","doi-asserted-by":"crossref","unstructured":"Lev-Ami, T., Immerman, N., Reps, T.W., Sagiv, S., Srivastava, S., Yorsh, G.: Simulating reachability using first-order logic with applications to verification of linked data structures. In: International Conference on Automated Deduction (CADE\u201905), pp. 99\u2013115 (2005)","DOI":"10.1007\/11532231_8"},{"key":"98_CR27","doi-asserted-by":"crossref","unstructured":"Lev-Ami, T., Sagiv, S.: TVLA: A system for implementing static analyses. In: Static Analysis Symposium (SAS\u201900), pp. 280\u2013301 (2000)","DOI":"10.1007\/978-3-540-45099-3_15"},{"key":"98_CR28","doi-asserted-by":"crossref","unstructured":"Li, Z., Tan, L., Wang, X., Lu, S., Zhou, Y., Zhai, C.: Have things changed now? An empirical study of bug characteristics in modern open source software. In: 1st Workshop on Architectural and System Support for Improving Software Dependability (ASID\u201906), pp. 25\u201333 (2006)","DOI":"10.1145\/1181309.1181314"},{"key":"98_CR29","doi-asserted-by":"crossref","unstructured":"McPeak, S., Necula, G.C.: Data structure specifications via local equality axioms. In: International Conference on Computer Aided Verification (CAV\u201905), pp. 476\u2013490 (2005)","DOI":"10.1007\/11513988_47"},{"key":"98_CR30","doi-asserted-by":"crossref","unstructured":"Nelson, G.: Verifying reachability invariants of linked structures. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201983), pp. 38\u201347 (1983)","DOI":"10.1145\/567067.567073"},{"issue":"1","key":"98_CR31","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/357073.357079","volume":"2","author":"G. Nelson","year":"1979","unstructured":"Nelson G., Oppen D.C.: Simplification by cooperating decision procedures. ACM Trans. Program. Lang. Syst. (TOPLAS) 2(1), 245\u2013257 (1979)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"98_CR32","doi-asserted-by":"crossref","unstructured":"O\u2019Hearn, P.W., Reynolds, J.C., Yang, H.: Local reasoning about programs that alter data structures. In: International Workshop on Computer Science Logic (CSL\u201901), pp. 1\u201319 (2001)","DOI":"10.1007\/3-540-44802-0_1"},{"key":"98_CR33","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: Annual IEEE Symposium on Logic in Computer Science (LICS\u201902), pp. 55\u201374 (2002)","DOI":"10.1109\/LICS.2002.1029817"},{"issue":"1","key":"98_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/271510.271517","volume":"20","author":"S. Sagiv","year":"1998","unstructured":"Sagiv S., Reps T.W., Wilhelm R.: Solving shape-analysis problems in languages with destructive updating. ACM Trans. Program. Lang. Syst. (TOPLAS) 20(1), 1\u201350 (1998)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"98_CR35","unstructured":"Schulte, W., Xia, S., Smans, J., Piessens, F.: A glimpse of a verifying C compiler (extended abstract). In: C\/C++ Verification Workshop (2007)"},{"key":"98_CR36","doi-asserted-by":"crossref","unstructured":"Sullivan, M., Chillarege, R.: Software defects and their impact on system availability\u2014a study of field failures in operating systems. In: International Symposium on Fault-Tolerant Computing (FTCS\u201991), pp. 2\u20139 (1991)","DOI":"10.1109\/FTCS.1991.146625"},{"key":"98_CR37","doi-asserted-by":"crossref","unstructured":"Xie, Y., Aiken, A.: Scalable error detection using boolean satisfiability. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL\u201905), pp. 351\u2013363 (2005)","DOI":"10.1145\/1040305.1040334"},{"key":"98_CR38","doi-asserted-by":"crossref","unstructured":"Yang, H., Lee, O., Berdine, J., Calcagno, C., Cook, B., Distefano, D., O\u2019Hearn, P.W.: Scalable shape analysis for systems code. In: International Conference on Computer Aided Verification (CAV\u201908), pp. 385\u2013398 (2008)","DOI":"10.1007\/978-3-540-70545-1_36"}],"container-title":["International Journal on Software Tools for Technology Transfer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-009-0098-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10009-009-0098-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-009-0098-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T06:20:24Z","timestamp":1738909224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10009-009-0098-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,27]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["98"],"URL":"https:\/\/doi.org\/10.1007\/s10009-009-0098-1","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"type":"print","value":"1433-2779"},{"type":"electronic","value":"1433-2787"}],"subject":[],"published":{"date-parts":[[2009,1,27]]}}}