<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>GPGPU &#187; Tag: Abstract Interpretation :: GPGPU.org</title>
	<atom:link href="http://gpgpu.org/tag/abstract-interpretation/feed" rel="self" type="application/rss+xml" />
	<link>http://gpgpu.org</link>
	<description>General-Purpose Computation on Graphics Hardware</description>
	<lastBuildDate>Tue, 22 May 2012 08:44:05 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.2</generator>
		<item>
		<title>A Fast Implementation of the Octagon Abstract Domain on Graphics Hardware</title>
		<link>http://gpgpu.org/2007/07/14/a-fast-implementation-of-the-octagon-abstract-domain-on-graphics-hardware</link>
		<comments>http://gpgpu.org/2007/07/14/a-fast-implementation-of-the-octagon-abstract-domain-on-graphics-hardware#comments</comments>
		<pubDate>Sat, 14 Jul 2007 21:03:00 +0000</pubDate>
		<dc:creator>Mark Harris</dc:creator>
				<category><![CDATA[Research]]></category>
		<category><![CDATA[Abstract Interpretation]]></category>
		<category><![CDATA[Mathematics]]></category>
		<category><![CDATA[Papers]]></category>
		<category><![CDATA[Static Program Analysis]]></category>

		<guid isPermaLink="false">http://www.gpgpu.org/cgi-bin/blosxom.cgi/ScientificComputing/Mathematics/banterleOAD07.html</guid>
		<description><![CDATA[This paper by Banterle and Giacobazzi at UniversitÃ  degli Studi di Verona presents an efficient implementation of the Octagon Abstract Domain (OAD) on graphics hardware. OAD is a relational numerical abstract domain which approximates invariants as conjunctions of constraints of the form +/- x +/- y &#60;= c, where x and y are program variables [...]]]></description>
			<content:encoded><![CDATA[<p>This paper by <a href="http://profs.sci.univr.it/%7Egiaco/abstracts/sas07.abstract.html">Banterle and Giacobazzi</a> at UniversitÃ  degli Studi di Verona presents an efficient  implementation of the Octagon Abstract Domain (OAD) on graphics hardware.  OAD is a relational numerical abstract domain which approximates invariants as conjunctions of constraints of the form +/- x +/- y &lt;= c, where x and y are program variables and c is a constant which can be an integer, rational or real. OAD has been used with success in the aerospace industry for analyzing C programs such as the flight control software for the Airbus A340 fly-by-wire system. (<a href="http://profs.sci.univr.it/%7Egiaco/abstracts/sas07.abstract.html"> A Fast Implementation of the Octagon Abstract Domain on Graphics Hardware</a>. Francesco Banterle and Roberto Giacobazzi. <em>Proceeding of  The 14th  International Static Analysis Symposium (SAS). 2007</em>)</p>
]]></content:encoded>
			<wfw:commentRss>http://gpgpu.org/2007/07/14/a-fast-implementation-of-the-octagon-abstract-domain-on-graphics-hardware/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

