A Modular Formalization of Reversibility for Concurrent Models and Languages

被引：5
|
作者：
Bernadet, Alexis [1 ]
Lanese, Ivan [2 ]
机构：
[1] Dalhousie Univ, Halifax, NS B3H 3J5, Canada
[2] Univ Bologna, Focus Team, INRIA, I-40126 Bologna, Italy
来源：
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE | 2016年 / 223期
关键词：
D O I：
10.4204/EPTCS.223.7
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Causal-consistent reversibility is the reference notion of reversibility for concurrency. We introduce a modular framework for defining causal-consistent reversible extensions of concurrent models and languages. We show how our framework can be used to define reversible extensions of formalisms as different as CCS and concurrent X-machines. The generality of the approach allows for the reuse of theories and techniques in different settings.
引用
收藏
页码：98 / 112
页数：15
相关论文
共 50 条
  • [21] ModuRes: A Coq Library for Modular Reasoning About Concurrent Higher-Order Imperative Programming Languages
    Sieczkowski, Filip
    Bizjak, Ales
    Birkedal, Lars
    INTERACTIVE THEOREM PROVING, 2015, 9236 : 375 - 390
  • [22] Formalization of the Pumping Lemma for Context-Free Languages
    Ramos, M. V. M.
    De Queiroz, R. J. G. B.
    Moreira, N.
    Almeida, J. C. B.
    JOURNAL OF FORMALIZED REASONING, 2016, 9 (02): : 53 - 68
  • [23] Disambiguation of Industrial Standards Through Formalization and Graphical Languages
    Dietsch, Daniel
    Arenis, Sergio Feo
    Westphal, Bernd
    Podelski, Andreas
    2011 19TH IEEE INTERNATIONAL REQUIREMENTS ENGINEERING CONFERENCE (RE), 2011, : 265 - 270
  • [24] Formalization of UML models by RTPA
    Khoo, Tony
    Wang, Yingxu
    2006 CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, VOLS 1-5, 2006, : 1793 - +
  • [25] A Formalization of Java']Java's Concurrent Access Modes
    Bender, John
    Palsberg, Jens
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2019, 3 (OOPSLA):
  • [26] PROGRAMMING IN CONCURRENT LOGIC LANGUAGES
    HUNTBACH, MM
    RINGWOOD, GA
    IEEE SOFTWARE, 1995, 12 (06) : 71 - 82
  • [27] Termination in Impure Concurrent Languages
    Demangeon, Romain
    Hirschkoff, Daniel
    Sangiorgi, Davide
    CONCUR 2010 - CONCURRENCY THEORY, 2010, 6269 : 328 - +
  • [28] Combinatory formulations of concurrent languages
    Raja, N
    Shyamasundar, RK
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1997, 19 (06): : 899 - 915
  • [29] Message analysis for concurrent languages
    Carlsson, R
    Sagonas, K
    Wilhelmsson, J
    STATIC ANALYSIS, PROCEEDINGS, 2003, 2694 : 73 - 90
  • [30] A CUSTOMIZABLE SUBSTRATE FOR CONCURRENT LANGUAGES
    JAGANNATHAN, S
    PHILBIN, J
    SIGPLAN NOTICES, 1992, 27 (07): : 55 - 67
12345