Michael Codish
Michael Codish
Department of Computer Science, Ben-Gurion University of the Negev
Verified email at
Cited by
Cited by
Propagation via lazy clause generation
O Ohrimenko, PJ Stuckey, M Codish
Constraints 14, 357-391, 2009
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface
M Abe, K Aoki, G Ateniese, R Avanzi, Z Beerliová, O Billet, A Biryukov, ...
Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2006
A semantic basis for the termination analysis of logic programs
M Codish, C Taboch
The Journal of Logic Programming 41 (1), 103-123, 1999
Improving abstract interpretations by combining domains
M Codish, A Mulkers, M Bruynooghe, MG De La Banda, M Hermenegildo
ACM Transactions on Programming Languages and Systems (TOPLAS) 17 (1), 28-44, 1995
Analyzing logic programs using “prop”-ositional logic programs and a magic wand
M Codish, B Demoen
The Journal of Logic Programming 25 (3), 249-274, 1995
Termination analysis of logic programs through combination of type-based norms
M Bruynooghe, M Codish, JP Gallagher, S Genaim, W Vanhoof
ACM Transactions on Programming Languages and Systems (TOPLAS) 29 (2), 10-es, 2007
Suspension analyses for concurrent logic programs
M Codish, M Falaschi, K Marriott
ACM Transactions on Programming Languages and Systems (TOPLAS) 16 (3), 649-686, 1994
A novel sat-based approach to model based diagnosis
A Metodi, R Stern, M Kalech, M Codish
Journal of Artificial Intelligence Research 51, 377-411, 2014
Bottom-up abstract interpretation of logic programs
M Codish, D Dams, E Yardeni
Theoretical Computer Science 124 (1), 93-125, 1994
Compositional analysis of modular logic programs
M Codish, SK Debray, R Giacobazzi
Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of …, 1993
Specialisation of Prolog and FCP programs using abstract interpretation
J Gallagher, M Codish, E Shapiro
New Generation Computing 6, 159-186, 1988
Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis
M Codish, D Dams, Y Eyal
International Conference on logic programming (ICLP), 79-93, 1991
Termination analysis of Java bytecode
E Albert, P Arenas, M Codish, S Genaim, G Puebla, D Zanardini
Formal Methods for Open Object-Based Distributed Systems: 10th IFIP WG 6.1 …, 2008
Deriving polymorphic type dependencies for logic programs using multiple incarnations of prop
M Codish, B Demoen
International Static Analysis Symposium, 281-296, 1994
Fully abstract denotational semantics for Concurrent Prolog
RT Gerth, M Codish, Y Lichtenstein, E Shapiro
Technische Universiteit Eindhoven, 1987
SAT solving for termination proofs with recursive path orders and dependency pairs
M Codish, J Giesl, P Schneider-Kamp, R Thiemann
Journal of automated reasoning 49, 53-93, 2012
Pairwise cardinality networks
M Codish, M Zazon-Ivry
International Conference on Logic for Programming Artificial Intelligence …, 2010
Type dependencies for logic programs using ACI-unification
M Codish, V Lagoon
Theoretical Computer Science 238 (1-2), 131-159, 2000
Testing for termination with monotonicity constraints
M Codish, V Lagoon, PJ Stuckey
Logic Programming: 21st International Conference, ICLP 2005, Sitges, Spain …, 2005
Sorting nine inputs requires twenty-five comparisons
M Codish, L Cruz-Filipe, M Frank, P Schneider-Kamp
Journal of Computer and System Sciences 82 (3), 551-563, 2016
The system can't perform the operation now. Try again later.
Articles 1–20