Publications Listed by Year

Published in 2008

• Proving Termination with (Boolean) Satisfaction;
  Michael Codish ;    The 17th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2007)

• A SAT-Based Approach to Size Change Termination with Global Ranking Functions;
  Amir Ben-Amram and Michael Codish;    Fourteenth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)

Published in 2007

• Termination Analysis through Combination of Type Based Norms;
  Maurice Bruynooghe, Michael Codish, John Gallagher, Samir Genaim and Wim Vanhoof ;   ACM Transactions on Programming Languages and Systems; 29(2):10.

• Proving Termination using Recursive Path Orders and SAT Solving;
  Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish and Jürgen Giesl;    FroCoS 2007 - 6th International Symposium on Frontiers of Combining Systems

• Propagation = Lazy Clause Generation;
  Olga Ohrimenko, Peter Stuckey and Michael Codish;    Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming,

Published in 2006

• Size-Change Termination Analysis in k-Bits;
  Michael Codish, Vitaly Lagoon, Peter Schachte and Peter Stuckey;    15th European Symposium on Programming Languages and Systems, ESOP 2006

• Solving Partial Order Constraints for LPO Termination;
  Michael Codish, Vitaly Lagoon and Peter Stuckey;    International Conference on Rewriting Techniques and Applications, RTA 2006

• SAT Solving for Argument Filterings;
  Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann and Jürgen Giesl;    International Conference on Logic for Programming, Artificial Intelligence and Reasoning

• A SAT-based Implementation for RPO Termination;
  Elena Annov, Michael Codish, Jürgen Giesl, Peter Schneider-Kamp and René Thiemann;    International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Short Paper)

• Logic Programming with Satisfiability;
  Michael Codish, Vitaly Lagoon and Peter Stuckey; Technical Report (unpublished);
  Department of Computer Science; Ben-Gurion University; May, 2006.

Published in 2005

• Testing for Termination with Monotonicity Constraints;
  Michael Codish, Vitaly Lagoon and Peter Stuckey;    Twenty First International Conference on Logic Programming

Published in 2004

• Inferring Termination Conditions for Logic Programs using Backwards Analysis;
  Samir Genaim and Michael Codish ;   Theory and Practice of Logic Programming; (accepted):.

• Abstract Partial Evaluation for Termination Analysis;
  Lior Tamary and Michael Codish;    7th International Workshop on Termination (WST 2004)

Published in 2003

• One Loop at a Time;
  Michael Codish, Samir Genaim, Maurice Bruynooghe, John Gallagher and Wim Vanhoof;    6th International Workshop on Termination (WST 2003)

• Proving Termination One Loop at a Time;
  Michael Codish and Samir Genaim;    The 13th Workshop on Logic Programming Environments

Published in 2002

• Meta-circular abstract interpretation in Prolog;
  Michael Codish and Harald Søndergaard;    The Essence of Computation: Complexity, Analysis, Transformation

• Combining Norms to Prove Termination;
  Samir Genaim, Michael Codish, John Gallagher and Vitaly Lagoon;    Third International Workshop on Verification, Model Checking and Abstract Interpretation

• Reuse of Results in Termination Analysis of Typed Logic Programs;
  Maurice Bruynooghe, Michael Codish, Samir Genaim and Wim Vanhoof;    Proceedings of The 9th International Static Analysis Symposium (SAS 2002 - to appear)

Published in 2001

• Worst-Case Groundness Analysis using Definite Boolean Functions;
  Samir Genaim, J.M. Howe and Michael Codish ;   Theory and Practice of Logic Programming; 1(5):611-615.

• The Def-inite Approach to Dependency Analysis;
  Samir Genaim and Michael Codish;    Proceedings of the 10th European Symposium On Programming

• POS(T): Analyzing Dependencies in Typed Logic Programs;
  Maurice Bruynooghe, Wim Vanhoof and Michael Codish;    Perspectives of System Informatics, 4th International Andrei Ershov Memorial Conference, (PSI)

• Higher-Precision Groundness Analysis;
  Michael Codish, Samir Genaim, Harald Søndergaard and Peter Stuckey;    Proceedings of the Seventeenth International Conference on Logic Programming

• Inferring Termination Conditions for Logic Programs using Backwards Analysis;
  Samir Genaim and Michael Codish;    Proceedings of the Eighth International Conference on Logic for Programming, Artificial Intelligence and Reasoning

Published in 2000

• Type Dependencies for Logic Programs using ACI-unification;
  Michael Codish and Vitaly Lagoon ;   Journal of Theoretical Computer Science; 238:131-159.

