Memory Policy Analysis for Semantics Specifications in Maude

被引:3
作者
Riesco, Adrian [1 ]
Asavoae, Irina Mariuca [2 ]
Asavoae, Mihail [3 ]
机构
[1] Univ Complutense Madrid, Madrid, Spain
[2] Swansea Univ, Swansea, W Glam, Wales
[3] Inria Paris Rocquencourt, Paris, France
来源
LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION (LOPSTR 2015) | 2015年 / 9527卷
关键词
Formal semantics; Maude; Slicing; Analysis; Memory policies; REWRITING LOGIC; MODEL;
D O I
10.1007/978-3-319-27436-2_18
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper we propose an approach to the analysis of formal language semantics. In our analysis we target memory policies, namely, whether the formal specification under consideration follows a particular standard when defining how the language constructs work with the memory. More specifically, we consider Maude specifications of formal programming language semantics and we investigate these specifications at the meta-level in order to identify the memory elements (e.g., variables and values) and how the language syntactic constructs employ the memory and its elements. The current work is motivated by previous work on generic slicing in Maude, in the pursuit of making our generic slicing as general as possible. In this way, we integrate the current technique into an existing implementation of a generic semantics-based program slicer.
引用
收藏
页码:293 / 310
页数:18
相关论文
共 28 条
  • [1] Albert E, 2009, ISMM'09: PROCEEDINGS OF THE 2009 ACM SIGPLAN INTERNATIONAL SYMPOSIUM ON MEMORY MANAGEMENT, P129
  • [2] Using conditional trace slicing for improving Maude programs
    Alpuente, Maria
    Ballis, Demis
    Frechina, Francisco
    Romero, Daniel
    [J]. SCIENCE OF COMPUTER PROGRAMMING, 2014, 80 : 385 - 415
  • [3] Asavoae IM, 2014, LECT NOTES COMPUT SC, V8739, P291, DOI 10.1007/978-3-319-10181-1_18
  • [4] Baufreton P., 2007, ISOLA 2007, P41
  • [5] Descendants and origins in term rewriting
    Bethke, I
    Klop, JW
    de Vrijer, R
    [J]. INFORMATION AND COMPUTATION, 2000, 159 (1-2) : 59 - 124
  • [6] Specification and proof in membership equational logic
    Bouhoula, A
    Jouannaud, JP
    Meseguer, J
    [J]. THEORETICAL COMPUTER SCIENCE, 2000, 236 (1-2) : 35 - 132
  • [7] Clavel Manuel., 2007, All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic, V4350
  • [8] Cousot Patrick, 1977, POPL, DOI DOI 10.1145/512950.512973
  • [9] Ellison C, 2012, POPL 12: PROCEEDINGS OF THE 39TH ANNUAL ACM SIGPLAN-SIGACT SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES, P533
  • [10] Farzan A, 2004, LECT NOTES COMPUT SC, V3114, P501