Certifying cryptographic protocols by abstract model-checking and proof concretization

Authors:
R. Janvier;Y. Lakhnech;M. Périn
Affiliations:
VERIMAG, Gières, France;VERIMAG, Gières, France;VERIMAG, Gières, France
Venue:
ACM SIGBED Review - Special issues on workshop on innovative techniques for certification of embedded systems
Year:
2006

Citing 16
Cited 0

Temporal verification of reactive systems: safety

Temporal verification of reactive systems: safety
Justifying proofs using memo tables

Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM
Ordered Semantic Hyper-Linking

Journal of Automated Reasoning
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Automatic Deductive Verification with Invisible Invariants

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Incremental Verification by Abstraction

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Lifting Temporal Proofs through Abstractions

VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Specification and verification of concurrent systems in CESAR

Proceedings of the 5th Colloquium on International Symposium on Programming
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Temporal-Safety Proofs for Systems Code

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Abstractions from proofs

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
Semantics-preserving and memory-efficient implementation of inter-task communication on static-priority or EDF schedulers

Proceedings of the 5th ACM international conference on Embedded software
Pattern-based abstraction for verifying secrecy in protocols

International Journal on Software Tools for Technology Transfer (STTT) - Special section on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we report on our effort in enhancing our model-checker for cryptographic protocols with the ability to automatically generate a deductive proof that the protocol meets its specification. More specifically, we discuss a technique that allows to transform an abstract proof extracted from the model-checker to a proof that can be checked independently of the abstracting and model-checking process.