Automatic verification of pointer programs using monadic second-order logic
- 1 May 1997
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 32 (5) , 226-234
- https://doi.org/10.1145/258916.258936
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Alias analysis of pointers in Pascal and Fortran 90: dependence analysis between pointer referencesActa Informatica, 1996
- Solving shape-analysis problems in languages with destructive updatingPublished by Association for Computing Machinery (ACM) ,1996
- Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in CPublished by Association for Computing Machinery (ACM) ,1996
- Semantic models and abstract interpretation techniques for inductive data structures and pointersPublished by Association for Computing Machinery (ACM) ,1995
- LCLintPublished by Association for Computing Machinery (ACM) ,1994
- Interprocedural may-alias analysis for pointersPublished by Association for Computing Machinery (ACM) ,1994
- Graph typesPublished by Association for Computing Machinery (ACM) ,1993
- Inferring the equivalence of functional programs that mutate dataTheoretical Computer Science, 1992
- A safe approximate algorithm for interprocedural aliasingPublished by Association for Computing Machinery (ACM) ,1992
- Parallelizing programs with recursive data structuresIEEE Transactions on Parallel and Distributed Systems, 1990