Pressing for Parallelism: A Prolog Program made Concurrent. - Leon Sterling; Michael Codish (J. Log. Program., 1986)

Compiling OR-parallelism into AND-parallelism. - Michael Codish; Ehud Shapiro (New Gener. Comput., 1987)

Fully Abstract Denotational Semantics for Flat Concurrent Prolog - Rob Gerth; Michael Codish; Yossi Lichtenstein; Ehud Shapiro (LICS, 1988)

Using Safe Approximations of Fixed Points for Analysis of Logic Programs. - Michael Codish; John P. Gallagher; Ehud Shapiro (META, 1988)

Specialisation of Prolog and FCP Programs Using Abstract Interpretation. - John P. Gallagher; Michael Codish; Ehud Shapiro (New Gener. Comput., 1988)

Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis. - Michael Codish; Dennis Dams; Eyal Yardeni (ICLP, 1991)

Suspension Analysis for Concurrent Logic Programs. - Michael Codish; Moreno Falaschi; Kim Marriott (ICLP, 1991)

Modeling Prolog Control. - Roberto Barbuti; Michael Codish; Roberto Giacobazzi; Giorgio Levi (POPL, 1992)

Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs. - Michael Codish; Moreno Falaschi; Kim Marriott; William H. Winsborough (WSA, 1992)

Efficient Analysis of Concurrent Constraint Logic Programs. - Michael Codish; Moreno Falaschi; Kim Marriott; William H. Winsborough (ICALP, 1993)

Freeness Analysis for Logic Programs - And Correctness? - Michael Codish; Dennis Dams; Gilberto Filé; Maurice Bruynooghe (ICLP, 1993)

Freeness Analysis in the Presence of Numerical Constraints. - Veroniek Dumortier; Gerda Janssens; Maurice Bruynooghe; Michael Codish (ICLP, 1993)

Compositional Analysis of Modular Logic Programs. - Michael Codish; Saumya K. Debray; Roberto Giacobazzi (POPL, 1993)

Freeness, Sharing, Linearity and Correctness - All at Once. - Maurice Bruynooghe; Michael Codish (WSA, 1993)

Analysing Logic Programs Using 'Prop'-ositional Logic Programs and a Magic Wand. - Michael Codish; Bart Demoen (ILPS, 1993)

Modelling Prolog Control. - Roberto Barbuti; Michael Codish; Roberto Giacobazzi; Giorgio Levi (J. Log. Comput., 1993)

Abstract Unification for a Composite Domain Deriving Sharing and Freeness Properties of Program Variables. - Maurice Bruynooghe; Michael Codish; Anne Mulkers (ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages, 1994)

Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. - Michael Codish; Bart Demoen (ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages, 1994)

Goal Dependent versus Goal Independent Analysis of Logic Programs. - Michael Codish; Maria J. García de la Banda; Maurice Bruynooghe; Manuel V. Hermenegildo (LPAR, 1994)

Bottom-up Abstract Interpretation of Logic Programs. - Michael Codish; Dennis Dams; Eyal Yardeni (Theor. Comput. Sci., 1994)

Suspension Analyses for Concurrent Logic Programs. - Michael Codish; Moreno Falaschi; Kim Marriott (ACM Trans. Program. Lang. Syst., 1994)

Abstracting Unification: A Key Step in the Design of Logic Program Analyses. - Maurice Bruynooghe; Michael Codish; Anne Mulkers (Computer Science Today, 1995)

Oracle Semantics for Prolog. - Roberto Barbuti; Michael Codish; Roberto Giacobazzi; Michael J. Maher (Inf. Comput., 1995)

Analyzing Logic Programs Using "PROP"-ositional Logic Programs and a Magic Wand. - Michael Codish; Bart Demoen (J. Log. Program., 1995)

Improving Abstract Interpretations by Combining Domains. - Michael Codish; Anne Mulkers; Maurice Bruynooghe; Maria J. García de la Banda; Manuel V. Hermenegildo (ACM Trans. Program. Lang. Syst., 1995)

Sharing Analysis for Logic Programs using Set Logic Programs. - Michael Codish; Vitaly Lagoon; Francisco Bueno (APPIA-GULP-PRODE, 1996)

On the Design of a Correct Freeness Analysis for Logic Programs. - Michael Codish; Dennis Dams; Gilberto Filé; Maurice Bruynooghe (J. Log. Program., 1996)

Proving Implications by Algebraic Approximation. - Michael Codish; Grigory Mashevitzky (Theor. Comput. Sci., 1996)