• An Algebraic Approach to Sharing Analysis of Logic Programs;
  Michael Codish, Vitaly Lagoon and Francesco Bueno ;   The Journal of Logic Programming; 41(2):110-149.

• Improving Program Analyses by Structure Untupling;
  Michael Codish, Kim Marriott and Cohavit Taboch ;   The Journal of Logic Programming; 43(3):251-263.

• Simple, Efficient and Scalable Groundness Analysis of Logic Programs;
  Andy Heaton, Muhamed Abo-Zaed, Michael Codish and Andy King ;   The Journal of Logic Programming; 45(1-3):143-156.

• The Def-inite Approach to Dependency Analysis;
  Samir Genaim and Michael Codish;    Presented at the APPIA-GULP-PRODE 2000 Joint Conference on Declarative Programming (La Habana)

Published in 1999

• Efficient Goal Directed Bottom-up Evaluation of Logic Programs;
  Michael Codish ;   The Journal of Logic Programming; 38(3):354-370.

• A Semantic Basis for the Termination Analysis of Logic Programs;
  Michael Codish and Cohavit Taboch ;   The Journal of Logic Programming; 41(1):103-123.

• Sharing and Groundness Dependencies in Logic Programs;
  Michael Codish, Harald Søndergaard and Peter Stuckey ;   ACM Transactions on Programming Languages and Systems; 21(5):948-976.

• Worst-Case Groundness Analysis using Positive Boolean Functions;
  Michael Codish ;   The Journal of Logic Programming; 41(1):125--128.

• Incremental Refinement of Semantic Based Program Analysis for Logic Programs;
  Samir Genaim and Michael Codish;    Proceedings of the 22nd Australasian Computer Science Conference

Published in 1998

• Semantic-Based Program Analysis for Logic-Based Languages using XSB;
  Michael Codish, Bart Demoen and Kostis Sagonas ;   Springer International Journal of Software Tools for Technology Transfer; 2(1):29-45.

• The Boolean Logic of Set Sharing Analysis;
  Michael Codish and Harald Søndergaard;    Principles of Declarative Programming

Published in 1997

• Exploiting Goal Independence in the Analysis of Logic Programs;
  Michael Codish, María García de la Banda, Maurice Bruynooghe and Manuel Hermenegildo ;   The Journal of Logic Programming; 32(3):247-261.

• A Confluent Semantic Basis for the Analysis of Concurrent Constraint Logic Programs;
  Michael Codish, Moreno Falaschi, Kim Marriott and Will Winsborough ;   The Journal of Logic Programming; 30(1):53-81.

• An Algebraic Approach to Sharing Analysis of Logic Programs;
  Michael Codish, Vitaly Lagoon and Francesco Bueno;    Proceedings of the Fourth International Static Analysis Symposium

• A Semantic Basis for Termination Analysis of Logic Programs and its Realization using Symbolic Norm Constraints;
  Michael Codish and Cohavit Taboch;    Proceedings of the Sixth International Conference on Algebraic and Logic Programming

Published in 1996

• Proving Implications by Algebraic Approximation;
  Michael Codish and Grigory Mashevitzky ;   Journal of Theoretical Computer Science; 165:57-74.

• On the Design of a Correct Freeness Analysis for Logic Programs;
  Michael Codish, Dennis Dams, Gilberto Filé and Maurice Bruynooghe ;   The Journal of Logic Programming; 28(3):181-206.

• Type Dependencies for Logic Programs using ACI-unification;
  Michael Codish and Vitaly Lagoon;    Proceedings of the 1996 Israeli Symposium on Theory of Computing and Systems

Published in 1995

• Analysing Logic Programs using "Prop"-ositional Logic Programs and a Magic Wand;
  Michael Codish and Bart Demoen ;   The Journal of Logic Programming; 25(3):249-274.

• Oracle Semantics for Prolog;
  Roberto Barbuti, Michael Codish, Roberto Giacobazzi and Michael Maher ;   Information and Computation; 22(2):178-200.

• Improving Abstract Interpretations by Combining Domains;
  Michael Codish, Anne Mulkers, Maurice Bruynooghe, María García de la Banda and Manuel Hermenegildo ;   ACM Transactions on Programming Languages and Systems; 17(1):28-44.

• Abstracting Unification: A Key Step in the Design of Logic Program Analyses;
  M. Bruynooghe, M. Codish, A. Mulkers;    Computer Science Today

Published in 1994

• Bottom-Up Abstract Interpretation of Logic Programs;
  Michael Codish, Dennis Dams and Eyal Yardeni ;   Journal of Theoretical Computer Science; 124:93--125.

