2007 · 114 citations · 14 references
ComputingComputer ScienceAlgorithmsProgramming LanguagesSoftware EngineeringAbstract Syntax TreesConstraint SatisfactionControl-flow AnalysisData-flow AnalysisLogic ProgrammingSyntax AnalysisComplexity AnalysisConstraint Logic ProgrammingConstraintsScalability
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.
14
Principles of database and knowledge-base systems
Choice Reviews Online · 1989 · 2.7K citations
Bounded Model Checking Using Satisfiability Solving
Edmund M. Clarke, Armin Biere, Richard Raimi et al. · Formal Methods in System Design · 2001 · 679 citations
Magic sets and other strange ways to implement logic programs (extended abstract)
François Bancilhon, David Maier, Yehoshua Sagiv et al. · 1985 · 534 citations
Object-oriented type inference
Jens Palsberg, Michael I. Schwartzbach · 1991 · 305 citations · Full text