The Def-inite approach to dependency analysis

DOI10.1007/3-540-45309-1_28MaRDI QIDQ2763688zbMATH OpenFDO

Authors Samir Genaim, Michael Codish

Publication date 21 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2028/20280417

Mathematics Subject Classification ID

Boolean functions (06E30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Implementing groundness analysis with definite Boolean functions
• Two classes of Boolean functions for dependency analysis
• Efficient groundness analysis in Prolog
• A simple polynomial groundness analysis for logic programs
• The Boolean logic of set sharing analysis

Cited in

(5)

• Two classes of Boolean functions for dependency analysis
• Boolean functions for finite-tree dependencies
• The Boolean logic of set sharing analysis
• Efficient groundness analysis in Prolog
• scientific article; zbMATH DE number 2085273 (Why is no real title available?)

This page was built for publication: The Def-inite approach to dependency analysis

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