Sciweavers

608 search results - page 14 / 122
» Tests, Proofs and Refinements
Sort
View
CARDIS
1998
Springer
161views Hardware» more  CARDIS 1998»
13 years 12 months ago
Formal Proof of Smart Card Applets Correctness
: The new Gemplus smart card is based on the Java technology, embedding a virtual machine. The security policy uses mechanisms that are based on Java properties. This language prov...
Jean-Louis Lanet, Antoine Requet
ASM
2008
ASM
13 years 9 months ago
A Concept-Driven Construction of the Mondex Protocol Using Three Refinements
Abstract. The Mondex case study concerns the formal development and verification of an electronic purse protocol. Several groups have worked on its specification and mechanical ver...
Gerhard Schellhorn, Richard Banach
CORR
2010
Springer
89views Education» more  CORR 2010»
13 years 7 months ago
An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We re...
David Doty
FAC
2008
70views more  FAC 2008»
13 years 7 months ago
Mondex , an electronic purse: specification and refinement checks with the Alloy model-finding method
This paper explains how the Alloy model-finding method has been used to check the specification of an electronic purse (also called smart card) system, called the Mondex case study...
Tahina Ramananandro
CADE
2008
Springer
14 years 8 months ago
Bitfields and Tagged Unions in C: Verification through Automatic Generation
We present a tool for automatic generation of packed bitfields and tagged unions for systems-level C, along with automatic, machine checked refinement proofs in Isabelle/HOL. Our a...
David Cock