Michael Codish

148 papers A* 10A 9B 20C 5Misc 5Journal 69Unranked 29

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Breaking Symmetries from a Set-Covering Perspective. CPAIOR (1) Michael Codish, Mikolás Janota
2025	J	`jnl`	Breaking Symmetries from a Set-Covering Perspective. CoRR Michael Codish, Mikolás Janota
2025	A	`conf`	Breaking Symmetries with Involutions. CP Michael Codish, Mikolás Janota
2025	J	`jnl`	Breaking Symmetries with Involutions. CoRR Michael Codish, Mikolás Janota
2025	A*	`conf`	Complete Symmetry Breaking for Finite Models. AAAI Marek Danco, Mikolás Janota, Michael Codish, João Jorge Araújo
2025	J	`jnl`	Complete Symmetry Breaking for Finite Models. CoRR Marek Danco, Mikolás Janota, Michael Codish, João Araújo
2025	J	`jnl`	SAT-Based Techniques for Lexicographically Smallest Finite Models. CoRR Mikolás Janota, Choiwah Chow, João Araújo, Michael Codish, Petr Vojtechovský
2024	A*	`conf`	SAT-Based Techniques for Lexicographically Smallest Finite Models. AAAI Mikolás Janota, Choiwah Chow, João Araújo, Michael Codish, Petr Vojtechovský
2023	B	`conf`	Breaking Symmetries with High Dimensional Graph Invariants and Their Combination. CPAIOR Avraham Itzhakov, Michael Codish
2022	J	`jnl`	Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs. Constraints An Int. J. Avraham Itzhakov, Michael Codish
2020	A*	`conf`	Incremental Symmetry Breaking Constraints for Graph Search Problems. AAAI Avraham Itzhakov, Michael Codish
2019	J	`jnl`	Constraints for symmetry breaking in graph representation. Constraints An Int. J. Michael Codish, Alice Miller, Patrick Prosser, Peter J. Stuckey
2019	J	`jnl`	Sorting networks: To the end and back again. J. Comput. Syst. Sci. Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp
2018	J	`jnl`	A SAT Encoding for the n-Fractions Problem. CoRR Michael Codish
2018	Misc	`conf`	Breaking Symmetries with Lex Implications. FLOPS Michael Codish, Thorsten Ehlers, Graeme Gange, Avraham Itzhakov, Peter J. Stuckey
2018	Misc	`conf`	SAT-Based Big-Step Local Search. SYNASC Morad Muslimany, Michael Codish
2017	—	`conf`	Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description). ICLP (Technical Communications) Michael Codish, Michael Frank, Amit Metodi, Morad Muslimany
2017	J	`jnl`	Optimal-depth sorting networks. J. Comput. Syst. Sci. Daniel Bundala, Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp, Jakub Závodný
2017	J	`jnl`	Optimizing sorting algorithms by using sorting networks. Formal Aspects Comput. Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp
2017	A*	`conf`	The DNA Word Design Problem: A New Constraint Model and New Results. IJCAI Michael Codish, Michael Frank, Vitaly Lagoon
2016	A	`conf`	Breaking Symmetries in Graphs: The Nauty Way. CP Michael Codish, Graeme Gange, Avraham Itzhakov, Peter J. Stuckey
2016	J	`jnl`	Breaking symmetries in graph search with canonizing sets. Constraints An Int. J. Avraham Itzhakov, Michael Codish
2016	J	`jnl`	Computing the Ramsey number R(4, 3, 3) using abstraction and symmetry breaking. Constraints An Int. J. Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller
2016	J	`jnl`	Logic Programming with Graph Automorphism: Integrating naut with Prolog (a Tool Paper). CoRR Michael Frank, Michael Codish
2016	J	`jnl`	Logic Programming with Graph Automorphism: Integrating nauty with Prolog (Tool Description). Theory Pract. Log. Program. Michael Frank, Michael Codish
2016	J	`jnl`	Preface for special section from FLOPS 2014. J. Funct. Program. Michael Codish, Eijiro Sumii
2016	J	`jnl`	Sorting nine inputs requires twenty-five comparisons. J. Comput. Syst. Sci. Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp
2015	C	`conf`	Applying Sorting Networks to Synthesize Optimized Sorting Libraries. LOPSTR Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp
2015	J	`jnl`	Applying Sorting Networks to Synthesize Optimized Sorting Libraries. CoRR Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp
2015	J	`jnl`	Breaking Symmetries in Graph Search with Canonizing Sets. CoRR Avraham Itzhakov, Michael Codish
2015	J	`jnl`	Computing the Ramsey Number R(4, 3, 3) using Abstraction and Symmetry breaking. CoRR Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller
2015	C	`conf`	Sorting Networks: The End Game. LATA Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp
2015	J	`jnl`	Sorting Networks: to the End and Back Again. CoRR Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp
2015	J	`jnl`	When Six Gates are Not Enough. CoRR Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp
2014	J	`jnl`	A Novel SAT-Based Approach to Model Based Diagnosis. J. Artif. Intell. Res. Amit Metodi, Roni Stern, Meir Kalech, Michael Codish
2014	J	`jnl`	Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems. CoRR Amit Metodi, Michael Codish, Peter James Stuckey
2014	Misc	`ed.`	Functional and Logic Programming - 12th International Symposium, FLOPS 2014, Kanazawa, Japan, June 4-6, 2014. Proceedings FLOPS Michael Codish, Eijiro Sumii
2014	J	`jnl`	Optimal-Depth Sorting Networks. CoRR Daniel Bundala, Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp, Jakub Závodný
2014	A	`conf`	Simplifying Pseudo-Boolean Constraints in Residual Number Systems. SAT Yoav Fekete, Michael Codish
2014	J	`jnl`	Solving Graph Coloring Problems with Abstraction and Symmetry: the Ramsey Number R(4, 3, 3)=30. CoRR Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller
2014	J	`jnl`	Sorting Networks: the End Game. CoRR Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp
2014	Misc	`conf`	The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes. SYNASC Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp
2014	J	`jnl`	The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes. CoRR Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp
2014	B	`conf`	Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten). ICTAI Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp
2014	J	`jnl`	Twenty-Five Comparators is Optimal when Sorting Nine Inputs (and Twenty-Nine for Ten). CoRR Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp
2013	—	`conf`	Backbones for Equality. Haifa Verification Conference Michael Codish, Yoav Fekete, Amit Metodi
2013	J	`jnl`	Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems. J. Artif. Intell. Res. Amit Metodi, Michael Codish, Peter J. Stuckey
2013	A*	`conf`	Breaking Symmetries in Graph Representation. IJCAI Michael Codish, Alice Miller, Patrick Prosser, Peter James Stuckey
2013	J	`jnl`	Compiling Finite Domain Constraints to SAT with BEE: the Director's Cut. CoRR Michael Codish, Yoav Fekete, Amit Metodi
2012	J	`jnl`	Compiling Finite Domain Constraints to SAT with BEE CoRR Amit Metodi, Michael Codish
2012	A*	`conf`	Compiling Model-Based Diagnosis to Boolean Satisfaction. AAAI Amit Metodi, Roni Stern, Meir Kalech, Michael Codish
2012	J	`jnl`	Compiling finite domain constraints to SAT with BEE. Theory Pract. Log. Program. Amit Metodi, Michael Codish
2012	—	`conf`	Exotic Semi-Ring Constraints. SMT@IJCAR Michael Codish, Yoav Fekete, Carsten Fuhs, Jürgen Giesl, Johannes Waldmann
2012	Misc	`conf`	Programming with Boolean Satisfaction. FLOPS Michael Codish
2012	J	`jnl`	SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs. J. Autom. Reason. Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann
2011	J	`jnl`	Boolean Equi-propagation for Optimized SAT Encoding CoRR Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey
2011	A	`conf`	Boolean Equi-propagation for Optimized SAT Encoding. CP Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey
2011	A	`conf`	Optimal Base Encodings for Pseudo-Boolean Constraints. TACAS Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp
2011	J	`jnl`	SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers CoRR Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl
2011	J	`jnl`	SAT-based termination analysis using monotonicity constraints over the integers. Theory Pract. Log. Program. Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl
2010	—	`conf`	Lazy Abstraction for Size-Change Termination. LPAR (Yogyakarta) Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp
2010	J	`jnl`	Optimal Base Encodings for Pseudo-Boolean Constraints CoRR Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp
2010	—	`conf`	Pairwise Cardinality Networks. LPAR (Dakar) Michael Codish, Moshe Zazon-Ivry
2009	C	`conf`	A declarative encoding of telecommunications feature subscription in SAT. PPDP Michael Codish, Samir Genaim, Peter J. Stuckey
2009	J	`jnl`	Propagation via lazy clause generation. Constraints An Int. J. Olga Ohrimenko, Peter J. Stuckey, Michael Codish
2008	A	`conf`	A SAT-Based Approach to Size Change Termination with Global Ranking Functions. TACAS Amir M. Ben-Amram, Michael Codish
2008	J	`jnl`	Logic programming with satisfiability. Theory Pract. Log. Program. Michael Codish, Vitaly Lagoon, Peter J. Stuckey
2008	J	`jnl`	Solving Partial Order Constraints for LPO Termination. J. Satisf. Boolean Model. Comput. Michael Codish, Vitaly Lagoon, Peter J. Stuckey
2008	B	`conf`	Telecommunications Feature Subscription as a Partial Order Constraint Problem. ICLP Michael Codish, Vitaly Lagoon, Peter J. Stuckey
2008	—	`conf`	Termination Analysis of Java Bytecode. FMOODS Elvira Albert, Puri Arenas, Michael Codish, Samir Genaim, Germán Puebla, Damiano Zanardini
2007	—	`conf`	Implementing RPO and POLO using SAT. Deduction and Decision Procedures Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl
2007	J	`jnl`	Logic Programming with Satisfiability CoRR Michael Codish, Vitaly Lagoon, Peter J. Stuckey
2007	A	`conf`	Propagation = Lazy Clause Generation. CP Olga Ohrimenko, Peter J. Stuckey, Michael Codish
2007	—	`conf`	Proving Termination Using Recursive Path Orders and SAT Solving. FroCoS Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl
2007	C	`conf`	Proving Termination with (Boolean) Satisfaction. LOPSTR Michael Codish
2007	J	`jnl`	Termination analysis of logic programs through combination of type-based norms. ACM Trans. Program. Lang. Syst. Maurice Bruynooghe, Michael Codish, John P. Gallagher, Samir Genaim, Wim Vanhoof
2006	J	`jnl`	SAT Solving for Argument Filterings CoRR Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl
2006	B	`conf`	SAT Solving for Argument Filterings. LPAR Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl
2006	A	`conf`	Size-Change Termination Analysis in ESOP Michael Codish, Vitaly Lagoon, Peter Schachte, Peter J. Stuckey
2006	—	`conf`	Solving Partial Order Constraints for LPO Termination. RTA Michael Codish, Vitaly Lagoon, Peter J. Stuckey
2005	J	`jnl`	Inferring Termination Conditions for Logic Programs using Backwards Analysis. Theory Pract. Log. Program. Samir Genaim, Michael Codish
2005	J	`jnl`	Solving Partial Order Constraints for LPO Termination CoRR Michael Codish, Vitaly Lagoon, Peter J. Stuckey
2005	B	`conf`	Testing for Termination with Monotonicity Constraints. ICLP Michael Codish, Vitaly Lagoon, Peter J. Stuckey
2003	J	`jnl`	Inferring Termination Conditions for Logic Programs using Backwards Analysis CoRR Samir Genaim, Michael Codish
2003	—	`conf`	Proving Termination One Loop at a Time. WLPE Michael Codish, Samir Genaim
2002	B	`conf`	Combining Norms to Prove Termination. VMCAI Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon
2002	—	`conf`	Meta-circular Abstract Interpretation in Prolog. The Essence of Computation Michael Codish, Harald Søndergaard
2002	B	`conf`	Reuse of Results in Termination Analysis of Typed Logic Programs. SAS Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof
2001	B	`conf`	Higher-Precision Groundness Analysis. ICLP Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey
2001	B	`conf`	Inferring Termination Conditions for Logic Programs Using Backwards Analysis. LPAR Samir Genaim, Michael Codish
2001	—	`conf`	Inferring termination conditions for logic programs using backwards analysis. APPIA-GULP-PRODE Samir Genaim, Michael Codish
2001	—	`conf`	Pos(T): Analyzing Dependencies in Typed Logic Programs. Ershov Memorial Conference Maurice Bruynooghe, Wim Vanhoof, Michael Codish
2001	A	`conf`	The Def-inite Approach to Dependency Analysis. ESOP Samir Genaim, Michael Codish
2001	J	`jnl`	Worst-case groundness analysis using definite boolean functions. Theory Pract. Log. Program. Samir Genaim, Jacob M. Howe, Michael Codish
2000	J	`jnl`	A simple polynomial groundness analysis for logic programs. J. Log. Program. Andy Heaton, Muhamed Abo-Zaed, Michael Codish, Andy King
2000	J	`jnl`	An Algebraic Approach to Sharing Analysis of Logic Programs. J. Log. Program. Michael Codish, Vitaly Lagoon, Francisco Bueno
2000	J	`jnl`	Improving Program Analyses, by Structure Untupling. J. Log. Program. Michael Codish, Kim Marriott, Cohavit Taboch
2000	J	`jnl`	Type dependencies for logic programs using ACI-unification. Theor. Comput. Sci. Michael Codish, Vitaly Lagoon
1999	J	`jnl`	A Semantic Basis for the Termination Analysis of Logic Programs. J. Log. Program. Michael Codish, Cohavit Taboch
1999	J	`jnl`	Efficient Goal Directed Bottom-Up Evaluation of Logic Programs. J. Log. Program. Michael Codish
1999	J	`jnl`	Sharing and groundness dependencies in logic programs. ACM Trans. Program. Lang. Syst. Michael Codish, Harald Søndergaard, Peter J. Stuckey
1999	J	`jnl`	Worst-Case Groundness Analysis Using Positive Boolean Functions. J. Log. Program. Michael Codish
1998	J	`jnl`	Semantics-Based Program Analysis for Logic-Based Languages Using XSB. Int. J. Softw. Tools Technol. Transf. Michael Codish, Bart Demoen, Konstantinos Sagonas
1998	—	`conf`	The Boolean Logic of Set Sharing Analysis. PLILP/ALP Michael Codish, Harald Søndergaard
1997	J	`jnl`	A Confluent Semantic Basis for the Analysis of Concurrent Constraint Logic Programs. J. Log. Program. Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough
1997	—	`conf`	A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints. ALP/HOA Michael Codish, Cohavit Taboch
1997	—	`conf`	A Semantic Basis for Termination Analysis of Logic Programs and its Realization Using Symbolic Norm Constraints. APPIA-GULP-PRODE Michael Codish, Cohavit Taboch
1997	B	`conf`	An Algebraic Approach to Sharing Analysis of Logic Programs. SAS Michael Codish, Vitaly Lagoon, Francisco Bueno
1997	B	`conf`	Efficient Goal Directed Bottom-up Evaluation of Logic Programs. ICLP Michael Codish
1997	J	`jnl`	Exploiting Goal Independence in the Analysis of Logic Programs. J. Log. Program. Michael Codish, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo
1997	B	`conf`	Sharing Analysis Using Set Logic Programs. ICLP Francisco Bueno, Michael Codish, Vitaly Lagoon
1997	B	`conf`	XSB as the Natural Habitat for General Purpose Program Analysis. ICLP Michael Codish, Bart Demoen, Konstantinos Sagonas
1996	J	`jnl`	On the Design of a Correct Freeness Analysis for Logic Programs. J. Log. Program. Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe
1996	J	`jnl`	Proving Implications by Algebraic Approximation. Theor. Comput. Sci. Michael Codish, Grigory Mashevitzky
1996	—	`conf`	Sharing Analysis for Logic Programs using Set Logic Programs. APPIA-GULP-PRODE Michael Codish, Vitaly Lagoon, Francisco Bueno
1996	—	`conf`	Type Dependencies for Logic Programs Using ACI-Unification. ISTCS Michael Codish, Vitaly Lagoon
1995	—	`ch.`	Abstracting Unification: A Key Step in the Design of Logic Program Analyses. Computer Science Today Maurice Bruynooghe, Michael Codish, Anne Mulkers
1995	J	`jnl`	Analyzing Logic Programs Using " J. Log. Program. Michael Codish, Bart Demoen
1995	J	`jnl`	Improving Abstract Interpretations by Combining Domains. ACM Trans. Program. Lang. Syst. Michael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo
1995	J	`jnl`	Oracle Semantics for Prolog. Inf. Comput. Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher
1994	—	`conf`	Abstract Unification for a Composite Domain Deriving Sharing and Freeness Properties of Program Variables. ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages Maurice Bruynooghe, Michael Codish, Anne Mulkers
1994	J	`jnl`	Bottom-up Abstract Interpretation of Logic Programs. Theor. Comput. Sci. Michael Codish, Dennis Dams, Eyal Yardeni
1994	—	`conf`	Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages Michael Codish, Bart Demoen
1994	B	`conf`	Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. SAS Michael Codish, Bart Demoen
1994	—	`conf`	Deriving Polymorphic Type Dependencies for Logic Programs using Multiple Incarnations of Prop. GULP-PRODE (1) Michael Codish, Bart Demoen
1994	B	`conf`	Goal Dependent versus Goal Independent Analysis of Logic Programs. LPAR Michael Codish, Maria J. García de la Banda, Maurice Bruynooghe, Manuel V. Hermenegildo
1994	—	`conf`	Proving Implications by Algebraic Approximation. ALP Michael Codish, Grigory Mashevitzky
1994	J	`jnl`	Suspension Analyses for Concurrent Logic Programs. ACM Trans. Program. Lang. Syst. Michael Codish, Moreno Falaschi, Kim Marriott
1993	—	`conf`	Analysing Logic Programs Using 'Prop'-ositional Logic Programs and a Magic Wand. ILPS Michael Codish, Bart Demoen
1993	A*	`conf`	Compositional Analysis of Modular Logic Programs. POPL Michael Codish, Saumya K. Debray, Roberto Giacobazzi
1993	A*	`conf`	Efficient Analysis of Concurrent Constraint Logic Programs. ICALP Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough
1993	B	`conf`	Freeness Analysis for Logic Programs - And Correctness? ICLP Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe
1993	B	`conf`	Freeness Analysis in the Presence of Numerical Constraints. ICLP Veroniek Dumortier, Gerda Janssens, Maurice Bruynooghe, Michael Codish
1993	—	`conf`	Freeness, Sharing, Linearity and Correctness - All at Once. WSA Maurice Bruynooghe, Michael Codish
1993	C	`conf`	Improving Abstract Interpretations by Combining Domains. PEPM Michael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo
1993	J	`jnl`	Modelling Prolog Control. J. Log. Comput. Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi
1992	—	`conf`	Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs. WSA Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough
1992	A*	`conf`	Modeling Prolog Control. POPL Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi
1992	—	`conf`	Oracle Semantics for Prolog. ALP Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher
1991	B	`conf`	Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis. ICLP Michael Codish, Dennis Dams, Eyal Yardeni
1991	—	`conf`	Modelling Prolog Control. JTASPEFT/WSA Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi
1991	B	`conf`	Suspension Analysis for Concurrent Logic Programs. ICLP Michael Codish, Moreno Falaschi, Kim Marriott
1988	A*	`conf`	Fully Abstract Denotational Semantics for Flat Concurrent Prolog LICS Rob Gerth, Michael Codish, Yossi Lichtenstein, Ehud Shapiro
1988	J	`jnl`	Specialisation of Prolog and FCP Programs Using Abstract Interpretation. New Gener. Comput. John P. Gallagher, Michael Codish, Ehud Shapiro
1988	—	`conf`	Using Safe Approximations of Fixed Points for Analysis of Logic Programs. META Michael Codish, John P. Gallagher, Ehud Shapiro
1987	J	`jnl`	Compiling OR-parallelism into AND-parallelism. New Gener. Comput. Michael Codish, Ehud Shapiro
1986	B	`conf`	Compiling OR-parallelism into AND-parallelism. ICLP Michael Codish, Ehud Shapiro
1986	J	`jnl`	Pressing for Parallelism: A Prolog Program made Concurrent. J. Log. Program. Leon Sterling, Michael Codish