Michael Codish

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

Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann: SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs. J. Autom. Reasoning 49(1): 53-93 (2012)

Amit Metodi, Michael Codish: Compiling finite domain constraints to SAT with BEE. TPLP 12(4-5): 465-483 (2012)

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

Michael Codish: Programming with Boolean Satisfaction. FLOPS 2012: 1

Amit Metodi, Michael Codish: Compiling Finite Domain Constraints to SAT with BEE. CoRR abs/1206.3883 (2012)

Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl: SAT-based termination analysis using monotonicity constraints over the integers. TPLP 11(4-5): 503-520 (2011)

Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Boolean Equi-propagation for Optimized SAT Encoding. CP 2011: 621-636

Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp: Optimal Base Encodings for Pseudo-Boolean Constraints. TACAS 2011: 189-204

Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Boolean Equi-propagation for Optimized SAT Encoding. CoRR abs/1104.4617 (2011)

Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl: SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers. CoRR abs/1107.5980 (2011)

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

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

Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp: Optimal Base Encodings for Pseudo-Boolean Constraints. CoRR abs/1007.4935 (2010)

Olga Ohrimenko, Peter J. Stuckey, Michael Codish: Propagation via lazy clause generation. Constraints 14(3): 357-391 (2009)

Michael Codish, Samir Genaim, Peter J. Stuckey: A declarative encoding of telecommunications feature subscription in SAT. PPDP 2009: 255-266

Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Solving Partial Order Constraints for LPO Termination. JSAT 5(1-4): 193-215 (2008)

Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Logic programming with satisfiability. TPLP 8(1): 121-128 (2008)

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

Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Telecommunications Feature Subscription as a Partial Order Constraint Problem. ICLP 2008: 749-753

Amir M. Ben-Amram, Michael Codish: A SAT-Based Approach to Size Change Termination with Global Ranking Functions. TACAS 2008: 218-232

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

Olga Ohrimenko, Peter J. Stuckey, Michael Codish: Propagation = Lazy Clause Generation. CP 2007: 544-558

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

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

Michael Codish: Proving Termination with (Boolean) Satisfaction. LOPSTR 2007: 1-7

Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Logic Programming with Satisfiability. CoRR abs/cs/0702072 (2007)

Michael Codish, Vitaly Lagoon, Peter Schachte, Peter J. Stuckey: Size-Change Termination Analysis in k-Bits. ESOP 2006: 230-245

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

Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Solving Partial Order Constraints for LPO Termination. RTA 2006: 4-18

Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl: SAT Solving for Argument Filterings. CoRR abs/cs/0605074 (2006)

Samir Genaim, Michael Codish: Inferring Termination Conditions for Logic Programs using Backwards Analysis. TPLP 5(1-2): 75-91 (2005)

Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Testing for Termination with Monotonicity Constraints. ICLP 2005: 326-340

Michael Codish, Vitaly Lagoon, Peter J. Stuckey: Solving Partial Order Constraints for LPO Termination. CoRR abs/cs/0512067 (2005)

Michael Codish, Samir Genaim: Proving Termination One Loop at a Time. WLPE 2003: 48-59

Samir Genaim, Michael Codish: Inferring Termination Conditions for Logic Programs using Backwards Analysis. CoRR cs.PL/0312023 (2003)

Michael Codish, Harald Søndergaard: Meta-circular Abstract Interpretation in Prolog. The Essence of Computation 2002: 109-134

Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof: Reuse of Results in Termination Analysis of Typed Logic Programs. SAS 2002: 477-492

Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon: Combining Norms to Prove Termination. VMCAI 2002: 126-138

Samir Genaim, Jacob M. Howe, Michael Codish: Worst-case groundness analysis using definite boolean functions. TPLP 1(5): 611-615 (2001)

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

Samir Genaim, Michael Codish: The Def-inite Approach to Dependency Analysis. ESOP 2001: 417-432

Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey: Higher-Precision Groundness Analysis. ICLP 2001: 135-149

Samir Genaim, Michael Codish: Inferring Termination Conditions for Logic Programs Using Backwards Analysis. LPAR 2001: 685-694

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

Michael Codish, Kim Marriott, Cohavit Taboch: Improving Program Analyses, by Structure Untupling. J. Log. Program. 43(3): 251-263 (2000)

Andy Heaton, Muhamed Abo-Zaed, Michael Codish, Andy King: A simple polynomial groundness analysis for logic programs. J. Log. Program. 45(1-3): 143-156 (2000)

Michael Codish, Vitaly Lagoon: Type dependencies for logic programs using ACI-unification. Theor. Comput. Sci. 238(1-2): 131-159 (2000)

Michael Codish: Efficient Goal Directed Bottom-Up Evaluation of Logic Programs. J. Log. Program. 38(3): 355-370 (1999)

Michael Codish, Cohavit Taboch: A Semantic Basis for the Termination Analysis of Logic Programs. J. Log. Program. 41(1): 103-123 (1999)

