691 search results - page 104 / 139 » Automatically Proving Linearizability |
103
click to vote
ECOOP
2010
Springer
15 years 1 months ago
2010
Springer
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...
AISC
2008
Springer
14 years 11 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
CP
2008
Springer
14 years 11 months ago
2008
Springer
It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only...
FM
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The paper presents a deductive framework for proving program equivalence and its application to automatic verification of transformations performed by optimizing compiler...
101
click to vote
FMCAD
2008
Springer
14 years 11 months ago
2008
Springer
el Sequential Memory Abstraction for Model Checking Per Bjesse Advanced Technology Group Synopsys Inc. Many designs intermingle large memories with wide data paths and nontrivial c...