68 search results - page 5 / 14 » Exploiting Shared Structure in Software Verification Conditi... |
89
Voted
ETRICS
2006
15 years 1 months ago
2006
Abstract. Practical computer (in)security is largely driven by the existence of and knowledge about vulnerabilities, which can be exploited to breach security mechanisms. Although ...
PPOPP
2006
ACM
15 years 3 months ago
2006
ACM
We investigate a transactional memory runtime system providing scaling and strong consistency for generic C++ and SQL applications on commodity clusters. We introduce a novel page...
FMSD
2006
14 years 9 months ago
2006
Reductions that aggregate fine-grained transitions into coarser transitions can significantly reduce the cost of automated verification, by reducing the size of the state space. W...
101
Voted
CADE
2009
Springer
15 years 10 months ago
2009
Springer
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
95
Voted
DC
2010
14 years 9 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...