Show simple item record

dc.contributor.authorLal, Akashen_US
dc.contributor.authorKidd, Nicholasen_US
dc.contributor.authorReps, Thomasen_US
dc.contributor.authorTouili, Tayssiren_US
dc.date.accessioned2012-03-15T17:21:09Z
dc.date.available2012-03-15T17:21:09Z
dc.date.created2006en_US
dc.date.issued2006
dc.identifier.citationTR1579en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/60532
dc.description.abstractTo 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.mimetypeapplication/pdfen_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleAbstract Error Projectionen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record