A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In this article we present a novel technique for automated parallel bug-finding based on the sequential analysis tool TACO. TACO is a tool based on SAT-solving for efficient bugfinding in Java code with rich class invariants. It prunes the SAT-solver's search space by introducing precise symmetrybreaking predicates and bounding the relational semantics of Java class fields. The bounds computed by TACO generally include a substantial amount of nondeterminism; its reduction allows us to split thedoi:10.1145/2483760.2483770 dblp:conf/issta/RosnerGBBRPZF13 fatcat:u5trj4i3jbbzljpclfvy6ldr7m