Applying Light-Weight Theorem Proving to Debugging and Verifying Pointer Programs
Open Access
- 31 May 2003
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 86 (1) , 105-119
- https://doi.org/10.1016/s1571-0661(04)80656-x
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A rewriting approach to satisfiability proceduresInformation and Computation, 2003
- Using BDDs with Combinations of TheoriesPublished by Springer Nature ,2002
- Extended static checking for JavaPublished by Association for Computing Machinery (ACM) ,2002
- Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logicACM Transactions on Computational Logic, 2001
- Checking Cleanness in Linked ListsPublished by Springer Nature ,2000
- Rewrite-based Equational Theorem Proving with Selection and SimplificationJournal of Logic and Computation, 1994
- Set theory in first-order logic: Clauses for Gödel's axiomsJournal of Automated Reasoning, 1986
- A Switch-Level Model and Simulator for MOS Digital SystemsIEEE Transactions on Computers, 1984
- Assignment Commands with Array ReferencesJournal of the ACM, 1978
- An axiomatic basis for computer programmingCommunications of the ACM, 1969