2006 · 15 citations · 3 references
ComputingComputer ScienceComputer SystemsAlgorithmsFormal MethodsSafety EngineeringConcurrent System VerificationDeductive VerificationDynamic Data StructuresLinked ListsModel CheckingSymbolic ExecutionPointer SafetyReachabilityReachability AnalysisSafety PropertiesSymbolic Model CheckingSymbolic Pointer Analysis
We aim at checking safety properties on systems manipulating dynamic linked lists. First we prove that every pointer system is bisimilar to an effectively constructible counter system. We then deduce a two-step analysis procedure. We first build an over-approximation of the reachability set of the pointer system. If this overapproximation is too coarse to conclude, we then extract from it a bisimilar counter system which is analyzed via efficient symbolic techniques developed for general counter systems.
3
The pointer assertion logic engine
Anders Møller, Michael I. Schwartzbach · 2001 · 264 citations
Putting static analysis to work for verification
Tal Lev-Ami, Thomas Reps, Mooly Sagiv et al. · 2000 · 119 citations · Full text