An Incremental Proof-Based Process of the NetBill Electronic Commerce Protocol

被引:1
|
作者
El Mimouni, Sanae [1 ]
Bouhdadi, Mohamed [1 ]
机构
[1] Mohammed V Univ, Fac Sci, LMPHE Lab, Rabat, Morocco
来源
关键词
NetBill protocol; Event-B; Refinement; Formal method; Rodin;
D O I
10.1007/978-3-319-46140-3_17
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents an incremental formal modeling of the NetBill protocol using Event-B method. The NetBill protocol is an electronic commerce protocol designed for micropayment systems for selling and delivery of information and goods through the internet. We model the protocol step by step using refinement, which is the key mechanism of the Event-B method. Event-B modeling starts with an abstraction of a system and adds details during refinement levels in order to gain a final model close to the implementation. Moreover mathematical proofs are incorporated into Event-B to verify the correctness of refinement steps. The outcome of this incremental approach was that we achieved a very high degree of automatic proof. In the developed Event-B model of the NetBill protocol described in this paper, all proofs are generated and discharged by the Rodin tool.
引用
下载
收藏
页码:209 / 213
页数:5
相关论文
共 50 条
  • [1] Formal analysis of the NetBill electronic commerce protocol
    Ogata, K
    Futatsugi, K
    SOFTWARE SECURITY - THEORIES AND SYSTEMS, 2004, 3233 : 45 - 64
  • [2] Designing Old and New Distributed Algorithms by Replaying an Incremental Proof-Based Development
    Cansell, Dominique
    Meryl, Dominique
    RIGOROUS METHODS FOR SOFTWARE CONSTRUCTION AND ANALYSIS: EASSYS DEDICATED TO EGON BORGER ON THE OCCASION OF HIS 60TH BIRTHDAY, 2009, 5115 : 17 - +
  • [3] Proof-Based Design of Security Protocols
    Benaissa, Nazim
    Mery, Dominique
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2010, 6072 : 25 - 36
  • [4] A Proof-Based Account of Legal Exceptions
    d'Almeida, Luis Duarte
    OXFORD JOURNAL OF LEGAL STUDIES, 2013, 33 (01) : 133 - 168
  • [5] Proof-based teaching as a basis for understanding why
    Reid, David
    Vargas, Estela Vallejo
    PROCEEDINGS OF THE TENTH CONGRESS OF THE EUROPEAN SOCIETY FOR RESEARCH IN MATHEMATICS EDUCATION (CERME10), 2017, : 235 - 242
  • [6] A PROOF-BASED FRAMEWORK FOR SEVERAL TYPES OF GROUNDING
    Poggiolesi, Francesca
    LOGIQUE ET ANALYSE, 2020, (252) : 387 - 414
  • [7] A Proof-Based Annotation Platform of Textual Entailment
    Toledo, Assaf
    Alexandropoulou, Stavroula
    Chesney, Sophie
    Grimm, Robert
    Kokke, Pepijn
    Kruit, Benno
    Neophytou, Kyriaki
    Nguyen, Antony
    Winter, Yoad
    LREC 2014 - NINTH INTERNATIONAL CONFERENCE ON LANGUAGE RESOURCES AND EVALUATION, 2014,
  • [8] A hybrid of counterexample-based and proof-based abstraction
    Amla, N
    McMillan, KL
    FORMAL METHODS IN COMPUTER-AIDED DESIGN, PROCEEDINGS, 2004, 3312 : 260 - 274
  • [9] Proof-Based Synthesis of Sorting Algorithms for Trees
    Dramnesc, Isabela
    Jebelean, Tudor
    Stratulat, Sorin
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, LATA 2016, 2016, 9618 : 562 - 575
  • [10] Proof-based approach to mobile code safety
    Tsukada, Yasuyuki
    NTT R and D, 2002, 51 (10): : 765 - 771