Michael Codish: Worst-Case Groundness Analysis Using Positive Boolean Functions. J. Log. Program. 41(1): 125-128 (1999)

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

Michael Codish, Bart Demoen, Konstantinos F. Sagonas: Semantics-Based Program Analysis for Logic-Based Languages Using XSB. STTT 2(1): 29-45 (1998)

Michael Codish, Harald Søndergaard: The Boolean Logic of Set Sharing Analysis. PLILP/ALP 1998: 89-101

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

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

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

Michael Codish, Cohavit Taboch: A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints. ALP/HOA 1997: 31-45

Michael Codish, Bart Demoen, Konstantinos F. Sagonas: XSB as the Natural Habitat for General Purpose Program Analysis. ICLP 1997: 416

Francisco Bueno, Michael Codish, Vitaly Lagoon: Sharing Analysis Using Set Logic Programs. ICLP 1997: 417

Michael Codish: Efficient Goal Directed Bottom-up Evaluation of Logic Programs. ICLP 1997: 422

Michael Codish, Vitaly Lagoon, Francisco Bueno: An Algebraic Approach to Sharing Analysis of Logic Programs. SAS 1997: 68-82

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

Michael Codish, Grigory Mashevitzky: Proving Implications by Algebraic Approximation. Theor. Comput. Sci. 165(1): 57-74 (1996)

Michael Codish, Vitaly Lagoon, Francisco Bueno: Sharing Analysis for Logic Programs using Set Logic Programs. APPIA-GULP-PRODE 1996: 29-40

Michael Codish, Vitaly Lagoon: Type Dependencies for Logic Programs Using ACI-Unification. ISTCS 1996: 136-145

Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher: Oracle Semantics for Prolog. Inf. Comput. 122(2): 178-200 (1995)

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

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

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

Michael Codish, Dennis Dams, Eyal Yardeni: Bottom-up Abstract Interpretation of Logic Programs. Theor. Comput. Sci. 124(1): 93-125 (1994)

Michael Codish, Moreno Falaschi, Kim Marriott: Suspension Analyses for Concurrent Logic Programs. ACM Trans. Program. Lang. Syst. 16(3): 649-686 (1994)

Michael Codish, Bart Demoen: Deriving Polymorphic Type Dependencies for Logic Programs using Multiple Incarnations of Prop. GULP-PRODE (1) 1994: 327-341

Michael Codish, Grigory Mashevitzky: Proving Implications by Algebraic Approximation. ALP 1994: 6-22

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

Michael Codish, Bart Demoen: Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. SAS 1994: 281-296

Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi: Modelling Prolog Control. J. Log. Comput. 3(6): 579-603 (1993)

Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough: Efficient Analysis of Concurrent Constraint Logic Programs. ICALP 1993: 633-644

Veroniek Dumortier, Gerda Janssens, Maurice Bruynooghe, Michael Codish: Freeness Analysis in the Presence of Numerical Constraints. ICLP 1993: 100-115

Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe: Freeness Analysis for Logic Programs - And Correctness? ICLP 1993: 116-131

Michael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo: Improving Abstract Interpretations by Combining Domains. PEPM 1993: 194-205

Michael Codish, Saumya K. Debray, Roberto Giacobazzi: Compositional Analysis of Modular Logic Programs. POPL 1993: 451-464

Maurice Bruynooghe, Michael Codish: Freeness, Sharing, Linearity and Correctness - All at Once. WSA 1993: 153-164

Michael Codish, Bart Demoen: Analysing Logic Programs Using `Prop'-ositional Logic Programs and a Magic Wand. ILPS 1993: 114-129

Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher: Oracle Semantics for Prolog. ALP 1992: 100-114

Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi: Modeling Prolog Control. POPL 1992: 95-104

Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough: Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs. WSA 1992: 35-42

Michael Codish, Dennis Dams, Eyal Yardeni: Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis. ICLP 1991: 79-93

Michael Codish, Moreno Falaschi, Kim Marriott: Suspension Analysis for Concurrent Logic Programs. ICLP 1991: 331-345

Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi: Modelling Prolog Control. JTASPEFT/WSA 1991: 117-124

John P. Gallagher, Michael Codish, Ehud Y. Shapiro: Specialisation of Prolog and FCP Programs Using Abstract Interpretation. New Generation Comput. 6(2&3): 159-186 (1988)

Rob Gerth, Michael Codish, Yossi Lichtenstein, Ehud Y. Shapiro: Fully Abstract Denotational Semantics for Flat Concurrent Prolog. LICS 1988: 320-335

Michael Codish, John P. Gallagher, Ehud Y. Shapiro: Using Safe Approximations of Fixed Points for Analysis of Logic Programs. META 1988: 233-261

Michael Codish, Ehud Y. Shapiro: Compiling OR-parallelism into AND-parallelism. New Generation Comput. 5(1): 45-61 (1987)

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

Michael Codish, Ehud Y. Shapiro: Compiling OR-parallelism into AND-parallelism. ICLP 1986: 283-297