On the complexity of dataflow analysis of logic programs

DOI10.1007/3-540-55719-9_100MaRDI QIDQ5204343zbMATH OpenOpenAlexFDO

Authors Saumya K. Debray

Publication date 4 December 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55719-9_100

zbMATH Keywords

abstract interpretationlogic programming

Mathematics Subject Classification ID

Logic programming (68N17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 879004
• On the complexity analysis of static analyses
• On the complexity of flow-sensitive dataflow analyses
• Efficient dataflow analysis of logic programs
• Abstract interpretation of logic programs using magic transformations

Cites work

• Algebraic Structures with Hard Equivalence and Minimization Problems
• Automatic mode inference for logic programs
• Bottom-up abstract interpretation of logic programs
• Constructive versions of Tarski's fixed point theorems
• Efficient dataflow analysis of logic programs
• Enumeration of success patterns in logic programs
• Horn clause computability
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 3735091 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• On the complexity of dataflow analysis of logic programs
• Some global optimizations for a PROLOG compiler
• The complexity of theorem-proving procedures

Cited in

(10)

• On the complexity analysis of static analyses
• A complexity measure for data flow models
• Efficient dataflow analysis of logic programs
• Precise complexity guarantees for pointer analysis via Datalog with extensions
• scientific article; zbMATH DE number 879004 (Why is no real title available?)
• On the complexity of flow-sensitive dataflow analyses
• On the complexity of dataflow analysis of logic programs
• Programming Languages and Systems
• New Computational Paradigms
• Declarative Data Analysis Using Limit Datalog Programs

This page was built for publication: On the complexity of dataflow analysis of logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204343)