Michael Codish
Michael Codish
Department of Computer Science, Ben-Gurion University of the Negev
Verified email at cs.bgu.ac.il
Cited by
Cited by
Propagation via lazy clause generation
O Ohrimenko, PJ Stuckey, M Codish
Constraints 14 (3), 357-391, 2009
A semantic basis for the termination analysis of logic programs
M Codish, C Taboch
The Journal of Logic Programming 41 (1), 103-123, 1999
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface
D Ünay, Z Çataltepe, S Aksoy
Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2010
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
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
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
Specialisation of Prolog and FCP programs using abstract interpretation
J Gallagher, M Codish, E Shapiro
New Generation Computing 6 (2-3), 159-186, 1988
Deriving polymorphic type dependencies for logic programs using multiple incarnations of prop
M Codish, B Demoen
International Static Analysis Symposium, 281-296, 1994
Termination analysis of Java bytecode
E Albert, P Arenas, M Codish, S Genaim, G Puebla, D Zanardini
International Conference on Formal Methods for Open Object-Based Distributed …, 2008
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
Fully abstract denotational semantics for Concurrent Prolog
R Gerth, M Codish, Y Lichtenstein, E Shapiro
Proc. of the Third IEEE Symposium on Logic In Computer Science, 320-335, 1988
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 (1), 53-93, 2012
Testing for termination with monotonicity constraints
M Codish, V Lagoon, PJ Stuckey
International Conference on Logic Programming, 326-340, 2005
Type dependencies for logic programs using ACI-unification
M Codish, V Lagoon
Theoretical Computer Science 238 (1-2), 131-159, 2000
Pairwise cardinality networks
M Codish, M Zazon-Ivry
International Conference on Logic for Programming Artificial Intelligence …, 2010
Inferring Termination Conditions for Logic Programs using Backwards Analysis
samir Genaim, michael Codish
The Journal of Theory and Practice of Logic Programming 5 (1-2), 75-91, 2005
The system can't perform the operation now. Try again later.
Articles 1–20