Debugging Process Algebra Specifications

被引:0
|
作者
Salauen, Gwen [1 ]
Ye, Lina [2 ]
机构
[1] Univ Grenoble Alpes, Inria, LIG, CNRS, Grenoble, France
[2] Supelec, Dept Comp Sci, Gif Sur Yvette, France
关键词
MODEL CHECKING; COVERAGE;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Designing and developing distributed and concurrent applications has always been a tedious and error-prone task. In this context, formal techniques and tools are of great help in order to specify such concurrent systems and detect bugs in the corresponding models. In this paper, we propose a new framework for debugging value-passing process algebra through coverage analysis. We illustrate our approach with LNT, which is a recent specification language designed for formally modelling concurrent systems. We define several coverage notions before showing how to instrument the specification without affecting original behaviors. Our approach helps one to improve the quality of a dataset of examples used for validation purposes, but also to find ill-formed decisions, dead code, and other errors in the specification. We have implemented a tool for automating our debugging approach, and applied it to several real-world case studies in different application areas.
引用
收藏
页码:245 / 262
页数:18
相关论文
共 50 条
  • [1] Equivalence of recursive specifications in process algebra
    Ponse, A
    Usenko, YS
    INFORMATION PROCESSING LETTERS, 2001, 80 (01) : 59 - 65
  • [2] MODULAR SPECIFICATIONS IN PROCESS ALGEBRA WITH CURIOUS QUEUES
    VANGLABBEEK, R
    VAANDRAGER, F
    ALGEBRAIC METHODS : THEORY, TOOLS AND APPLICATIONS, 1989, 394 : 465 - 506
  • [3] Specifications and verification of network protocols by process algebra
    Ciobanu, G
    Sridhar, KN
    SEVENTH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING, PROCEEDINGS, 2005, : 250 - 258
  • [4] State space reduction for process algebra specifications
    Garavel, H
    Serwe, W
    THEORETICAL COMPUTER SCIENCE, 2006, 351 (02) : 131 - 145
  • [5] MODULAR SPECIFICATIONS IN PROCESS ALGEBRA WITH CURIOUS QUEUES
    VANGLABBEEK, R
    VAANDRAGER, F
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 394 : 465 - 506
  • [6] State space reduction for process algebra specifications
    Garavel, H
    Serwe, W
    ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY: PROCEEDINGS, 2004, 3116 : 164 - 180
  • [7] Specifications in stochastic process algebra for a robot control problem
    Gilmore, S
    Hillston, J
    Holton, R
    Rettelbach, M
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (04) : 1065 - 1080
  • [8] Performance debugging of Esterel specifications
    Lei Ju
    Bach Khoa Huynh
    Abhik Roychoudhury
    Samarjit Chakraborty
    Real-Time Systems, 2012, 48 : 570 - 600
  • [9] Performance debugging of Esterel specifications
    Ju, Lei
    Bach Khoa Huynh
    Roychoudhury, Abhik
    Chakraborty, Samarjit
    REAL-TIME SYSTEMS, 2012, 48 (05) : 570 - 600
  • [10] Enhancing the Debugging of Maude Specifications
    Riesco, Adrian
    Verdejo, Alberto
    Marti-Oliet, Narciso
    REWRITING LOGIC AND ITS APPLICATIONS, 2010, 6381 : 226 - 242