691 search results - page 60 / 139 » Automatically Proving Linearizability |
BIRTHDAY
2010
Springer
13 years 11 months ago
2010
Springer
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
IJFCS
2007
13 years 10 months ago
2007
Ranking Abstraction Ittai Balaban Computer Science Department, New York University, 251 Mercer St., New York, New York 10012, United States and Amir Pnueli Computer Science Departm...
POPL
2009
ACM
14 years 10 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
CADE
2009
Springer
14 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, ...
CAV
1998
Springer
14 years 2 months ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...