A Semantic Basis for Termination Analysis of Logic Programs and its Realization Using Symbolic Norm Constraints. - Michael Codish; Cohavit Taboch (APPIA-GULP-PRODE, 1997)

Sharing Analysis Using Set Logic Programs. - Francisco Bueno; Michael Codish; Vitaly Lagoon (ICLP, 1997)

XSB as the Natural Habitat for General Purpose Program Analysis. - Michael Codish; Bart Demoen; Konstantinos Sagonas (ICLP, 1997)

Exploiting Goal Independence in the Analysis of Logic Programs. - Michael Codish; Maurice Bruynooghe; Maria J. García de la Banda; Manuel V. Hermenegildo (J. Log. Program., 1997)

A Confluent Semantic Basis for the Analysis of Concurrent Constraint Logic Programs. - Michael Codish; Moreno Falaschi; Kim Marriott; William H. Winsborough (J. Log. Program., 1997)

The Boolean Logic of Set Sharing Analysis. - Michael Codish; Harald Søndergaard (PLILP/ALP, 1998)

Semantics-Based Program Analysis for Logic-Based Languages Using XSB. - Michael Codish; Bart Demoen; Konstantinos Sagonas (Int. J. Softw. Tools Technol. Transf., 1998)

Efficient Goal Directed Bottom-Up Evaluation of Logic Programs. - Michael Codish (J. Log. Program., 1999)

Worst-Case Groundness Analysis Using Positive Boolean Functions. - Michael Codish (J. Log. Program., 1999)

A Semantic Basis for the Termination Analysis of Logic Programs. - Michael Codish; Cohavit Taboch (J. Log. Program., 1999)

Sharing and groundness dependencies in logic programs. - Michael Codish; Harald Søndergaard; Peter J. Stuckey (ACM Trans. Program. Lang. Syst., 1999)

An Algebraic Approach to Sharing Analysis of Logic Programs. - Michael Codish; Vitaly Lagoon; Francisco Bueno (J. Log. Program., 2000)

Improving Program Analyses, by Structure Untupling. - Michael Codish; Kim Marriott; Cohavit Taboch (J. Log. Program., 2000)

A simple polynomial groundness analysis for logic programs. - Andy Heaton; Muhamed Abo-Zaed; Michael Codish; Andy King (J. Log. Program., 2000)

Type dependencies for logic programs using ACI-unification. - Michael Codish; Vitaly Lagoon (Theor. Comput. Sci., 2000)

Pos(T): Analyzing Dependencies in Typed Logic Programs. - Maurice Bruynooghe; Wim Vanhoof; Michael Codish (Ershov Memorial Conference, 2001)

The Def-inite Approach to Dependency Analysis. - Samir Genaim; Michael Codish (ESOP, 2001)

Higher-Precision Groundness Analysis. - Michael Codish; Samir Genaim; Harald Søndergaard; Peter J. Stuckey (ICLP, 2001)

Worst-case groundness analysis using definite boolean functions. - Samir Genaim; Jacob M. Howe; Michael Codish (Theory Pract. Log. Program., 2001)

Meta-circular Abstract Interpretation in Prolog. - Michael Codish; Harald Søndergaard (The Essence of Computation, 2002)

Reuse of Results in Termination Analysis of Typed Logic Programs. - Maurice Bruynooghe; Michael Codish; Samir Genaim; Wim Vanhoof (SAS, 2002)

Combining Norms to Prove Termination. - Samir Genaim; Michael Codish; John P. Gallagher; Vitaly Lagoon (VMCAI, 2002)

Proving Termination One Loop at a Time. - Michael Codish; Samir Genaim (WLPE, 2003)

Testing for Termination with Monotonicity Constraints. - Michael Codish; Vitaly Lagoon; Peter J. Stuckey (ICLP, 2005)

Inferring Termination Conditions for Logic Programs using Backwards Analysis. - Samir Genaim; Michael Codish (Theory Pract. Log. Program., 2005)

Size-Change Termination Analysis in k-Bits. - Michael Codish; Vitaly Lagoon; Peter Schachte; Peter J. Stuckey (ESOP, 2006)

SAT Solving for Argument Filterings. - Michael Codish; Peter Schneider-Kamp; Vitaly Lagoon; René Thiemann; Jürgen Giesl (LPAR, 2006)

Propagation = Lazy Clause Generation. - Olga Ohrimenko; Peter J. Stuckey; Michael Codish (CP, 2007)

Implementing RPO and POLO using SAT. - Peter Schneider-Kamp; Carsten Fuhs; René Thiemann; Jürgen Giesl; Elena Annov; Michael Codish; Aart Middeldorp; Harald Zankl (Deduction and Decision Procedures, 2007)

