Paths vs. trees in set-based program analysis

Authors:
Witold Charatonik;Andreas Podelski;Jean-Marc Talbot
Affiliations:
Max-Planck-Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany and University of Wroclaw, Poland;Max-Planck-Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany;Max-Planck-Institut für Informatik, Im Stadtwald, D-66123 Saarbrücken, Germany
Venue:
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
2000

Citing 13
Cited 9

Type inference by program transformation and partial evaluation

Meta-programming in logic programming
A finite presentation theorem for approximating logic programs

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for logic program

Journal of Logic Programming
Set based program analysis

Set based program analysis
Alternation

Journal of the ACM (JACM)
Flow analysis and optimization of LISP-like structures

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Set Constraints: Results, Applications, and Future Directions

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Set Constraints and Set-Based Analysis

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Reachability Analysis of Pushdown Automata: Application to Model-Checking

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Set-Based Analysis for Logic Programming and Tree Automata

SAS '97 Proceedings of the 4th International Symposium on Static Analysis
The Complexity of Set Constraints

CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
Set constraints with intersection

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
The Horn Mu-calculus

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science

Directional Type Checking for Logic Programs: Beyond Discriminative Types

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
On Name Generation and Set-Based Analysis in the Dolev-Yao Model

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
More Precise Yet Efficient Type Inference for Logic Programs

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Set constraints with intersection

Information and Computation - Special issue: LICS'97
Deciding H1 by resolution

Information Processing Letters
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete

Journal of Computer Security
Deciding H1 by resolution

Information Processing Letters
Deciding H1 by resolution

Information Processing Letters
Set constraints with projections

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Set-based analysis of logic programs provides an accurate method for descriptive type-checking of logic programs. The key idea of this method is to upper approximate the least model of the program by a regular set of trees. In 1991, Frühwirth, Shapiro, Vardi and Yardeni raised the question whether it can be more efficient to use the domain of sets of paths instead, i.e., to approximate the least model by a regular set of words. We answer the question negatively by showing that type-checking for path-based analysis is as hard as the set-based one, that is DEXPTIME-complete. This result has consequences also in the areas of set constraints, automata theory and model checking.