| 2025 | AAAI | Complete Symmetry Breaking for Finite Models. | Marek Danco, Mikols Janota, Michael Codish, Joo Jorge Arajo |
| 2025 | CP | Breaking Symmetries with Involutions. | Michael Codish, Mikols Janota |
| 2025 | CPAIOR | Breaking Symmetries from a Set-Covering Perspective. | Michael Codish, Mikols Janota |
| 2024 | AAAI | SAT-Based Techniques for Lexicographically Smallest Finite Models. | Mikols Janota, Choiwah Chow, Joo Arajo, Michael Codish, Petr Vojtechovsk |
| 2023 | CPAIOR | Breaking Symmetries with High Dimensional Graph Invariants and Their Combination. | Avraham Itzhakov, Michael Codish |
| 2020 | AAAI | Incremental Symmetry Breaking Constraints for Graph Search Problems. | Avraham Itzhakov, Michael Codish |
| 2018 | FLOPS | Breaking Symmetries with Lex Implications. | Michael Codish, Thorsten Ehlers, Graeme Gange, Avraham Itzhakov, Peter J. Stuckey |
| 2018 | SYNASC | SAT-Based Big-Step Local Search. | Morad Muslimany, Michael Codish |
| 2017 | ICLP | Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description). | Michael Codish, Michael Frank, Amit Metodi, Morad Muslimany |
| 2017 | IJCAI | The DNA Word Design Problem: A New Constraint Model and New Results. | Michael Codish, Michael Frank, Vitaly Lagoon |
| 2016 | CP | Breaking Symmetries in Graphs: The Nauty Way. | Michael Codish, Graeme Gange, Avraham Itzhakov, Peter J. Stuckey |
| 2015 | LATA | Sorting Networks: The End Game. | Michael Codish, Lus Cruz-Filipe, Peter Schneider-Kamp |
| 2015 | LOPSTR | Applying Sorting Networks to Synthesize Optimized Sorting Libraries. | Michael Codish, Lus Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp |
| 2014 | ICTAI | Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten). | Michael Codish, Lus Cruz-Filipe, Michael Frank, Peter Schneider-Kamp |
| 2014 | SAT | Simplifying Pseudo-Boolean Constraints in Residual Number Systems. | Yoav Fekete, Michael Codish |
| 2014 | SYNASC | The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes. | Michael Codish, Lus Cruz-Filipe, Peter Schneider-Kamp |
| 2013 | IJCAI | Breaking Symmetries in Graph Representation. | Michael Codish, Alice Miller, Patrick Prosser, Peter James Stuckey |
| 2012 | AAAI | Compiling Model-Based Diagnosis to Boolean Satisfaction. | Amit Metodi, Roni Stern, Meir Kalech, Michael Codish |
| 2012 | CADE | Exotic Semi-Ring Constraints. | Michael Codish, Yoav Fekete, Carsten Fuhs, Jrgen Giesl, Johannes Waldmann |
| 2012 | FLOPS | Programming with Boolean Satisfaction. | Michael Codish |
| 2011 | CP | Boolean Equi-propagation for Optimized SAT Encoding. | Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey |
| 2011 | TACAS | Optimal Base Encodings for Pseudo-Boolean Constraints. | Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp |
| 2010 | LPAR | Lazy Abstraction for Size-Change Termination. | Michael Codish, Carsten Fuhs, Jrgen Giesl, Peter Schneider-Kamp |
| 2010 | LPAR | Pairwise Cardinality Networks. | Michael Codish, Moshe Zazon-Ivry |
| 2009 | PPDP | A declarative encoding of telecommunications feature subscription in SAT. | Michael Codish, Samir Genaim, Peter J. Stuckey |
| 2008 | ICLP | Telecommunications Feature Subscription as a Partial Order Constraint Problem. | Michael Codish, Vitaly Lagoon, Peter J. Stuckey |
| 2008 | TACAS | A SAT-Based Approach to Size Change Termination with Global Ranking Functions. | Amir M. Ben-Amram, Michael Codish |
| 2007 | CP | Propagation = Lazy Clause Generation. | Olga Ohrimenko, Peter J. Stuckey, Michael Codish |
| 2007 | LOPSTR | Proving Termination with (Boolean) Satisfaction. | Michael Codish |
| 2006 | ESOP | Size-Change Termination Analysis in | Michael Codish, Vitaly Lagoon, Peter Schachte, Peter J. Stuckey |
| 2006 | LPAR | SAT Solving for Argument Filterings. | Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, Ren Thiemann, Jrgen Giesl |
| 2005 | ICLP | Testing for Termination with Monotonicity Constraints. | Michael Codish, Vitaly Lagoon, Peter J. Stuckey |
| 2002 | SAS | Reuse of Results in Termination Analysis of Typed Logic Programs. | Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof |
| 2002 | VMCAI | Combining Norms to Prove Termination. | Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon |
| 2001 | ESOP | The Def-inite Approach to Dependency Analysis. | Samir Genaim, Michael Codish |
| 2001 | ICLP | Higher-Precision Groundness Analysis. | Michael Codish, Samir Genaim, Harald Sndergaard, Peter J. Stuckey |
| 2001 | LPAR | Inferring Termination Conditions for Logic Programs Using Backwards Analysis. | Samir Genaim, Michael Codish |
| 1997 | ICLP | Sharing Analysis Using Set Logic Programs. | Francisco Bueno, Michael Codish, Vitaly Lagoon |
| 1997 | ICLP | Efficient Goal Directed Bottom-up Evaluation of Logic Programs. | Michael Codish |
| 1997 | ICLP | XSB as the Natural Habitat for General Purpose Program Analysis. | Michael Codish, Bart Demoen, Konstantinos Sagonas |
| 1997 | SAS | An Algebraic Approach to Sharing Analysis of Logic Programs. | Michael Codish, Vitaly Lagoon, Francisco Bueno |
| 1994 | ICLP | Abstract Unification for a Composite Domain Deriving Sharing and Freeness Properties of Program Variables. | Maurice Bruynooghe, Michael Codish, Anne Mulkers |
| 1994 | ICLP | Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. | Michael Codish, Bart Demoen |
| 1994 | LPAR | Goal Dependent versus Goal Independent Analysis of Logic Programs. | Michael Codish, Maria J. Garca de la Banda, Maurice Bruynooghe, Manuel V. Hermenegildo |
| 1994 | SAS | Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. | Michael Codish, Bart Demoen |
| 1993 | ICALP | Efficient Analysis of Concurrent Constraint Logic Programs. | Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough |
| 1993 | ICLP | Freeness Analysis for Logic Programs - And Correctness? | Michael Codish, Dennis Dams, Gilberto Fil, Maurice Bruynooghe |
| 1993 | ICLP | Freeness Analysis in the Presence of Numerical Constraints. | Veroniek Dumortier, Gerda Janssens, Maurice Bruynooghe, Michael Codish |
| 1993 | PEPM | Improving Abstract Interpretations by Combining Domains. | Michael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. Garca de la Banda, Manuel V. Hermenegildo |
| 1993 | POPL | Compositional Analysis of Modular Logic Programs. | Michael Codish, Saumya K. Debray, Roberto Giacobazzi |
| 1993 | SAS | Freeness, Sharing, Linearity and Correctness - All at Once. | Maurice Bruynooghe, Michael Codish |
| 1992 | POPL | Modeling Prolog Control. | Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi |
| 1992 | SAS | Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs. | Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough |
| 1991 | ICLP | Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis. | Michael Codish, Dennis Dams, Eyal Yardeni |
| 1991 | ICLP | Suspension Analysis for Concurrent Logic Programs. | Michael Codish, Moreno Falaschi, Kim Marriott |
| 1991 | SAS | Modelling Prolog Control. | Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi |
| 1988 | LICS | Fully Abstract Denotational Semantics for Flat Concurrent Prolog | Rob Gerth, Michael Codish, Yossi Lichtenstein, Ehud Shapiro |
| 1986 | ICLP | Compiling OR-parallelism into AND-parallelism. | Michael Codish, Ehud Shapiro |