Specifying module interfaces with finitely defined automata

被引：0
|
作者：
Janicki, Ryszard [1 ]
机构：
[1] McMaster Univ, Dept Comp & Software, Hamilton, ON L8S 4K1, Canada
来源：
PROCEEDING OF THE 11TH WSEAS INTERNATIONAL CONFERENCE ON COMPUTERS: COMPUTER SCIENCE AND TECHNOLOGY, VOL 4 | 2007年
基金：
加拿大自然科学与工程研究理事会;
关键词：
trace assertion; automata; module interfaces; formal specification;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The use of automata as a specification tool is analyzed. Trace Assertion Method (TAM) is used as an example. TAM is a formal method for specifying module interfaces. It treats the module as a black box, and was designed as an alternative to an algebraic specification technique [1], and became quite popular in the software industry [13]. Finiteness and concurrency issues are discussed.
引用
收藏
页码：108 / +
页数：2
相关论文
共 50 条
  • [1] Automata for specifying component interfaces
    Henzinger, TA
    [J]. IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2003, 2759 : 1 - 2
  • [2] On Finitely Ambiguous Buchi Automata
    Loeding, Christof
    Pirogov, Anton
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018, 2018, 11088 : 503 - 515
  • [3] Finitely Generated Synchronizing Automata
    Pribavkina, Elena V.
    Rodaro, Emanuele
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2009, 5457 : 672 - +
  • [4] Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions?
    Bala, Sebastian
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 86 - 97
  • [5] Finitely ambiguous and finitely sequential weighted automata over fields
    Kostolanyi, Peter
    [J]. THEORETICAL COMPUTER SCIENCE, 2024, 1012
  • [6] AUTOMATA FOR SPECIFYING AND ORCHESTRATING SERVICE CONTRACTS
    Basile, Davide
    Degano, Pierpaolo
    Ferrari, Gian-Luigi
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2016, 12 (04)
  • [7] Some Lessons in Specifying Interfaces
    Lee, Steven
    Shortridge, Keith
    [J]. ASTRONOMICAL DATA ANALYSIS SOFTWARE AND SYSTEMS XXI, 2012, 461 : 841 - 844
  • [8] Complementation of Finitely Ambiguous Buchi Automata
    Rabinovich, Alexander
    [J]. DEVELOPMENTS IN LANGUAGE THEORY, DLT 2018, 2018, 11088 : 541 - 552
  • [9] Collectives of Automata in Finitely Generated Groups
    D. V. Gusev
    I. A. Ivanov-Pogodaev
    A. Ya. Kanel-Belov
    [J]. Mathematical Notes, 2020, 108 : 671 - 678
  • [10] A NOTE ON FINITELY AMBIGUOUS DISTANCE AUTOMATA
    LEUNG, H
    [J]. INFORMATION PROCESSING LETTERS, 1992, 44 (06) : 329 - 331
12345