Searching for authors named Michael Codish – sorted by Relevance.
-
Efficient Goal Directed Bottom-up Evaluation of Logic Programs
- Efficient Goal Directed Bottom-up Evaluation of Logic Programs Michael Codish Department
- Cited by 17 (7 self) – Add To MetaCart
-
Worst-Case Groundness Analysis using Positive Boolean Functions
- Worst-Case Groundness Analysis using Positive Boolean Functions Michael Codish Department
- Cited by 9 (3 self) – Add To MetaCart
-
References
- Partial Order Constraints for Graph Algorithms Michael Codish: Project Proposal January 1, 2007
- Add To MetaCart
-
Meta-Circular Abstract Interpretation in Prolog
- Meta-Circular Abstract Interpretation in Prolog Michael Codish\Lambda Harald So
- Cited by 3 (0 self) – Add To MetaCart
-
The Def-inite Approach to Dependency Analysis
- The Def-inite Approach to Dependency Analysis Samir Genaim and Michael Codish The Department
- Cited by 2 (1 self) – Add To MetaCart
-
Incremental Refinement of Semantic Based Program Analysis for Logic Programs
- and Michael Codish 1;2 1 Department of Mathematics and Computer Science, Ben-Gurion University of the Negev
- Cited by 5 (2 self) – Add To MetaCart
-
Proving Implications by Algebraic Approximation
- Proving Implications by Algebraic Approximation Michael Codish Grigory Mashevitzky Department
- Cited by 1 (1 self) – Add To MetaCart
-
Analyzing Logic Programs Using "Prop"-Ositional Logic Programs and a Magic Wand
- Analyzing Logic Programs using "Prop"-ositional Logic Programs and a Magic Wand Michael Codish
- Cited by 2 (0 self) – Add To MetaCart
-
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
- and Michael Codish The Department of Computer Science Ben-Gurion University of the Negev Beer-Sheva, Israel
- Cited by 16 (1 self) – Add To MetaCart
-
Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop
- Michael Codish 1 Bart Demoen 2 1 Dept. of Math. and Comp. Sci., Ben-Gurion University, Israel. 2
- Cited by 32 (9 self) – Add To MetaCart

