An overview of the saturn project
Authors:
Open Access
- 13 June 2007
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 43-48
Abstract
We present an overview of the Saturn program analysis system, including a rationale for three major design decisions: the use of function-at-a-time, or summary-based, analysis, the use of con- straints, and the use of a logic programming language to express program analysis algorithms. We argue that the combination of summaries and constraints allows Saturn to achieve both great scal- ability and great precision, while the use of a logic programming language with constraints allows for succinct, high-level expression of program analyses.Keywords
This publication has 14 references indexed in Scilit:
- Static error detection using semantic inconsistency inference2007
- How is aliasing used in systems software?2006
- Context- and path-sensitive memory leak detection2005
- Context-sensitive program analysis as database queries2005
- Banshee: A Scalable Constraint-Based Analysis ToolkitLecture Notes in Computer Science, 2005
- The set constraint/CFL reachability connection in practice2004
- A Tool for Checking ANSI-C Programs2004
- Tracking pointers with path and context sensitivity for bug detection in C programs2003
- The execution algorithm of mercury, an efficient purely declarative logic programming languageThe Journal of Logic Programming, 1996
- Magic sets and other strange ways to implement logic programs (extended abstract)1985