16404 search results - page 3075 / 3281 » A set coverage problem |
131
click to vote
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
133
click to vote
SIGSOFT
2005
ACM
16 years 5 months ago
2005
ACM
Software evolution research inherently has several resourceintensive logistical constraints. Archived project artifacts, such as those found in source code repositories and bug tr...
134
click to vote
SIGSOFT
2004
ACM
16 years 5 months ago
2004
ACM
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires ...
113
click to vote
SIGSOFT
2004
ACM
16 years 5 months ago
2004
ACM
One of the benefits of finite-state verification (FSV) tools, such as model checkers, is that a counterexample is provided when the property cannot be verified. Not all counterexa...
123
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
With the advent of Web 2.0 technologies, websites have evolved from static pages to dynamic, interactive Web-based applications with the ability to replicate common desktop functi...