Travelled to:1 × Canada
1 × Cyprus
1 × Germany
1 × Japan
1 × Portugal
1 × Sweden
2 × Austria
2 × Belgium
2 × Denmark
2 × Hungary
3 × France
3 × Spain
3 × USA
4 × United Kingdom
6 × Italy
Collaborated with:V.Lagoon P.J.Stuckey S.Genaim ∅ M.Bruynooghe B.Demoen R.Giacobazzi Y.Fekete M.Falaschi K.Marriott H.Søndergaard R.Barbuti E.Y.Shapiro A.M.Ben-Amram F.Bueno C.Fuhs P.Schneider-Kamp D.Dams A.Metodi C.Taboch G.Mashevitzky W.H.Winsborough G.Levi J.Giesl L.Cruz-Filipe K.F.Sagonas S.K.Debray E.Yardeni P.Schachte W.Vanhoof J.P.Gallagher G.Filé V.Dumortier G.Janssens M.J.Maher R.Gerth Y.Lichtenstein J.Waldmann I.Gonopolskiy A.Mulkers M.J.G.d.l.Banda M.V.Hermenegildo
Talks about:analysi (17) program (15) logic (14) constraint (12) termin (9) boolean (5) use (5) concurr (4) prolog (4) share (4)
Person: Michael Codish
DBLP: Codish:Michael
Facilitated 1 volumes:
EdContributed to:
2015
20142012
2012
20122011
2011
200920082008
2007
2006
20062005
2002
200220012001199819971997199719941994
199319931993
1993
1993199319921992199219911991
19881986Wrote 41 papers:
- LATA-2015-CodishCS #game studies #network #sorting
- Sorting Networks: The End Game (MC, LCF, PSK), pp. 664–675.
- SAT-2014-FeketeC #constraints #pseudo
- Simplifying Pseudo-Boolean Constraints in Residual Number Systems (YF, MC), pp. 351–366.
- FLOPS-2012-Codish #programming
- Programming with Boolean Satisfaction (MC), p. 1.
- ICLP-J-2012-MetodiC #compilation #constraints #finite #satisfiability
- Compiling finite domain constraints to SAT with BEE (AM, MC), pp. 465–483.
- SMT-2012-CodishFFGW #constraints
- Exotic Semi-Ring Constraints (MC, YF, CF, JG, JW), pp. 88–97.
- ICLP-J-2011-CodishGBFG #analysis #constraints #integer #satisfiability #termination #using
- SAT-based termination analysis using monotonicity constraints over the integers (MC, IG, AMBA, CF, JG), pp. 503–520.
- TACAS-2011-CodishFFS #constraints #encoding #pseudo
- Optimal Base Encodings for Pseudo-Boolean Constraints (MC, YF, CF, PSK), pp. 189–204.
- PPDP-2009-CodishGS #declarative #encoding #satisfiability
- A declarative encoding of telecommunications feature subscription in SAT (MC, SG, PJS), pp. 255–266.
- ICLP-2008-CodishLS #constraints #partial order #problem
- Telecommunications Feature Subscription as a Partial Order Constraint Problem (MC, VL, PJS), pp. 749–753.
- TACAS-2008-Ben-AmramC #approach #ranking #satisfiability #termination
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions (AMBA, MC), pp. 218–232.
- LOPSTR-2007-Codish #proving #termination
- Proving Termination with (Boolean) Satisfaction (MC), pp. 1–7.
- ESOP-2006-CodishLSS #analysis #termination
- Size-Change Termination Analysis in k-Bits (MC, VL, PS, PJS), pp. 230–245.
- RTA-2006-CodishLS #constraints #partial order #termination
- Solving Partial Order Constraints for LPO Termination (MC, VL, PJS), pp. 4–18.
- ICLP-2005-CodishLS #constraints #termination #testing
- Testing for Termination with Monotonicity Constraints (MC, VL, PJS), pp. 326–340.
- SAS-2002-BruynoogheCGV #analysis #logic programming #reuse #source code #termination #using
- Reuse of Results in Termination Analysis of Typed Logic Programs (MB, MC, SG, WV), pp. 477–492.
- VMCAI-2002-GenaimCGL #termination
- Combining Norms to Prove Termination (SG, MC, JPG, VL), pp. 126–138.
- ESOP-2001-GenaimC #analysis #approach #dependence
- The Def-inite Approach to Dependency Analysis (SG, MC), pp. 417–432.
- ICLP-2001-CodishGSS #analysis
- Higher-Precision Groundness Analysis (MC, SG, HS, PJS), pp. 135–149.
- ALP-PLILP-1998-CodishS #analysis #logic #set
- The Boolean Logic of Set Sharing Analysis (MC, HS), pp. 89–101.
- ALP-1997-CodishT #analysis #constraints #logic programming #semantics #source code #termination #using
- A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints (MC, CT), pp. 31–45.
- ICLP-1997-BuenoCL #analysis #logic programming #set #source code #using
- Sharing Analysis Using Set Logic Programs (FB, MC, VL), p. 417.
- ICLP-1997-Codish #bottom-up #evaluation #logic programming #performance #source code
- Efficient Goal Directed Bottom-up Evaluation of Logic Programs (MC), p. 422.
- ICLP-1997-CodishDS #program analysis
- XSB as the Natural Habitat for General Purpose Program Analysis (MC, BD, KFS), p. 416.
- SAS-1997-CodishLB #algebra #analysis #approach #logic programming #source code
- An Algebraic Approach to Sharing Analysis of Logic Programs (MC, VL, FB), pp. 68–82.
- ALP-1994-CodishM #algebra #approximate #proving
- Proving Implications by Algebraic Approximation (MC, GM), pp. 6–22.
- SAS-1994-CodishD #dependence #logic programming #multi #polymorphism #source code #using
- Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop (MC, BD), pp. 281–296.
- ICALP-1993-CodishFMW #analysis #concurrent #constraints #logic programming #performance #source code
- Efficient Analysis of Concurrent Constraint Logic Programs (MC, MF, KM, WHW), pp. 633–644.
- ICLP-1993-CodishDFB #analysis #correctness #logic programming #question #source code
- Freeness Analysis for Logic Programs — And Correctness? (MC, DD, GF, MB), pp. 116–131.
- ICLP-1993-DumortierJBC #analysis #constraints
- Freeness Analysis in the Presence of Numerical Constraints (VD, GJ, MB, MC), pp. 100–115.
- ILPS-1993-CodishD #logic programming #source code #using
- Analysing Logic Programs Using “Prop”-ositional Logic Programs and a Magic Wand (MC, BD), pp. 114–129.
- PEPM-1993-CodishMBBH #abstract interpretation
- Improving Abstract Interpretations by Combining Domains (MC, AM, MB, MJGdlB, MVH), pp. 194–205.
- POPL-1993-CodishDG #analysis #composition #logic programming #source code
- Compositional Analysis of Modular Logic Programs (MC, SKD, RG), pp. 451–464.
- WSA-1993-BruynoogheC #correctness
- Freeness, Sharing, Linearity and Correctness — All at Once (MB, MC), pp. 153–164.
- ALP-1992-BarbutiCGM #prolog #semantics
- Oracle Semantics for Prolog (RB, MC, RG, MJM), pp. 100–114.
- POPL-1992-BarbutiCGL #modelling #prolog
- Modeling Prolog Control (RB, MC, RG, GL), pp. 95–104.
- WSA-1992-CodishFMW #analysis #concurrent #constraints #logic programming #performance #source code
- Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs (MC, MF, KM, WHW), pp. 35–42.
- ICLP-1991-CodishDY #algorithm #alias #analysis #safety #unification
- Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis (MC, DD, EY), pp. 79–93.
- ICLP-1991-CodishFM #analysis #concurrent #logic programming #source code
- Suspension Analysis for Concurrent Logic Programs (MC, MF, KM), pp. 331–345.
- WSA-1991-BarbutiCGL #modelling #prolog
- Modelling Prolog Control (RB, MC, RG, GL), pp. 117–124.
- LICS-1988-GerthCLS #concurrent #prolog #semantics
- Fully Abstract Denotational Semantics for Flat Concurrent Prolog (RG, MC, YL, EYS), pp. 320–335.
- ICLP-1986-CodishS86 #compilation
- Compiling OR-parallelism into AND-parallelism (MC, EYS), pp. 283–297.