Sciweavers

21 search results - page 2 / 5
» A Formally Verified Calculus for Full Java Card
Sort
View
AUSAI
1998
Springer
13 years 9 months ago
cardTAP: Automated Deduction on a Smart Card
We present the rst implementation of a theorem prover which runs on a smart card. The prover is written in Java and implements a dual tableau calculus.1 Due to the limited resource...
Andrew Slater, Rajeev Goré, Joachim Posegga...
COMPSEC
2010
142views more  COMPSEC 2010»
13 years 2 months ago
Provably correct Java implementations of Spi Calculus security protocols specifications
Spi Calculus is an untyped high level modeling language for security protocols, used for formal protocols specification and verification. In this paper, a type system for the Spi ...
Alfredo Pironti, Riccardo Sisto
FASE
2001
Springer
13 years 9 months ago
A Hoare Calculus for Verifying Java Realizations of OCL-Constrained Design Models
Abstract. The Object Constraint Language OCL offers a formal notation for constraining the modelling elements occurring in UML diagrams. In this paper we apply OCL for developing ...
Bernhard Reus, Martin Wirsing, Rolf Hennicker
CADE
1998
Springer
13 years 9 months ago
System Description: card TAP: The First Theorem Prover on a Smart Card
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
Rajeev Goré, Joachim Posegga, Andrew Slater...
SEFM
2007
IEEE
13 years 11 months ago
Verifying the Mondex Case Study
The Mondex Case study is still the most substantial contribution to the Grand Challenge repository. It has been the target of a number of formal verification efforts. Those effor...
Peter H. Schmitt, Isabel Tonin