Proving Termination Using Recursive Path Orders and SAT Solving. - Peter Schneider-Kamp; René Thiemann; Elena Annov; Michael Codish; Jürgen Giesl (FroCoS, 2007)

Proving Termination with (Boolean) Satisfaction. - Michael Codish (LOPSTR, 2007)

Termination analysis of logic programs through combination of type-based norms. - Maurice Bruynooghe; Michael Codish; John P. Gallagher; Samir Genaim; Wim Vanhoof (ACM Trans. Program. Lang. Syst., 2007)

Termination Analysis of Java Bytecode. - Elvira Albert; Puri Arenas; Michael Codish; Samir Genaim; Germán Puebla; Damiano Zanardini (FMOODS, 2008)

Telecommunications Feature Subscription as a Partial Order Constraint Problem. - Michael Codish; Vitaly Lagoon; Peter J. Stuckey (ICLP, 2008)

A SAT-Based Approach to Size Change Termination with Global Ranking Functions. - Amir M. Ben-Amram; Michael Codish (TACAS, 2008)

Solving Partial Order Constraints for LPO Termination. - Michael Codish; Vitaly Lagoon; Peter J. Stuckey (J. Satisf. Boolean Model. Comput., 2008)

Logic programming with satisfiability. - Michael Codish; Vitaly Lagoon; Peter J. Stuckey (Theory Pract. Log. Program., 2008)

A declarative encoding of telecommunications feature subscription in SAT. - Michael Codish; Samir Genaim; Peter J. Stuckey (PPDP, 2009)

Propagation via lazy clause generation. - Olga Ohrimenko; Peter J. Stuckey; Michael Codish (Constraints An Int. J., 2009)

Lazy Abstraction for Size-Change Termination. - Michael Codish; Carsten Fuhs; Jürgen Giesl; Peter Schneider-Kamp (LPAR (Yogyakarta), 2010)

Pairwise Cardinality Networks. - Michael Codish; Moshe Zazon-Ivry (LPAR (Dakar), 2010)

Boolean Equi-propagation for Optimized SAT Encoding. - Amit Metodi; Michael Codish; Vitaly Lagoon; Peter J. Stuckey (CP, 2011)

Optimal Base Encodings for Pseudo-Boolean Constraints. - Michael Codish; Yoav Fekete; Carsten Fuhs; Peter Schneider-Kamp (TACAS, 2011)

SAT-based termination analysis using monotonicity constraints over the integers. - Michael Codish; Igor Gonopolskiy; Amir M. Ben-Amram; Carsten Fuhs; Jürgen Giesl (Theory Pract. Log. Program., 2011)

Compiling Model-Based Diagnosis to Boolean Satisfaction. - Amit Metodi; Roni Stern; Meir Kalech; Michael Codish (AAAI, 2012)

Exotic Semi-Ring Constraints. - Michael Codish; Yoav Fekete; Carsten Fuhs; Jürgen Giesl; Johannes Waldmann (SMT@IJCAR, 2012)

Programming with Boolean Satisfaction. - Michael Codish (FLOPS, 2012)

SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs. - Michael Codish; Jürgen Giesl; Peter Schneider-Kamp; René Thiemann (J. Autom. Reason., 2012)

Compiling finite domain constraints to SAT with BEE. - Amit Metodi; Michael Codish (Theory Pract. Log. Program., 2012)

Backbones for Equality. - Michael Codish; Yoav Fekete; Amit Metodi (Haifa Verification Conference, 2013)

Breaking Symmetries in Graph Representation. - Michael Codish; Alice Miller 001; Patrick Prosser; Peter James Stuckey (IJCAI, 2013)

Compiling Finite Domain Constraints to SAT with BEE: the Director's Cut. - Michael Codish; Yoav Fekete; Amit Metodi (CoRR, 2013)

Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems. - Amit Metodi; Michael Codish; Peter J. Stuckey (J. Artif. Intell. Res., 2013)

Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten). - Michael Codish; Luís Cruz-Filipe; Michael Frank 002; Peter Schneider-Kamp (ICTAI, 2014)

Simplifying Pseudo-Boolean Constraints in Residual Number Systems. - Yoav Fekete; Michael Codish (SAT, 2014)

The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes. - Michael Codish; Luís Cruz-Filipe; Peter Schneider-Kamp (SYNASC, 2014)

Solving Graph Coloring Problems with Abstraction and Symmetry: the Ramsey Number R(4, 3, 3)=30. - Michael Codish; Michael Frank 002; Avraham Itzhakov; Alice Miller 001 (CoRR, 2014)

