Author:
Lev-Ami Tal,Immerman Neil,Reps Thomas,Sagiv Mooly,Srivastava Siddharth,Yorsh Greta
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference33 articles.
1. A. Avron. Transitive closure and the mechanization of mathematics. InThirty Five Years of Automating Mathematics, pages 149-171. Kluwer Academic Publishers, 2003.
2. I. Bogudlov, T. Lev-Ami, T. Reps, and M. Sagiv. Revamping tvla: Making parametric shape analysis competitive. InCAV, 2007.
3. J. Bingham and Z. Rakamaric. A logic and decision procedure for predicate abstraction of heap-manipulating programs. InVMCAI, pages 207-221, 2006.
4. M. Benedikt, T. Reps, and M. Sagiv. A decidable logic for describing linked data structures. InEuropean Symp. On Programming, pages 2-19, March 1999.
5. Patrick Cousot and Radhia Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. InPOPL '77: Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pages 238-252. ACM Press, 1977.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Predictable Verification using Intrinsic Definitions;Proceedings of the ACM on Programming Languages;2024-06-20
2. Verify heaps via unified model checking;Theoretical Computer Science;2020-06
3. Modular verification of heap reachability properties in separation logic;Proceedings of the ACM on Programming Languages;2019-10-10
4. Foundations for natural proofs and quantifier instantiation;Proceedings of the ACM on Programming Languages;2018-01
5. Dynamic complexity;ACM SIGLOG News;2016-05-31