Bottom-up dataflow analysis of normal logic programs
From MaRDI portal
Recommendations
Cited in
(13)- S-semantics for logic programming: a retrospective look
- A denotational semantics and dataflow construction for logic programs
- Frameworks for abstract interpretation
- SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
- Path dependent analysis of logic programs
- scientific article; zbMATH DE number 1696888 (Why is no real title available?)
- Truth versus information in logic programming
- Abstract interpretation of logic programs using magic transformations
- Efficient dataflow analysis of logic programs
- scientific article; zbMATH DE number 879004 (Why is no real title available?)
- scientific article; zbMATH DE number 1442044 (Why is no real title available?)
- Repeated redundant inequalities in constraint logic programming
- Syntactic and semantic soundness of structural dataflow analysis
This page was built for publication: Bottom-up dataflow analysis of normal logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012707)