Algebraic Abstractions

Authors:
Michel Bidoit;Alexandre Boisseau
Affiliations:
-;-
Venue:
WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
Year:
2001

Citing 8
Cited 0

Abstract interpretation and application to logic programs

Journal of Logic Programming
Model checking and abstraction

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract interpretation of reactive systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
The inductive approach to verifying cryptographic protocols

Journal of Computer Security
Algebraic Foundations of Systems Specification

Algebraic Foundations of Systems Specification
A Method for Automatic Cryptographic Protocol Verification

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Rules for Abstraction

ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
Towards a Mechanization of Cryptographic Protocal Verification

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study abstraction techniques for verification problems of the form C ⊧ Φ, where C is a first-order structure and Φ is a first-order formula (both w.r.t. a given signature Σ). This study is motivated by the need of such abstractions for the automatic verification of properties of cryptographic protocols, which in our approach are modeled by first-order structures. Our so-called algebraic abstractions will be correct by construction and optimal in some certain technical sense. Moreover, we provide guidelines to design specific algebraic abstractions suited for verification problems corresponding to cryptographic protocols.