Manipulating algebraic specifications with term-based and graph-based representations

被引:2
|
作者
Moreira, AM
Ringeissen, C
Déharbe, D
Lima, G
机构
[1] Univ Fed Rio Grande do Norte, Dept Informat & Matemat Aplicada, BR-59072970 Natal, RN, Brazil
[2] LORIA, F-54602 Villers Les Nancy, France
来源
JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING | 2004年 / 59卷 / 1-2期
关键词
software engineering; formal specification; algebraic specification; software reuse; tool inter-operability; interchange format; CASL; ELAN;
D O I
10.1016/j.jlap.2003.12.001
中图分类号
学科分类号
摘要
In an environment of continuous and rapid evolution, software design methodologies must incorporate techniques and tools that support changes in software artifacts. In the FERUS project, we are developing a tool targeted at software designers that integrates a collection of operations on algebraic specifications written in the CASL language. The scope of FERUS includes not only modification of existing specifications, but also creation or derivation of new specifications, as well as their proof and execution, which are realized through inter-operability with existing tools. As FERUS involves the manipulation of software specification and inter-operability with other tools, the question of choosing appropriate representation formats is important. In this paper, we discuss the advantages and limitations of ATerms as a manipulation and exchange format in the setting of FERUS. We also present a new, graph-like format, which offers complementary features to a term-based format. Moreover. we present visualization utilities for these formats. (C) 2003 Elsevier Inc. All rights reserved.
引用
收藏
页码:63 / 87
页数:25
相关论文
共 7 条
  • [1] On Describing Terminating Algebraic Specifications Based on Their Models
    Nakamura, Masaki
    Ogata, Kazuhiro
    Futatsugi, Kokichi
    INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, IMECS 2012, VOL I, 2012, : 269 - 274
  • [2] Graph-based traceability: a comprehensive approach
    Hannes Schwarz
    Jürgen Ebert
    Andreas Winter
    Software & Systems Modeling, 2010, 9 : 473 - 492
  • [3] Graph-based traceability: a comprehensive approach
    Schwarz, Hannes
    Ebert, Juergen
    Winter, Andreas
    SOFTWARE AND SYSTEMS MODELING, 2010, 9 (04) : 473 - 492
  • [4] Proving sufficient completeness of constructor-based algebraic specifications
    Nakamura, Masaki
    Gaina, Daniel
    Ogata, Kazuhiro
    Futatsugi, Kokichi
    Lecture Notes in Electrical Engineering, 2015, 373 : 15 - 21
  • [5] Extracting reusable functions by flow graph-based program slicing
    Lanubile, F
    Visaggio, G
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1997, 23 (04) : 246 - 259
  • [6] Towards a unified graph-based framework for dynamic component-based architectures description in Z
    Loulou, I
    Kacem, AH
    Jmaiel, M
    Drira, K
    IEEE/ACS INTERNATIONAL CONFERENCE ON PERVASIVE SERVICES, PROCEEDINGS, 2004, : 227 - 234
  • [7] GraphPyRec: A novel graph-based approach for fine-grained Python']Python code recommendation
    Zong, Xing
    Zheng, Shang
    Zou, Haitao
    Yu, Hualong
    Gao, Shang
    SCIENCE OF COMPUTER PROGRAMMING, 2024, 238