Abstract Error Projection
| dc.contributor.author | Lal, Akash | en_US |
| dc.contributor.author | Kidd, Nicholas | en_US |
| dc.contributor.author | Reps, Thomas | en_US |
| dc.contributor.author | Touili, Tayssir | en_US |
| dc.date.accessioned | 2012-03-15T17:21:09Z | |
| dc.date.available | 2012-03-15T17:21:09Z | |
| dc.date.created | 2006 | en_US |
| dc.date.issued | 2006 | |
| dc.description.abstract | To improve the reporting of results from model checking and programanalysis systems, we introduce the notion of an error projection and annotated error projection. An error projection is a set of program nodes N such that for each node n 2 N there exists an (abstract) error path from the program entry s through n to a specified target node t. An annotated error projection associates with each node n in the error projection an (abstract) counterexample that validates the error along with an abstract store, whose presence at n induces the error. We present novel algorithms for computing (annotated) error projections and discuss additional applications for these algorithms. Our experiments show that error projections can be computed efficiently. | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.citation | TR1579 | en_US |
| dc.identifier.uri | http://digital.library.wisc.edu/1793/60532 | |
| dc.publisher | University of Wisconsin-Madison Department of Computer Sciences | en_US |
| dc.title | Abstract Error Projection | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1