On the complexity of dataflow analysis of logic programs

DOI10.1007/3-540-55719-9_100zbMath1425.68050OpenAlexW1485315871MaRDI QIDQ5204343

Saumya 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

logic programmingabstract interpretation

Mathematics Subject Classification ID

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

Related Items (1)

On the complexity of dataflow analysis of logic programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructive versions of Tarski's fixed point theorems
• Bottom-up abstract interpretation of logic programs
• Enumeration of success patterns in logic programs
• Some global optimizations for a PROLOG compiler
• Algebraic Structures with Hard Equivalence and Minimization Problems
• Automatic mode inference for logic programs
• Horn clause computability
• Efficient dataflow analysis of logic programs
• On the complexity of dataflow analysis of logic programs
• The complexity of theorem-proving procedures

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