A Reachability Predicate for Analyzing Low-Level Software

This publication has 20 references indexed in Scilit:

• Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic
  Published by Springer Nature ,2006
• Weakest-precondition of unstructured programs
  Published by Association for Computing Machinery (ACM) ,2005
• Shape Analysis by Predicate Abstraction
  Published by Springer Nature ,2005
• A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs
  Published by Springer Nature ,2005
• The Spec# Programming System: An Overview
  Published by Springer Nature ,2005
• Predicate Abstraction of ANSI-C Programs Using SAT
  Formal Methods in System Design, 2004
• Multi-prover Verification of C Programs
  Published by Springer Nature ,2004
• Automatic predicate abstraction of C programs
  Published by Association for Computing Machinery (ACM) ,2001
• The Classical Decision Problem
  Published by Springer Nature ,1997
• Guarded commands, nondeterminacy and formal derivation of programs
  Communications of the ACM, 1975