| Document Date: 2013-05-12 14:14:09
Open Document File Size: 205,37 KBShare Result on Facebook
City New York / / Company K. AND C HEW L. P. / Sun Microsystems / Infinite State Systems / ACM Press / Intel / Microsoft / / Country United States / / / Facility University of California / / IndustryTerm correct minimal solution / software artifact / minimal solution / pushdown systems / branch-and-bound algorithms / parallel search / search procedure / incorrect solution / later processing / nondeterministic algorithms / parallel chips / model-checking algorithms / concurrent object-oriented software / branch-and-bound search / / Organization Koushik Sen Department of Computer Science / National Science Foundation / University of California / Berkeley / Department of Defense / / Person George Necula / AMA NARAYANAN / A DVE / V / Jacob Burnim / / Position scheduler / software engineer / programmer / / PublishedMedium Communications of the ACM / / Technology model-checking algorithms / Object Technology / CAV / branch-and-bound algorithms / /
SocialTag |
Separating Functional and Parallel Correctness using Nondeterministic Sequential Specifications Jacob Burnim, George Necula, and Koushik Sen Department of Computer Science, University of California, Berkeley {jburnim,nec