Search for Author All Reviews
	Codish, Michael     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 4 of 4 reviews       Termination analysis of logic programs through combination of type-based norms Bruynooghe M., Codish M., Gallagher J., Genaim S., Vanhoof W. ACM Transactions on Programming Languages and Systems 29(2): 10-es, 2007.  Type: Article Establishing that all computations terminate is a fundamental, though generally undecidable, property of computer programs. Therefore, termination analyses that approximate this property have been developed for different programming la...... Aug 29 2007     Improving abstract interpretations by combining domains Codish M., Mulkers A., Bruynooghe M., de la Banda M., Hermenegildo M. ACM Transactions on Programming Languages and Systems 17(1): 28-44, 1995.  Type: Article In the abstract setting of domain theory, the meaning of a program P is expressed as the least fixed point of a monotonic operator f P on a domain E. In the developmen...... Sep 1 1996     Suspension analyses for concurrent logic programs Codish M., Falaschi M., Marriott K. ACM Transactions on Programming Languages and Systems 16(3): 649-686, 1994.  Type: Article The authors consider the relationship between suspension analysis of concurrent logic programs, specifically FCP(:) programs, and abstract interpretations. This research paper formalizes the operational semantics of an FCP(:) program. ...... Aug 1 1995     Bottom-up abstract interpretation of logic programs Codish M., Dams D., Yardeni E. Theoretical Computer Science 124(1): 93-125, 1994.  Type: Article A new abstract framework that extends a previous proposal of Falaschi and Levi based on denotational semantics is presented. The paper outlines an interesting problem, but the approach is slightly novel. Generally the denotational appr...... Mar 1 1995
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy