Validation of the JavaCard Platform with Implicit Induction Techniques

Barthe, Gilles; Stratulat, Sorin

doi:10.1007/3-540-44881-0_24

Cited by 15 publications

(22 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A challenge will be to translate and certify the proofs involved in the JavaCard platform validation [3].…”

Section: Discussionmentioning

confidence: 99%

“…a rewrite system R, we will consider a simplified version of the Spike inference system [5,3], represented in Fig. 1, that implements this particular case of Noetherian induction in order to perform implicit induction proofs.…”

Section: Noetherian Induction For Implicit Induction Proofsmentioning

confidence: 99%

“…if e is subsumed by some conjecture from H ∪ L. presented in [3] and is different from the 'test set' method from [5]. Finally, the current conjecture is added to the set of premises.…”

Section: Noetherian Induction For Implicit Induction Proofsmentioning

confidence: 99%

“…We are interested in certifying properties about conditional specifications using automated proof techniques like those employed by Spike [5,19,3], a rewrite-based implicit induction proof system. The implementation of Spike's inference system is spread over thousands of lines of OCaml [12] code.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Automated Certification of Implicit Induction Proofs

Stratulat¹,

Demange²

2011

Certified Programs and Proofs

Self Cite

View full text Add to dashboard Cite

Abstract. Theorem proving is crucial for the formal validation of properties about user specifications. With the help of the Coq proof assistant, we show how to certify properties about conditional specifications that are proved using automated proof techniques like those employed by the Spike prover, a rewrite-based implicit induction proof system. The certification methodology is based on a new representation of the implicit induction proofs for which the underlying induction principle is an instance of Noetherian induction governed by an induction ordering over equalities. We propose improvements of the certification process and show that the certification time is reasonable even for industrial-size applications. As a case study, we automatically prove and certify more than 40% of the lemmas needed for the validation of a conformance algorithm for the ABR protocol.

show abstract

“…A challenge will be to translate and certify the proofs involved in the JavaCard platform validation [3].…”

Section: Discussionmentioning

confidence: 99%

Section: Noetherian Induction For Implicit Induction Proofsmentioning

confidence: 99%

“…if e is subsumed by some conjecture from H ∪ L. presented in [3] and is different from the 'test set' method from [5]. Finally, the current conjecture is added to the set of premises.…”

Section: Noetherian Induction For Implicit Induction Proofsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Automated Certification of Implicit Induction Proofs

Stratulat¹,

Demange²

2011

Certified Programs and Proofs

Self Cite

View full text Add to dashboard Cite

show abstract

“…Earlier work on Java Cards was mainly related to the semantic and formal modelling of the JCVM [?, 84,201,202], Java Card rewall mechanism [191,203], and applets [204] [206]. The assurance for the JCRE reliability against ill-formed applications was based on bytecode veri cation [128,161] [163], which became a compulsory part of the Java Card speci cation version 3 [16].…”

Section: Related Workmentioning

confidence: 99%