Algebraic Structures with Hard Equivalence and Minimization Problems
Journal of the ACM (JACM)
The IFIP TC2/WG 2.1 Working Conference on Program specification and transformation
Automatic mode inference for logic programs
Journal of Logic Programming
Static inference of modes and data dependencies in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
A characterization of non-floundering logic programs
Proceedings of the 1990 North American conference on Logic programming
Bottom-up dataflow analysis of normal logic programs
Journal of Logic Programming
Global flow analysis as a practical compilation tool
Journal of Logic Programming
Efficient dataflow analysis of logic programs
Journal of the ACM (JACM)
Experimental evaluation of a generic abstract interpretation algorithm for PROLOG
ACM Transactions on Programming Languages and Systems (TOPLAS)
Live-structure dataflow analysis for Prolog
ACM Transactions on Programming Languages and Systems (TOPLAS)
Precise and efficient groundness analysis for logic programs
ACM Letters on Programming Languages and Systems (LOPLAS)
Denotational abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Suspension analyses for concurrent logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Combinations of abstract domains for logic programming
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type analysis of Prolog using type graphs
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Analysing logic programs using “prop”-ositional logic programs and a magic wand
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Proceedings of the eleventh international conference on Logic programming
The complexity of ordering subgoals
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Higher-order strictness analysis in untyped lambda calculus
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A precise inter-procedural data flow algorithm
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Tool to Check the Non-Floundering Logic Programs and Goals
PLILP '88 Proceedings of the 1st International Workshop on Programming Language Implementation and Logic Programming
Directional Type Checking of Logic Programs
SAS '94 Proceedings of the First International Static Analysis Symposium on Static Analysis
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Complexity of a top-down capture rule
Complexity of a top-down capture rule
Automatic, transparent parallelization of logic programs at compile time
Automatic, transparent parallelization of logic programs at compile time
Global analysis of constraint logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Making abstract interpretations complete
Journal of the ACM (JACM)
Polymorphic directional types for logic programming
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
| Hi-index | 0.00 |
It is widely held that there is a correlation between complexity and precision in dataflow analysis, in the sense that the more precise an analysis algorithm, the more computationally expensive it must be. The details of this relationship, however, appear to not have been explored extensively. This article reports some results on this correlation in the context of logic programs. A formal notion of the “precision” of an analysis algorithm is proposed, and this is used to characterize the worst-case computational complexity of a number of dataflow analyses with different degrees of precision. While this article considers the analysis of logic programs, the technique proposed, namely the use of “exactness sets” to study relationships between complexity and precision of analyses, is not specific to logic programming in any way, and is equally applicable to flow analyses of other language families.