The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Michael Codish: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Codish, Dennis Dams, Eyal Yardeni
    Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis. [Citation Graph (1, 0)][DBLP]
    ICLP, 1991, pp:79-93 [Conf]
  2. Michael Codish, Dennis Dams, Eyal Yardeni
    Bottom-up Abstract Interpretation of Logic Programs. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:124, n:1, pp:93-125 [Journal]
  3. Michael Codish, Bart Demoen
    Deriving Polymorphic Type Dependencies for Logic Programs using Multiple Incarnations of Prop. [Citation Graph (0, 0)][DBLP]
    GULP-PRODE (1), 1994, pp:327-341 [Conf]
  4. Michael Codish, Vitaly Lagoon, Francisco Bueno
    Sharing Analysis for Logic Programs using Set Logic Programs. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1996, pp:29-40 [Conf]
  5. Michael Codish, Cohavit Taboch
    A Semantic Basis for Termination Analysis of Logic Programs and its Realization Using Symbolic Norm Constraints. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1997, pp:545-556 [Conf]
  6. Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher
    Oracle Semantics for Prolog. [Citation Graph (0, 0)][DBLP]
    ALP, 1992, pp:100-114 [Conf]
  7. Michael Codish, Grigory Mashevitzky
    Proving Implications by Algebraic Approximation. [Citation Graph (0, 0)][DBLP]
    ALP, 1994, pp:6-22 [Conf]
  8. Michael Codish, Cohavit Taboch
    A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints. [Citation Graph (0, 0)][DBLP]
    ALP/HOA, 1997, pp:31-45 [Conf]
  9. Michael Codish, Harald Søndergaard
    Meta-circular Abstract Interpretation in Prolog. [Citation Graph (0, 0)][DBLP]
    The Essence of Computation, 2002, pp:109-134 [Conf]
  10. Maurice Bruynooghe, Wim Vanhoof, Michael Codish
    Pos(T): Analyzing Dependencies in Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 2001, pp:406-420 [Conf]
  11. Samir Genaim, Michael Codish
    The Def-inite Approach to Dependency Analysis. [Citation Graph (0, 0)][DBLP]
    ESOP, 2001, pp:417-432 [Conf]
  12. Michael Codish, Vitaly Lagoon, Peter Schachte, Peter J. Stuckey
    Size-Change Termination Analysis in k-Bits. [Citation Graph (0, 0)][DBLP]
    ESOP, 2006, pp:230-245 [Conf]
  13. Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough
    Efficient Analysis of Concurrent Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:633-644 [Conf]
  14. Francisco Bueno, Michael Codish, Vitaly Lagoon
    Sharing Analysis Using Set Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1997, pp:417- [Conf]
  15. Michael Codish
    Efficient Goal Directed Bottom-up Evaluation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1997, pp:422- [Conf]
  16. Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe
    Freeness Analysis for Logic Programs - And Correctness? [Citation Graph (0, 0)][DBLP]
    ICLP, 1993, pp:116-131 [Conf]
  17. Michael Codish, Bart Demoen, Konstantinos F. Sagonas
    XSB as the Natural Habitat for General Purpose Program Analysis. [Citation Graph (0, 0)][DBLP]
    ICLP, 1997, pp:416- [Conf]
  18. Michael Codish, Moreno Falaschi, Kim Marriott
    Suspension Analysis for Concurrent Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:331-345 [Conf]
  19. Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey
    Higher-Precision Groundness Analysis. [Citation Graph (0, 0)][DBLP]
    ICLP, 2001, pp:135-149 [Conf]
  20. Michael Codish, Vitaly Lagoon, Peter J. Stuckey
    Testing for Termination with Monotonicity Constraints. [Citation Graph (0, 0)][DBLP]
    ICLP, 2005, pp:326-340 [Conf]
  21. Michael Codish, Ehud Y. Shapiro
    Compiling OR-parallelism into AND-parallelism. [Citation Graph (0, 0)][DBLP]
    ICLP, 1986, pp:283-297 [Conf]
  22. Veroniek Dumortier, Gerda Janssens, Maurice Bruynooghe, Michael Codish
    Freeness Analysis in the Presence of Numerical Constraints. [Citation Graph (0, 0)][DBLP]
    ICLP, 1993, pp:100-115 [Conf]
  23. Michael Codish, Vitaly Lagoon
    Type Dependencies for Logic Programs Using ACI-Unification. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:136-145 [Conf]
  24. Rob Gerth, Michael Codish, Yossi Lichtenstein, Ehud Y. Shapiro
    Fully Abstract Denotational Semantics for Flat Concurrent Prolog [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:320-335 [Conf]
  25. Michael Codish, Maria J. García de la Banda, Maurice Bruynooghe, Manuel V. Hermenegildo
    Goal Dependent versus Goal Independent Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPAR, 1994, pp:305-319 [Conf]
  26. Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl
    SAT Solving for Argument Filterings. [Citation Graph (0, 0)][DBLP]
    LPAR, 2006, pp:30-44 [Conf]
  27. Samir Genaim, Michael Codish
    Inferring Termination Conditions for Logic Programs Using Backwards Analysis. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:685-694 [Conf]
  28. Michael Codish, Samir Genaim
    Proving Termination One Loop at a Time. [Citation Graph (0, 0)][DBLP]
    WLPE, 2003, pp:48-59 [Conf]
  29. Michael Codish, John P. Gallagher, Ehud Y. Shapiro
    Using Safe Approximations of Fixed Points for Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    META, 1988, pp:233-261 [Conf]
  30. Michael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo
    Improving Abstract Interpretations by Combining Domains. [Citation Graph (0, 0)][DBLP]
    PEPM, 1993, pp:194-205 [Conf]
  31. Michael Codish, Harald Søndergaard
    The Boolean Logic of Set Sharing Analysis. [Citation Graph (0, 0)][DBLP]
    PLILP/ALP, 1998, pp:89-101 [Conf]
  32. Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi
    Modeling Prolog Control. [Citation Graph (0, 0)][DBLP]
    POPL, 1992, pp:95-104 [Conf]
  33. Michael Codish, Saumya K. Debray, Roberto Giacobazzi
    Compositional Analysis of Modular Logic Programs. [Citation Graph (0, 0)][DBLP]
    POPL, 1993, pp:451-464 [Conf]
  34. Michael Codish, Vitaly Lagoon, Peter J. Stuckey
    Solving Partial Order Constraints for LPO Termination. [Citation Graph (0, 0)][DBLP]
    RTA, 2006, pp:4-18 [Conf]
  35. Maurice Bruynooghe, Michael Codish
    Freeness, Sharing, Linearity and Correctness - All at Once. [Citation Graph (0, 0)][DBLP]
    WSA, 1993, pp:153-164 [Conf]
  36. Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof
    Reuse of Results in Termination Analysis of Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 2002, pp:477-492 [Conf]
  37. Michael Codish, Bart Demoen
    Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:281-296 [Conf]
  38. Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough
    Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:35-42 [Conf]
  39. Michael Codish, Vitaly Lagoon, Francisco Bueno
    An Algebraic Approach to Sharing Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 1997, pp:68-82 [Conf]
  40. Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi
    Modelling Prolog Control. [Citation Graph (0, 0)][DBLP]
    JTASPEFT/WSA, 1991, pp:117-124 [Conf]
  41. Michael Codish, Bart Demoen
    Analysing Logic Programs Using `Prop'-ositional Logic Programs and a Magic Wand. [Citation Graph (0, 0)][DBLP]
    ILPS, 1993, pp:114-129 [Conf]
  42. Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon
    Combining Norms to Prove Termination. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2002, pp:126-138 [Conf]
  43. Samir Genaim, Michael Codish
    Inferring Termination Conditions for Logic Programs using Backwards Analysis [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  44. Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher
    Oracle Semantics for Prolog. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:122, n:2, pp:178-200 [Journal]
  45. Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe
    On the Design of a Correct Freeness Analysis for Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1996, v:28, n:3, pp:181-206 [Journal]
  46. Michael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough
    A Confluent Semantic Basis for the Analysis of Concurrent Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1997, v:30, n:1, pp:53-81 [Journal]
  47. Michael Codish
    Efficient Goal Directed Bottom-Up Evaluation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1999, v:38, n:3, pp:355-370 [Journal]
  48. Michael Codish
    Worst-Case Groundness Analysis Using Positive Boolean Functions. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1999, v:41, n:1, pp:125-128 [Journal]
  49. Michael Codish, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo
    Exploiting Goal Independence in the Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1997, v:32, n:3, pp:247-261 [Journal]
  50. Michael Codish, Bart Demoen
    Analyzing Logic Programs Using "PROP"-ositional Logic Programs and a Magic Wand. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1995, v:25, n:3, pp:249-274 [Journal]
  51. Michael Codish, Vitaly Lagoon, Francisco Bueno
    An Algebraic Approach to Sharing Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 2000, v:42, n:2, pp:111-149 [Journal]
  52. Michael Codish, Kim Marriott, Cohavit Taboch
    Improving Program Analyses, by Structure Untupling. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 2000, v:43, n:3, pp:251-263 [Journal]
  53. Michael Codish, Cohavit Taboch
    A Semantic Basis for the Termination Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1999, v:41, n:1, pp:103-123 [Journal]
  54. Andy Heaton, Muhamed Abo-Zaed, Michael Codish, Andy King
    A simple polynomial groundness analysis for logic programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 2000, v:45, n:1-3, pp:143-156 [Journal]
  55. Leon Sterling, Michael Codish
    Pressing for Parallelism: A Prolog Program made Concurrent. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1986, v:3, n:1, pp:75-92 [Journal]
  56. Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Giorgio Levi
    Modelling Prolog Control. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1993, v:3, n:6, pp:579-603 [Journal]
  57. John P. Gallagher, Michael Codish, Ehud Y. Shapiro
    Specialisation of Prolog and FCP Programs Using Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1988, v:6, n:2&3, pp:159-186 [Journal]
  58. Michael Codish, Ehud Y. Shapiro
    Compiling OR-parallelism into AND-parallelism. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1987, v:5, n:1, pp:45-61 [Journal]
  59. Michael Codish, Bart Demoen, Konstantinos F. Sagonas
    Semantics-Based Program Analysis for Logic-Based Languages Using XSB. [Citation Graph (0, 0)][DBLP]
    STTT, 1998, v:2, n:1, pp:29-45 [Journal]
  60. Michael Codish, Vitaly Lagoon
    Type dependencies for logic programs using ACI-unification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:131-159 [Journal]
  61. Michael Codish, Grigory Mashevitzky
    Proving Implications by Algebraic Approximation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:165, n:1, pp:57-74 [Journal]
  62. Michael Codish, Moreno Falaschi, Kim Marriott
    Suspension Analyses for Concurrent Logic Programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1994, v:16, n:3, pp:649-686 [Journal]
  63. Michael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo
    Improving Abstract Interpretations by Combining Domains. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1995, v:17, n:1, pp:28-44 [Journal]
  64. Michael Codish, Harald Søndergaard, Peter J. Stuckey
    Sharing and groundness dependencies in logic programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1999, v:21, n:5, pp:948-976 [Journal]
  65. Samir Genaim, Michael Codish
    Inferring Termination Conditions for Logic Programs using Backwards Analysis. [Citation Graph (0, 0)][DBLP]
    TPLP, 2005, v:5, n:1-2, pp:75-91 [Journal]
  66. Samir Genaim, Jacob M. Howe, Michael Codish
    Worst-case groundness analysis using definite boolean functions. [Citation Graph (0, 0)][DBLP]
    TPLP, 2001, v:1, n:5, pp:611-615 [Journal]
  67. Olga Ohrimenko, Peter J. Stuckey, Michael Codish
    Propagation = Lazy Clause Generation. [Citation Graph (0, 0)][DBLP]
    CP, 2007, pp:544-558 [Conf]
  68. Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl
    Proving Termination Using Recursive Path Orders and SAT Solving. [Citation Graph (0, 0)][DBLP]
    FroCos, 2007, pp:267-282 [Conf]
  69. Michael Codish, Vitaly Lagoon, Peter J. Stuckey
    Logic Programming with Satisfiability [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  70. Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl
    SAT Solving for Argument Filterings [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  71. Maurice Bruynooghe, Michael Codish, John P. Gallagher, Samir Genaim, Wim Vanhoof
    Termination analysis of logic programs through combination of type-based norms. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2007, v:29, n:2, pp:- [Journal]

  72. Implementing RPO and POLO using SAT. [Citation Graph (, )][DBLP]


  73. Termination Analysis of Java Bytecode. [Citation Graph (, )][DBLP]


  74. Telecommunications Feature Subscription as a Partial Order Constraint Problem. [Citation Graph (, )][DBLP]


  75. Proving Termination with (Boolean) Satisfaction. [Citation Graph (, )][DBLP]


  76. A declarative encoding of telecommunications feature subscription in SAT. [Citation Graph (, )][DBLP]


  77. A SAT-Based Approach to Size Change Termination with Global Ranking Functions. [Citation Graph (, )][DBLP]


  78. Propagation via lazy clause generation. [Citation Graph (, )][DBLP]


  79. Solving Partial Order Constraints for LPO Termination [Citation Graph (, )][DBLP]


  80. Optimal Base Encodings for Pseudo-Boolean Constraints [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002