Sciweavers

1536 search results - page 65 / 308
» The Underlying Logic of Hoare Logic
Sort
View
ASIAN
2006
Springer
118views Algorithms» more  ASIAN 2006»
15 years 1 months ago
An Approach to Formal Verification of Arithmetic Functions in Assembly
Abstract. It is customary to write performance-critical parts of arithmetic functions in assembly: this enables finely-tuned algorithms that use specialized processor instructions....
Reynald Affeldt, Nicolas Marti
JLP
2010
85views more  JLP 2010»
14 years 4 months ago
Synchronous Kleene algebra
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
Cristian Prisacariu
PPOPP
2006
ACM
15 years 3 months ago
Proving correctness of highly-concurrent linearisable objects
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...
Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Mar...
FM
2003
Springer
108views Formal Methods» more  FM 2003»
15 years 3 months ago
Correctness of Source-Level Safety Policies
Abstract. Program certification techniques formally show that programs satisfy certain safety policies. They rely on the correctness of the safety policy which has to be establish...
Ewen Denney, Bernd Fischer 0002
MPC
1995
Springer
125views Mathematics» more  MPC 1995»
15 years 1 months ago
Synthesizing Proofs from Programs in the Calculus of Inductive Constructions
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
Catherine Parent