Back to the future
- 7 January 2008
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '08
- Vol. 43 (1), 171-182
- https://doi.org/10.1145/1328438.1328461
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data StructuresPublished by Springer Science and Business Media LLC ,2007
- Efficient E-Matching for SMT SolversLecture Notes in Computer Science, 2007
- Decision Procedures for Set-Valued FieldsElectronic Notes in Theoretical Computer Science, 2005
- Simplify: a theorem prover for program checkingJournal of the ACM, 2005
- Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data StructuresLecture Notes in Computer Science, 2005
- Data Structure Specifications via Local Equality AxiomsLecture Notes in Computer Science, 2005
- Shape Analysis by Predicate AbstractionLecture Notes in Computer Science, 2005
- The Spec# Programming System: An OverviewLecture Notes in Computer Science, 2005
- A Decidable Fragment of Separation LogicLecture Notes in Computer Science, 2004
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979