Efficient dataflow analysis of logic programs
From MaRDI portal
Recommendations
- On the complexity of dataflow analysis of logic programs
- scientific article; zbMATH DE number 879004
- scientific article; zbMATH DE number 1442044
- Bottom-up dataflow analysis of normal logic programs
- Determinacy analysis for efficient execution of logic programs
- Optimized algorithms for incremental analysis of logic programs
- A denotational semantics and dataflow construction for logic programs
- A logic-based approach to program flow analysis
- scientific article; zbMATH DE number 3980485
Cited in
(17)- An efficient general iterative algorithm for dataflow analysis
- A logic-based approach to program flow analysis
- Generating data flow analysis algorithms from modal specifications
- Transformation of logic programs to FP programs based on dataflows
- Data flow analysis of asynchronous systems using infinite abstract domains
- scientific article; zbMATH DE number 1696779 (Why is no real title available?)
- Ordered structures for parallel rule-based computations
- Logic-flow analysis of higher-order programs
- Automatic mode inference for logic programs
- scientific article; zbMATH DE number 1303988 (Why is no real title available?)
- scientific article; zbMATH DE number 879004 (Why is no real title available?)
- scientific article; zbMATH DE number 1442044 (Why is no real title available?)
- Optimized algorithms for incremental analysis of logic programs
- Data flow analysis as model checking
- On the complexity of dataflow analysis of logic programs
- Programming Languages and Systems
- Declarative Data Analysis Using Limit Datalog Programs
This page was built for publication: Efficient dataflow analysis of logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302797)