• Suspension Analysis for Concurrent Logic Programs;
  Michael Codish, Moreno Falaschi and Kim Marriott ;   ACM Transactions on Programming Languages and Systems; 16(3):649-686.

• Goal Dependent vs Goal Independent Analysis of Logic Programs;
  Michael Codish, María García de la Banda, Maurice Bruynooghe and Manuel Hermenegildo;    Proceedings of the Fifth International Conference on Logic Programming and Automated Reasoning

• Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop;
  Michael Codish and Bart Demoen;    Proceedings of the First Static Analysis Symposium

• Proving Implications by Algebraic Approximation;
  Michael Codish and Grigory Mashevitzky;    Proceedingss of the 4th International Conference on Algebraic and Logic Programming

Published in 1993

• Modelling Prolog Control;
  Roberto Barbuti, Michael Codish, Roberto Giacobazzi and Giorgio Levi ;   Journal of Logic and Computation; 3:579--603.

• Compositional Analysis of Modular Logic Programs;
  Michael Codish, Saumya Debray and Roberto Giacobazzi;    Proceedings of the Twentieth ACM symposium on Principles of Programming Languages

• Improving Abstract Interpretations by Combining Domains;
  Michael Codish, A. Mulkers, Maurice Bruynooghe, María García de la Banda and Manuel Hermenegildo;    Proceedings of the ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation

• Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs;
  Michael Codish, Moreno Falaschi, Kim Marriott and Will Winsborough;    Proceedings of the Twentieth International Colloquium on Automata, Languages and Programming

• Freeness Analysis for Logic Programs --- And Correctness ?;
  Michael Codish, Dennis Dams, Gilberto Filé and Maurice Bruynooghe;    Proceedings of the Tenth International Conference on Logic Programming

• Freeness Analysis in the Presence of Numerical Constraints;
  V. Dumortier, G. Janssens, Maurice Bruynooghe and Michael Codish;    Proceedings of the Tenth International Conference on Logic Programming

• Freeness, Sharing, Linearity and Correctness --- All at Once;
  Maurice Bruynooghe and Michael Codish;    Proceedings of the 1993 International Workshop on Static Analysis

• Analysing Logic Programs using Prop-ositional Logic Programs and a Magic Wand;
  Michael Codish and Bart Demoen;    Proceedings of the 1993 International Logic Programming Symposium

Published in 1992

• Modelling Prolog Control;
  Roberto Barbuti, Michael Codish, Roberto Giacobazzi and Giorgio Levi;    Proceedings of the Nineteenth ACM symposium on Principles of Programming Languages

• Oracle Semantics for Prolog;
  Roberto Barbuti, Michael Codish, Roberto Giacobazzi and Michael Maher;    Proceedings of the Third International Conference on Algebraic and Logic Programming

Published in 1991

• Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis;
  Michael Codish, Dennis Dams and Eyal Yardeni;    Proceedings of the Eighth International Conference on Logic Programming

• Suspension Analysis for Concurrent Logic Programs;
  Michael Codish, Moreno Falaschi and Kim Marriott;    Proceedings of the Eighth International Conference on Logic Programming

Published in 1990

• Automatic Detection of Incomplete Message Protocols in Concurrent Logic Programs;
  Michael Codish, Dennis Dams and Ehud Shapiro;    Proceedings of the Meta 90 workshop on meta-programming in logic

Published in 1989

• Using Safe Approximations of Fixed Points for Analysis of Logic Programs;
  Michael Codish, John Gallagher and Ehud Shapiro;    Meta-programming in Logic Programming

Published in 1988

• Specialising Prolog and FCP Programs Using Abstract Interpretation;
  John Gallagher, Michael Codish and Ehud Shapiro ;   Journal of New Generation Computing; 6:159--186.

• Fully Abstract Denotational Semantics for Concurrent Prolog;
  Rob Gerth, Michael Codish, Yossi Lichtenstein and Ehud Shapiro;    Proceedings of the Third Annual Symposium on Logic in Computer Science

Published in 1987

• Compiling OR-parallelism into AND-parallelism;
  Michael Codish and Ehud Shapiro ;   Journal of New Generation Computing; 5:45--61.

Published in 1986

• Pressing for Parallelism; a Prolog Program Made Concurrent;
  Leon Sterling and Michael Codish ;   Journal of Logic Programming; 3(1):75--94.

• Compiling OR-parallelism into AND-parallelism;
  Michael Codish and Ehud Shapiro;    Proceedings of the Third International Conference on Logic Programming