Sciweavers

323 search results - page 12 / 65
» Verifying the Mondex Case Study
Sort
View
POPL
2010
ACM
14 years 7 months ago
A simple, verified validator for software pipelining
Software pipelining is a loop optimization that overlaps the execution of several iterations of a loop to expose more instruction-level parallelism. It can result in first-class p...
Jean-Baptiste Tristan, Xavier Leroy
CAV
2010
Springer
154views Hardware» more  CAV 2010»
14 years 1 months ago
Verifying Low-Level Implementations of High-Level Datatypes
For efficiency and portability, network packet processing code is typically written in low-level languages and makes use of bit-level operations to compactly represent data. Althou...
Christopher L. Conway, Clark Barrett
JSC
2010
106views more  JSC 2010»
13 years 8 months ago
Verifying pointer safety for programs with unknown calls
We study the automated verification of pointer safety for heap-manipulating imperative programs with unknown procedure calls. Given a Hoare-style partial correctness specificati...
Chenguang Luo, Florin Craciun, Shengchao Qin, Guan...
TSE
2010
125views more  TSE 2010»
13 years 8 months ago
Engineering a Sound Assertion Semantics for the Verifying Compiler
—The Verifying Compiler (VC) project is a core component of the Dependable Systems Evolution Grand Challenge. The VC offers the promise of automatically proving that a program or...
Patrice Chalin
PPDP
2005
Springer
14 years 3 months ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Véronique Cortier, Michaël Rusinowitch...