| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish |
Programming with Boolean Satisfaction.  |
FLOPS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey |
Boolean Equi-propagation for Optimized SAT Encoding  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl |
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl |
SAT-based termination analysis using monotonicity constraints over the integers.  |
TPLP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp |
Optimal Base Encodings for Pseudo-Boolean Constraints.  |
TACAS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey |
Boolean Equi-propagation for Optimized SAT Encoding.  |
CP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp |
Optimal Base Encodings for Pseudo-Boolean Constraints  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp |
Lazy Abstraction for Size-Change Termination.  |
LPAR (Yogyakarta)  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Moshe Zazon-Ivry |
Pairwise Cardinality Networks.  |
LPAR (Dakar)  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Olga Ohrimenko, Peter J. Stuckey, Michael Codish |
Propagation via lazy clause generation.  |
Constraints  |
2009 |
DBLP DOI BibTeX RDF |
Finite domain propagation, Boolean variables, SAT solver |
| 1 | Michael Codish, Samir Genaim, Peter J. Stuckey |
A declarative encoding of telecommunications feature subscription in SAT.  |
PPDP  |
2009 |
DBLP DOI BibTeX RDF |
sat solving, telecommunications feature subscription, declarative modelling |
| 1 | Michael Codish, Vitaly Lagoon, Peter J. Stuckey |
Solving Partial Order Constraints for LPO Termination.  |
JSAT  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Vitaly Lagoon, Peter J. Stuckey |
Logic programming with satisfiability.  |
TPLP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elvira Albert, Puri Arenas, Michael Codish, Samir Genaim, Germán Puebla, Damiano Zanardini |
Termination Analysis of Java Bytecode.  |
FMOODS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir M. Ben-Amram, Michael Codish |
A SAT-Based Approach to Size Change Termination with Global Ranking Functions.  |
TACAS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Vitaly Lagoon, Peter J. Stuckey |
Telecommunications Feature Subscription as a Partial Order Constraint Problem.  |
ICLP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2007 |
DBLP DOI BibTeX RDF |
program analysis, Abstract interpretation, dataflow analysis, termination analysis, global analysis, groundness analysis |
| 1 | Michael Codish, Vitaly Lagoon, Peter J. Stuckey |
Logic Programming with Satisfiability  |
CoRR  |
2007 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl |
Proving Termination Using Recursive Path Orders and SAT Solving.  |
FroCos  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish |
Proving Termination with (Boolean) Satisfaction.  |
LOPSTR  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Olga Ohrimenko, Peter J. Stuckey, Michael Codish |
Propagation = Lazy Clause Generation.  |
CP  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl |
SAT Solving for Argument Filterings  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl |
SAT Solving for Argument Filterings.  |
LPAR  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Vitaly Lagoon, Peter J. Stuckey |
Solving Partial Order Constraints for LPO Termination.  |
RTA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Vitaly Lagoon, Peter Schachte, Peter J. Stuckey |
Size-Change Termination Analysis in k-Bits.  |
ESOP  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Vitaly Lagoon, Peter J. Stuckey |
Solving Partial Order Constraints for LPO Termination  |
CoRR  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Samir Genaim, Michael Codish |
Inferring Termination Conditions for Logic Programs using Backwards Analysis.  |
TPLP  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Vitaly Lagoon, Peter J. Stuckey |
Testing for Termination with Monotonicity Constraints.  |
ICLP  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Genaim, Michael Codish |
Inferring Termination Conditions for Logic Programs using Backwards Analysis  |
CoRR  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Samir Genaim |
Proving Termination One Loop at a Time.  |
WLPE  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Harald Søndergaard |
Meta-circular Abstract Interpretation in Prolog.  |
The Essence of Computation ![In: The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday], pp. 109-134, 2002, Springer, 3-540-00326-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof |
Reuse of Results in Termination Analysis of Typed Logic Programs.  |
SAS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon |
Combining Norms to Prove Termination.  |
VMCAI  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Genaim, Jacob M. Howe, Michael Codish |
Worst-case groundness analysis using definite boolean functions.  |
TPLP  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurice Bruynooghe, Wim Vanhoof, Michael Codish |
Pos(T): Analyzing Dependencies in Typed Logic Programs.  |
Ershov Memorial Conference  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Genaim, Michael Codish |
Inferring Termination Conditions for Logic Programs Using Backwards Analysis.  |
LPAR  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey |
Higher-Precision Groundness Analysis.  |
ICLP  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Genaim, Michael Codish |
The Def-inite Approach to Dependency Analysis.  |
ESOP  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andy Heaton, Muhamed Abo-Zaed, Michael Codish, Andy King |
A simple polynomial groundness analysis for logic programs.  |
J. Log. Program.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Kim Marriott, Cohavit Taboch |
Improving Program Analyses, by Structure Untupling.  |
J. Log. Program.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Vitaly Lagoon, Francisco Bueno |
An Algebraic Approach to Sharing Analysis of Logic Programs.  |
J. Log. Program.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Vitaly Lagoon |
Type dependencies for logic programs using ACI-unification.  |
Theor. Comput. Sci.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Cohavit Taboch |
A Semantic Basis for the Termination Analysis of Logic Programs.  |
J. Log. Program.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish |
Efficient Goal Directed Bottom-Up Evaluation of Logic Programs.  |
J. Log. Program.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish |
Worst-Case Groundness Analysis Using Positive Boolean Functions.  |
J. Log. Program.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Harald Søndergaard, Peter J. Stuckey |
Sharing and groundness dependencies in logic programs.  |
ACM Trans. Program. Lang. Syst.  |
1999 |
DBLP DOI BibTeX RDF |
Boolean functions, program analysis, abstract interpretation, dataflow analysis, global analysis, groundness analysis, sharing analysis |
| 1 | Michael Codish, Bart Demoen, Konstantinos F. Sagonas |
Semantics-Based Program Analysis for Logic-Based Languages Using XSB.  |
STTT  |
1998 |
DBLP DOI BibTeX RDF |
Semantics-based program analysis, Logic programming language analysis, XSB |
| 1 | Michael Codish, Harald Søndergaard |
The Boolean Logic of Set Sharing Analysis.  |
PLILP/ALP  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough |
A Confluent Semantic Basis for the Analysis of Concurrent Constraint Logic Programs.  |
J. Log. Program.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Cohavit Taboch |
A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints.  |
ALP/HOA  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Cohavit Taboch |
A Semantic Basis for Termination Analysis of Logic Programs and its Realization Using Symbolic Norm Constraints.  |
APPIA-GULP-PRODE  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish |
Efficient Goal Directed Bottom-up Evaluation of Logic Programs.  |
ICLP  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Francisco Bueno, Michael Codish, Vitaly Lagoon |
Sharing Analysis Using Set Logic Programs.  |
ICLP  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Bart Demoen, Konstantinos F. Sagonas |
XSB as the Natural Habitat for General Purpose Program Analysis.  |
ICLP  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Vitaly Lagoon, Francisco Bueno |
An Algebraic Approach to Sharing Analysis of Logic Programs.  |
SAS  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe |
On the Design of a Correct Freeness Analysis for Logic Programs.  |
J. Log. Program.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Grigory Mashevitzky |
Proving Implications by Algebraic Approximation.  |
Theor. Comput. Sci.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Vitaly Lagoon, Francisco Bueno |
Sharing Analysis for Logic Programs using Set Logic Programs.  |
APPIA-GULP-PRODE  |
1996 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Vitaly Lagoon |
Type Dependencies for Logic Programs Using ACI-Unification.  |
ISTCS  |
1996 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Bart Demoen |
Analyzing Logic Programs Using "PROP"-ositional Logic Programs and a Magic Wand.  |
J. Log. Program.  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher |
Oracle Semantics for Prolog.  |
Inf. Comput.  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
1995 |
DBLP DOI BibTeX RDF |
logic programming, program analysis, abstract interpretation |
| 1 | Maurice Bruynooghe, Michael Codish, Anne Mulkers |
Abstracting Unification: A Key Step in the Design of Logic Program Analyses.  |
Computer Science Today  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Dennis Dams, Eyal Yardeni |
Bottom-up Abstract Interpretation of Logic Programs.  |
Theor. Comput. Sci.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Moreno Falaschi, Kim Marriott |
Suspension Analyses for Concurrent Logic Programs.  |
ACM Trans. Program. Lang. Syst.  |
1994 |
DBLP DOI BibTeX RDF |
program analysis, abstract interpretation, concurrent logic programming |
| 1 | Michael Codish, Grigory Mashevitzky |
Proving Implications by Algebraic Approximation.  |
ALP  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Bart Demoen |
Deriving Polymorphic Type Dependencies for Logic Programs using Multiple Incarnations of Prop.  |
GULP-PRODE  |
1994 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Bart Demoen |
Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop.  |
SAS  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi |
Modelling Prolog Control.  |
J. Log. Comput.  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough |
Efficient Analysis of Concurrent Constraint Logic Programs.  |
ICALP  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe |
Freeness Analysis for Logic Programs - And Correctness?  |
ICLP  |
1993 |
DBLP BibTeX RDF |
|
| 1 | Veroniek Dumortier, Gerda Janssens, Maurice Bruynooghe, Michael Codish |
Freeness Analysis in the Presence of Numerical Constraints.  |
ICLP  |
1993 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo |
Improving Abstract Interpretations by Combining Domains.  |
PEPM  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Saumya K. Debray, Roberto Giacobazzi |
Compositional Analysis of Modular Logic Programs.  |
POPL  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Bart Demoen |
Analysing Logic Programs Using `Prop'-ositional Logic Programs and a Magic Wand.  |
ILPS  |
1993 |
DBLP BibTeX RDF |
|
| 1 | Maurice Bruynooghe, Michael Codish |
Freeness, Sharing, Linearity and Correctness - All at Once.  |
WSA  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher |
Oracle Semantics for Prolog.  |
ALP  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi |
Modeling Prolog Control.  |
POPL  |
1992 |
DBLP DOI BibTeX RDF |
Prolog |
| 1 | Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough |
Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs.  |
WSA  |
1992 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Moreno Falaschi, Kim Marriott |
Suspension Analysis for Concurrent Logic Programs.  |
ICLP  |
1991 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Dennis Dams, Eyal Yardeni |
Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis.  |
ICLP  |
1991 |
DBLP BibTeX RDF |
|
| 1 | Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi |
Modelling Prolog Control.  |
JTASPEFT/WSA  |
1991 |
DBLP BibTeX RDF |
|
| 1 | John P. Gallagher, Michael Codish, Ehud Y. Shapiro |
Specialisation of Prolog and FCP Programs Using Abstract Interpretation.  |
New Generation Comput.  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, John P. Gallagher, Ehud Y. Shapiro |
Using Safe Approximations of Fixed Points for Analysis of Logic Programs.  |
META  |
1988 |
DBLP BibTeX RDF |
|
| 1 | Rob Gerth, Michael Codish, Yossi Lichtenstein, Ehud Y. Shapiro |
Fully Abstract Denotational Semantics for Flat Concurrent Prolog  |
LICS  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Ehud Y. Shapiro |
Compiling OR-parallelism into AND-parallelism.  |
New Generation Comput.  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Leon Sterling, Michael Codish |
Pressing for Parallelism: A Prolog Program made Concurrent.  |
J. Log. Program.  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Codish, Ehud Y. Shapiro |
Compiling OR-parallelism into AND-parallelism.  |
ICLP  |
1986 |
DBLP DOI BibTeX RDF |
|