Heaton, A. and Hill, P.M. and King, A. (2000) Abstract domains for universal and existential properties. In: Smolka, G., ed. Programming Languages and Systems. Lecture Notes in Computer Science, 1782. Springer-Verlag Berlin pp. 150-164. ISBN 3-540-67262-1.
Abstr. interpretation theory has successfully been used for constructing algorithms to statically determine run-time properties of programs. Central is the notion of an abstract domain, describing certain properties of interest about the program. In logic programming, program analyses typically fall into two different categories: either they detect program points where the property definitely holds (universal analyses) or possibly holds (existential analyses). We study the relation between such analyses in the case where the concrete domain is a lattice join-generated by its set of join-irreducible elements. Although our intended application is for logic programming, the theory is sufficiently general for possible applications to other languages.
|Item Type:||Conference or workshop item (Paper)|
|Additional information:||Proceedings Paper Conference Information: Joint European Conference on Theory and Practice of Software (ETAPS 2000) BERLIN, GERMANY, MAR 25-APR 02, 2000 Inst Communicat & Software Technol TU Berlin; European Assoc Program Languages & Syst; European Assoc Theoret Comp Sci; European Assoc Software Dev Sci Book Series Lecture Notes in Computer Science|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing|
|Depositing User:||O.O. Odanye|
|Date Deposited:||14 May 2009 10:05|
|Last Modified:||25 Jun 2012 10:12|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/16201 (The current URI for this page, for reference purposes)|
- Depositors only (login required):