Interprocedural Shape Analysis with Separated Heap Abstractions
暂无分享,去创建一个
[1] Peter W. O'Hearn,et al. Automatic Termination Proofs for Programs with Shape-Shifting Heaps , 2006, CAV.
[2] Peter W. O'Hearn,et al. A Local Shape Analysis Based on Separation Logic , 2006, TACAS.
[3] Peter W. O'Hearn,et al. Symbolic Execution with Separation Logic , 2005, APLAS.
[4] Eran Yahav,et al. Interprocedural Shape Analysis for Cutpoint-Free Programs , 2005, SAS.
[5] Hongseok Yang,et al. Automatic Verification of Pointer Programs Using Grammar-Based Shape Analysis , 2005, ESOP.
[6] Reinhard Wilhelm,et al. A semantics for procedure local heaps and its abstractions , 2005, POPL '05.
[7] Radu Rugina,et al. Region-based shape analysis with tracked locations , 2005, POPL '05.
[8] Peter W. O'Hearn,et al. A Decidable Fragment of Separation Logic , 2004, FSTTCS.
[9] Kousha Etessami,et al. Verifying Probabilistic Procedural Programs , 2004, FSTTCS.
[10] Rajeev Alur,et al. A Temporal Logic of Nested Calls and Returns , 2004, TACAS.
[11] John C. Reynolds,et al. Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.
[12] Peter W. O'Hearn,et al. Local Reasoning about Programs that Alter Data Structures , 2001, CSL.
[13] Alex K. Simpson,et al. Computational Adequacy in an Elementary Topos , 1998, CSL.
[14] Thomas W. Reps,et al. Precise interprocedural dataflow analysis via graph reachability , 1995, POPL '95.
[15] Stephen A. Cook,et al. Soundness and Completeness of an Axiom System for Program Verification , 1978, SIAM J. Comput..
[16] Eran Yahav,et al. Interprocedural Functional Shape Analysis using Local Heaps , 2004 .
[17] Reinhard Wilhelm,et al. Parametric shape analysis via 3-valued logic , 1999, POPL '99.
[18] C. A. R. Hoare,et al. Procedures and parameters: An axiomatic approach , 1971, Symposium on Semantics of Algorithmic Languages.
[19] A. Banerjee,et al. Information Flow Analysis in Logical Form ? ( May 27 , 2004 ) , 2022 .