home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!haven.umd.edu!darwin.sura.net!jvnc.net!rutgers!faatcrl!iecc!compilers-sender
- From: ashok@trddc.ernet.in (Ashok Sreenivas)
- Newsgroups: comp.compilers
- Subject: Abstract Interpretation Query
- Keywords: functional, logic, question
- Message-ID: <92-09-038@comp.compilers>
- Date: 4 Sep 92 16:57:00 GMT
- Sender: compilers-sender@iecc.cambridge.ma.us
- Reply-To: Ashok Sreenivas <ashok@trddc.ernet.in>
- Organization: University of Tennessee, Knoxville - CS Department
- Lines: 29
- Approved: compilers@iecc.cambridge.ma.us
-
- 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
-
-
-
- --
- Send compilers articles to compilers@iecc.cambridge.ma.us or
- {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.
-