Related articles |
---|
Abstract Interpretation Query ashok@trddc.ernet.in (Ashok Sreenivas) (1992-09-04) |
Re: Abstract Interpretation Query vugranam@pike.ee.mcgill.ca (1992-09-05) |
Re: Abstract Interpretation Query masticol@cadenza.rutgers.edu (1992-09-06) |
Re: Abstract Interpretation Query deutsch+@cs.cmu.edu (1992-09-06) |
Re: Abstract Interpretation Query chow@sp1.csrd.uiuc.edu (1992-09-06) |
Newsgroups: | comp.compilers |
From: | Ashok Sreenivas <ashok@trddc.ernet.in> |
Organization: | University of Tennessee, Knoxville - CS Department |
Date: | Fri, 4 Sep 1992 16:57:00 GMT |
Keywords: | functional, logic, question |
I am working on trying to formalise program analyses and
transformations. In this connection, I have come across a technique
called Abstract Interpretation. So far, I've only seen a lot of
theory regarding it, and some applications to functional and logic
languages.
What I want to know is: has anybody applied it to everyday imperative
languages in real life (i.e. to languages like Pascal, C, and
analyses like type analysis, data flow analysis etc.)?
If so, what were your experiences with Abstract Interpretation?
--------------------------------------------------------------------------
I'm posting this for a friend who doesn't have access to news.
Preferably, email responses to Ashok Sreenivas at the following email
address: ashok@trddc.ernet.in If this is not possible, please send me
email (mehta@cs.utk.edu) and/or post on comp.compilers.
Thanks,
Dinesh P. Mehta
Computer Science Dept
University of Tennessee Space Institute
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.