Cart (Loading....) | Create Account
Close category search window
 

Implementation of abstract interpretation algorithms by means of attribute grammar

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Barbar, K. ; CNRS, Bordeaux I Univ., Talence, France ; Musumbu, K.

In logic programming, “dixit” Bruygnooghe, the purpose of abstract interpretation is the construction of a finite AND/OR tree and the “computation” of a correct abstract substitution at each node of that tree. The authors consider an abstract substitution as an attribute attached to the nodes of a tree, and then the propagation process of abstract substitutions through the tree can be expressed in terms of attribute evaluation. In this way, the authors implement abstract interpretation algorithms by attribute evaluation algorithms

Published in:

System Theory, 1994., Proceedings of the 26th Southeastern Symposium on

Date of Conference:

20-22 Mar 1994

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.