Loading...
Please wait, while we are loading the content...
Similar Documents
Distributed SAT-Based Computation of Relational Tight Bounds
| Content Provider | Semantic Scholar |
|---|---|
| Author | Galeotti, Juan P. Rosner, Nicolás Pombo, Carlos López Frias, Marcelo F. |
| Copyright Year | 2008 |
| Abstract | SAT based analysis of code consists on providing an appropriate translation of code to a SAT problem, and using a SAT solver to analyze properties of the source program. This process can be improved if bounds for relations modeling class fields are introduced ala KodKod. In this article we present a distributed algorithm for automated inference of tight field bounds. From a technical point of view, the algorithm relies on a novel symmetry breaking predicate for program heaps. We present experimental results that support our claims. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://publicaciones.dc.uba.ar/Publications/2009/GRLF09/apv09_DIST_SAT.pdf |
| Alternate Webpage(s) | http://se.inf.ethz.ch/old/events/apv/files/APV09-01.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |