ANDREW VAN OVERLOOP MISSOURI VERIFICATION
ANDREW VAN OVERLOOP MISSOURI SOFTWARE
ANDREW VAN OVERLOOP MISSOURI SERIES

20 Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm.

In of the 6th International on Languages and Compilers for Parallel Computing, number 768 in Lecture Notes in Computer Science, August 1993. Analysis of dynamic structures for efficient parariel execution. Alias analysis of pointers in Pascal and Fortran 90: dependence analysis between pointer references. Inferring the equivalence of functional programs that mutate data. In of the A CM SiGPLAN '9~ on Programming Language Design and Implementation, June 1992. A safe approximate algorithm for interprocedural pointer aliasing. BRICS, University of Aarhus, October 1996. Regularity = Logic + Recursive Data Types. Graphs and decidable transductions based on edge constraints.

14 Nils Klarlund and Michael I, Schwartzbach.

br ics, dk/~klarlund/MonaFido/papers, Google Scholar Digital Library SIGA CT on Principles of Programming Languages, January 1993.

ANDREW VAN OVERLOOP MISSOURI SERIES

Technical report, BRICS Report Series RS- 96-5, Department of Computer Science, University of Aarhus, 1996.

11 Jakob Jensen and Michael Jzrgensen.

In Proceedings TACAS'95, LNCS 1019, May 1995. Mona: Monadic second-order logic in practice.

10 Jesper Gulmann Henriksen, Michael Jzrgensen, Jakob Jensen, Nils Klarlund, Bob Paige, Theis Rauhe, and Anders Sandholm.

Parallelizing programs with recursive data structures.

In the ~3rd ACM SIGPLAN- SIGACT on Principles of Programming Languages, January 1996. Is it a Tree, a DAG, or a Cyclic Graph? A shape analysis for heapdirected pointers in C.

7 Pascal Fradet and Daniel Le Metayer.

ANDREW VAN OVERLOOP MISSOURI SOFTWARE

In Proceedings of Symposium on the Foundations of Software Engineering. LCLint- A tool for using specificstions to check code. 6 David Evans, John Guttag, Jim Homing, and Yang Meng Tan.In of the A CM SIGPLAN on Partial Evaluation and Semantics-Based Program Manipulation (PEPM), June 1995. Semantic models and abstract interpretation techniques for inductive data structures and pointers. In ol the A CM SIGPLAN '94 on Programming Language Design and Implementation, June 1994. Interprocedural may-alias analysis for pointers' Beyond k-limiting. In Proceedings of The First Workshop on Formal Methods in Software Practice. An overview of the Extended Static Checking system. In of the 7th International on Languages and Compilers for Parallel Computing, number 892 in Lecture Notes in Computer Science, August 1994. Flow-insensitive interprocedural alias analysis in the presence of pointers. 2 Michael Burke, Paul Carini, Jong-Deok Choi, and Michael Hind.

IEEE Transactions on Computers, August 1986. Graph-based algorithms for Boolean function manipulation. The resulting system can be used to verify extensive properties of smaller pointer programs and could be particularly useful in a teaching environment. If a program fails to satisfy a certain property, then we can automatically supply an initial store that provides a counterexample.Our technique had been fully and efficiently implemented for linear linked lists, and it extends in principle to tree structures. Combined with explicit loop invariants, the decision procedure allows us to answer surprisingly detailed questions about small but non-trivial programs.

ANDREW VAN OVERLOOP MISSOURI VERIFICATION

We present a technique for automatic verification of pointer programs based on a decision procedure for the monadic second-order logic on finite strings.We are concerned with a while-fragment of Pascal, which includes recursively-defined pointer structures but excludes pointer arithmetic.We define a logic of stores with interesting basic predicates such as pointer equality, tests for nil pointers, and garbage cells, as well as reachability along pointers.We present a complete decision procedure for Hoare triples based on this logic over loop-free code.

Andrew van overloop missouri