Mlat: A tool for heap analysis based on predicate abstraction by modal logic

Proceedings of the IASTED International Conference on Software Engineering, SE 2008

Volumn , Issue , 2008, Pages 310-317

  Sekizawa, Toshifusa ^a,b   Tanabe, Yoshinori ^a,c   Yuasa, Yoshifumi ^a   Takahashi, Koichi ^a  

^a NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^b OSAKA UNIVERSITY   (Japan)

^c UNIVERSITY OF TOKYO   (Japan)

Author keywords

Heap Analysis; Modal Logic; Predicate Abstraction; Verification

Indexed keywords

EXPRESSIVE POWER; HEAP ANALYSIS; MODAL LOGIC; PREDICATE ABSTRACTION; REACHABILITY; SATISFIABILITY PROBLEMS;

ABSTRACTING; COMPUTABILITY AND DECIDABILITY; SOFTWARE ENGINEERING; SPONTANEOUS EMISSION;

MODAL ANALYSIS;

EID: 62849103387     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. S. Graf and H. Säidi. Construction of abstract state graphs with PVS. In Computer Aided Verification, 9th International Conference, CAV '97, Haifa, Israel, June 22-25, 1997, Proceedings, volume 1254 of LNCS, pages 7283. Springer, 1997.
2. M. Hagiya, K. Takahashi, M. Yamamoto, and T. Sato. Analysis of synchronous and asynchronous cellular automata using abstraction by temporal logic. In Functional and Logic Programming, 7th International Symposium, FLOPS 2004, Nara, Japan, Apri 7-9, 2004, Proceedings, volume 2998 of LNCS, pages 721. Springer, 2004.
3. T. Ball and S. K. Rajamani. The SLAM project: Debugging system software via static analysis. In Conference Record of POPL'02: The 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 13, Portland, Oregon, January 1618, 2002.
4. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Software verification with BLAST. In Model Checking Software, 10th International SPIN Workshop. Portland, OR, USA, May 9-10, 2003, Proceedings, volume 2648 of LNCS, pages 235239. Springer,2003.
5. D. Dams and K. S. Namjoshi. Shape analysis through predicate abstraction and model checking. In Verification, Model Checking, and Abstract Interpretation, 4th International Conference, VMCAI 2003, New York, NY, USA, January 9-11, 2002, Proceedings, volume 2575 of LNCS, pages 310324. Springer, 2003.
6. T. Lev-Ami and S. Sagiv. TVLA: A system for implementing static analyses. In Static Analysis, 7th International Symposium, SAS 2000, Santa Barbara, CA, USA, June 29 - July 1, 2000, Proceedings, volume 1824 of LNCS, pages 280301. Springer, 2000.
7. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS-02), pages 5574, Los Alamitos, July 2225 2002. IEEE Computer Society.
8. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, Cambridge, England, 2001.
9. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Conference Record of POPL'02: The 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 5870, Portland, Oregon, January 1618, 2002.
10. A. Cimatti, E. M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: A new symbolic model verifier. In Computer Aided Verification, 11th International Conference, CAV '99, Trento, Italy, July 6-10, 1999, Proceedings, volume 1633 of LNCS, pages 495499. Springer, 1999.
11. JavaBDD. Java library for manipulating BDDs. http://javabdd.sourceforge. net/.
12. Y. Tanabe, T. Takai, T. Sekizawa, and K. Takahashi. Preconditions of properties described in CTL for statements manipulating pointers. In Supplemental Volume of the 2005 International Conference on DSN, pages 228234, 2005.
13. U. Sattler and M. Y. Vardi. The hybrid μ-calculus. In Automated Reasoning, First International Joint Conference, IJCAR 2001, Siena, Italy, June 18-23, 2001, Proceedings, volume 2083 of LNCS, pages 7691. Springer, 2001.
14. Y. Yuasa, Y. Tanabe, T. Sekizawa, and K. Takahashi. A decision procedure for temporal formulas in automated predicate abstraction. In Japan Society for Software Science and Technology 22nd Annual Conference, 2005. (in Japanese).
15. C. Coquand. The AGDA proof system homepage, 1998. http://www.cs.chalmers. sẽecatarina/agda/.
16. Y. Yuasa, M. Takeyama, T. Sekizawa, Y. Tanabe, and K. Takahashi. Verification of pointer-manipulation program by interactive and automatic theorem proving. In Japan Society for Software Science and Technology 23rd Annual Conference, 2006. (in Japanese).
17. Y. Tanabe, K. Takahashi, M. Yamamoto, A. Tozawa, and M. Hagiya. A decision procedure for the alternation-free two-way modal μe-calculus. In Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2005, Koblenz, Germany, September 14-17, 2005, Proceedings, volume 3702 of LNCS, pages 277291. Springer, 2005.