1226 search results - page 24 / 246 » Proofs, Programs and Abstract Complexity |
104
click to vote
CAV
1998
Springer
15 years 6 months ago
1998
Springer
We present a systematic approach to decompose and incrementally build the proof of correctness of pipelined microprocessors. The central idea is to construct the abstraction funct...
160
click to vote
MKM
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...
140
click to vote
CADE
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral proper...
DCG
2010
15 years 2 months ago
2010
Abstract. The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. Th...
113
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We investigate a general paradigm for constructing arbitraryinput-length (AIL) MACs from fixed-input-length (FIL) MACs, define the waste as the relevant efficiency para...