A Novel SAT-Based Approach to Model Based Diagnosis. - Amit Metodi; Roni Stern; Meir Kalech; Michael Codish (J. Artif. Intell. Res., 2014)

Sorting Networks: The End Game. - Michael Codish; Luís Cruz-Filipe; Peter Schneider-Kamp (LATA, 2015)

Applying Sorting Networks to Synthesize Optimized Sorting Libraries. - Michael Codish; Luís Cruz-Filipe; Markus Nebel; Peter Schneider-Kamp (LOPSTR, 2015)

When Six Gates are Not Enough. - Michael Codish; Luís Cruz-Filipe; Michael Frank 002; Peter Schneider-Kamp (CoRR, 2015)

Breaking Symmetries in Graphs: The Nauty Way. - Michael Codish; Graeme Gange; Avraham Itzhakov; Peter J. Stuckey (CP, 2016)

Computing the Ramsey number R(4, 3, 3) using abstraction and symmetry breaking. - Michael Codish; Michael Frank 002; Avraham Itzhakov; Alice Miller 001 (Constraints An Int. J., 2016)

Breaking symmetries in graph search with canonizing sets. - Avraham Itzhakov; Michael Codish (Constraints An Int. J., 2016)

Logic Programming with Graph Automorphism: Integrating naut with Prolog (a Tool Paper). - Michael Frank 002; Michael Codish (CoRR, 2016)

Sorting nine inputs requires twenty-five comparisons. - Michael Codish; Luís Cruz-Filipe; Michael Frank 002; Peter Schneider-Kamp (J. Comput. Syst. Sci., 2016)

Preface for special section from FLOPS 2014. - Michael Codish; Eijiro Sumii (J. Funct. Program., 2016)

Logic Programming with Graph Automorphism: Integrating nauty with Prolog (Tool Description). - Michael Frank 002; Michael Codish (Theory Pract. Log. Program., 2016)

Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description). - Michael Codish; Michael Frank 002; Amit Metodi; Morad Muslimany (ICLP (Technical Communications), 2017)

The DNA Word Design Problem: A New Constraint Model and New Results. - Michael Codish; Michael Frank 002; Vitaly Lagoon (IJCAI, 2017)

Optimizing sorting algorithms by using sorting networks. - Michael Codish; Luís Cruz-Filipe; Markus Nebel; Peter Schneider-Kamp (Formal Aspects Comput., 2017)

Optimal-depth sorting networks. - Daniel Bundala; Michael Codish; Luís Cruz-Filipe; Peter Schneider-Kamp; Jakub Závodný (J. Comput. Syst. Sci., 2017)

Breaking Symmetries with Lex Implications. - Michael Codish; Thorsten Ehlers; Graeme Gange; Avraham Itzhakov; Peter J. Stuckey (FLOPS, 2018)

SAT-Based Big-Step Local Search. - Morad Muslimany; Michael Codish (SYNASC, 2018)

A SAT Encoding for the n-Fractions Problem. - Michael Codish (CoRR, 2018)

Constraints for symmetry breaking in graph representation. - Michael Codish; Alice Miller 001; Patrick Prosser; Peter J. Stuckey (Constraints An Int. J., 2019)

Sorting networks: To the end and back again. - Michael Codish; Luís Cruz-Filipe; Thorsten Ehlers; Mike Müller; Peter Schneider-Kamp (J. Comput. Syst. Sci., 2019)

Incremental Symmetry Breaking Constraints for Graph Search Problems. - Avraham Itzhakov; Michael Codish (AAAI, 2020)

Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs. - Avraham Itzhakov; Michael Codish (Constraints An Int. J., 2022)

Breaking Symmetries with High Dimensional Graph Invariants and Their Combination. - Avraham Itzhakov; Michael Codish (CPAIOR, 2023)

SAT-Based Techniques for Lexicographically Smallest Finite Models. - Mikolás Janota; Choiwah Chow; João Araújo 002; Michael Codish; Petr Vojtechovský (AAAI, 2024)

Complete Symmetry Breaking for Finite Models. - Marek Danco; Mikolás Janota; Michael Codish; João Jorge Araújo (AAAI, 2025)

Breaking Symmetries with Involutions. - Michael Codish; Mikolás Janota (CP, 2025)

Breaking Symmetries from a Set-Covering Perspective. - Michael Codish; Mikolás Janota (CPAIOR (1), 2025)

Complete Symmetry Breaking for Finite Models. - Marek Danco; Mikolás Janota; Michael Codish; João Araújo 002 (CoRR, 2025)