PROOFS - APPLICATION ENGINEERING BASED ON FORMAL METHODS

被引:0
|
作者
VANHEE, K
HILDEBRAND, T
COPELLI, S
机构
[1] EINDHOVEN UNIV TECHNOL,5600 MB EINDHOVEN,NETHERLANDS
[2] SLIGOS,PARIS,FRANCE
[3] PRISMA,FLORENCE,ITALY
来源
MICROPROCESSING AND MICROPROGRAMMING | 1992年 / 35卷 / 1-5期
关键词
D O I
10.1016/0165-6074(92)90290-N
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The objective of the PROOFS project is to show that formal methods, are useful for the development of distributed industrial applications. Several application areas have been taken into account. A common feature of the selected applications is that they are heterogeneous, distributed systems. Since different aspects of a system have to be described and analyzed, different formalisms should be used. Instead of defining a new integrated formalism that covers all the aspects, in PROOFS guidelines are developed to integrate in a coherent way several existing formalisms. As a consequence 'linking' of formalisms and related methods and tools will be attempted instead of 'merging' them. In this paper we give an overview of the project as a whole, of the applications we have chosen to test formal techniques and of the problems of linking formalisms, methods and supporting tools.
引用
收藏
页码:29 / 36
页数:8
相关论文
共 50 条
  • [41] Formal polytypic programs and proofs
    Verbruggen, Wendy
    De Vries, Edsko
    Hughes, Arthur
    [J]. JOURNAL OF FUNCTIONAL PROGRAMMING, 2010, 20 : 213 - 270
  • [42] Formal proofs and decision making
    Finsler, P
    [J]. MATHEMATISCHE ZEITSCHRIFT, 1926, 25 : 676 - 682
  • [43] Mining the Archive of Formal Proofs
    Blanchette, Jasmin Christian
    Haslbeck, Maximilian
    Matichuk, Daniel
    Nipkow, Tobias
    [J]. INTELLIGENT COMPUTER MATHEMATICS, CICM 2015, 2015, 9150 : 3 - 17
  • [44] TRANSLATION OF FORMAL PROOFS INTO ENGLISH
    CHESTER, D
    [J]. ARTIFICIAL INTELLIGENCE, 1976, 7 (03) : 261 - 278
  • [45] Autarkic computations in formal proofs
    Barendregt, H
    Barendsen, E
    [J]. JOURNAL OF AUTOMATED REASONING, 2002, 28 (03) : 321 - 336
  • [46] ONTOLOGICAL PURITY FOR FORMAL PROOFS
    Martinot, Robin
    [J]. REVIEW OF SYMBOLIC LOGIC, 2024, 17 (02): : 395 - 434
  • [47] Formal proofs for fuzzy logic based communication scheduling policies
    Willden, G
    Price, J
    Abbott, B
    Ibaroudene, D
    [J]. International Conference on Computing, Communications and Control Technologies, Vol 1, Proceedings, 2004, : 229 - 234
  • [48] Streams and strings in formal proofs
    Carbone, A
    [J]. THEORETICAL COMPUTER SCIENCE, 2002, 288 (01) : 45 - 83
  • [49] Formal foundations for software engineering methods - Introduction
    Hussmann, H
    [J]. FORMAL FOUNDATIONS FOR SOFTWARE ENGINEERING METHODS, 1997, 1322 : 1 - +
  • [50] SOFTWARE ENGINEERING - FORMAL METHODS .1.
    DEMAN, J
    [J]. MICROPROCESSING AND MICROPROGRAMMING, 1988, 24 (1-5): : 361 - 361