发布求助
文献互助 智能选刊 最新文献

ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods最新文献

筛选
英文 中文
SPIN vs. VIS: a case study on the formal verification of the ATMR protocol SPIN vs. VIS: ATMR协议正式验证的案例研究
ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods Pub Date : 2000-09-04 DOI: 10.1109/ICFEM.2000.873808
Hong Peng, S. Tahar, F. Khendek
{"title":"SPIN vs. VIS: a case study on the formal verification of the ATMR protocol","authors":"Hong Peng, S. Tahar, F. Khendek","doi":"10.1109/ICFEM.2000.873808","DOIUrl":"https://doi.org/10.1109/ICFEM.2000.873808","url":null,"abstract":"Nowadays, there exist a wide variety of verification tools. Some, like the SPIN model checker, are designed and mainly used for the verification of interleaving software systems, such as communication protocols. Others, like VIS (Verification Interacting with Synthesis), are designed and used for synchronous hardware systems verification. In this paper, we compare and contrast SPIN and VIS. In particular, we devote a special attention to the efficiency of these tools for the verification of communications protocols that can be implemented either in software or hardware. As a basis of our comparison, we formally describe and verify the ATMR (Asynchronous Transfer Mode Ring) medium access protocol using SPIN, and its hardware implementation using VIS. We believe that this study is of particular interest, as more and more protocols, like the ATM protocol stack, are being implemented in hardware in order to match high speed requirements. However, this is not a formal comparison of SPIN and VIS.","PeriodicalId":290677,"journal":{"name":"ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130032853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Formal treatment of a family of fixed-point problems on graphs by CafeOBJ 图上一类不动点问题的形式化处理
ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods Pub Date : 2000-09-04 DOI: 10.1109/ICFEM.2000.873806
T. Tamai
{"title":"Formal treatment of a family of fixed-point problems on graphs by CafeOBJ","authors":"T. Tamai","doi":"10.1109/ICFEM.2000.873806","DOIUrl":"https://doi.org/10.1109/ICFEM.2000.873806","url":null,"abstract":"A family of well-known problems on graphs, including the shortest path problem and the data flow analysis problem, can be uniformly formulated as a fixed-point problem on graphs. We specify this problem and its solution algorithm in a highly abstract manner, fully exploiting the parametrized module construct of CafeOBJ, an algebraic specification language. The objective of our research is to explore the effectiveness of formal methods, applying them not just to specific safety-critical programs but to general problems covering a wide range of applications.","PeriodicalId":290677,"journal":{"name":"ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124954545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Formal foundations of object-oriented modeling notations 面向对象建模符号的正式基础
ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods Pub Date : 2000-09-04 DOI: 10.1109/ICFEM.2000.873810
C. Pons, G. Baum
{"title":"Formal foundations of object-oriented modeling notations","authors":"C. Pons, G. Baum","doi":"10.1109/ICFEM.2000.873810","DOIUrl":"https://doi.org/10.1109/ICFEM.2000.873810","url":null,"abstract":"Describes and classifies the different solutions that have been proposed to realize the integration of graphic modeling languages, which are known and accepted by software developers, with formal modeling languages having analysis and verification tools. Inspired by that classification, we define a new integration proposal, based on first-order dynamic logic. The principal benefits of the proposed formalization can be summarized as follows. (i) The different views of a system are integrated in a single formal model; this allows us to define compatibility rules between the separate views, on both a syntactic and a semantic level. (ii) Using formal manipulation, it is possible to deduce further knowledge from the specification. (iii) Faults in the specifications, expressed using a user-friendly notation, can be revealed using analysis and verification techniques based on the formal kernel model. The principal difference between this model and other object-oriented formal models is that it integrates both of the levels in the modeling notation architecture into a single conceptual framework. The integration of modeling entities and modeled entities into a single formalism allows us to express both static and dynamic aspects of either the model or the modeled system within a first-order formalism.","PeriodicalId":290677,"journal":{"name":"ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127569697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 25
ClawZ: control laws in Z ClawZ: Z中的控制律
ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods Pub Date : 2000-09-04 DOI: 10.1109/ICFEM.2000.873817
R. Arthan, P. Caseley, C. O'Halloran, Alf Smith
{"title":"ClawZ: control laws in Z","authors":"R. Arthan, P. Caseley, C. O'Halloran, Alf Smith","doi":"10.1109/ICFEM.2000.873817","DOIUrl":"https://doi.org/10.1109/ICFEM.2000.873817","url":null,"abstract":"ClawZ is a prototype tool whose objective is to link the Simulink(R) control engineering tool from MathWorks, with the ProofPower(R) dialect of Z. It provides a bridge between the use of Simulink to define control law diagrams and a tool to formally prove compliance between Ada and Z. The tool has been used as part of the formal proof of a nonlinear dynamic inversion flight control system comprising 37 pages of diagrams, 45 pages of Z and 1200 lines of non-comment Ada.","PeriodicalId":290677,"journal":{"name":"ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133942978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 55
A case study in partial specification: consistency and refinement for Object-Z 部分规范的案例研究:Object-Z的一致性和细化
ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods Pub Date : 2000-09-04 DOI: 10.1109/ICFEM.2000.873818
C. Taylor, J. Derrick, E. Boiten
{"title":"A case study in partial specification: consistency and refinement for Object-Z","authors":"C. Taylor, J. Derrick, E. Boiten","doi":"10.1109/ICFEM.2000.873818","DOIUrl":"https://doi.org/10.1109/ICFEM.2000.873818","url":null,"abstract":"The 'viewpoint' approach, in which a system is described by several partial specifications, has been proposed as a way of making complex computing systems more understandable. The ISO's Open Distributing Processing (ODP) framework is an architecture for open distributed systems, involving five named viewpoints. This paper compares two partial specifications of a lending library-from the ODP's Enterprise and Information Viewpoints-and discusses the relation between them. Both specifications are written in Object-Z, an object-oriented variant of Z. Examining how such partial specifications might be unified raises broader issues of refinement and mutual consistency of partial specifications in Object-Z.","PeriodicalId":290677,"journal":{"name":"ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods","volume":"32 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125708666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Maximally abstract retrenchments 最大限度地抽象缩减
ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods Pub Date : 2000-09-04 DOI: 10.1109/ICFEM.2000.873813
R. Banach
{"title":"Maximally abstract retrenchments","authors":"R. Banach","doi":"10.1109/ICFEM.2000.873813","DOIUrl":"https://doi.org/10.1109/ICFEM.2000.873813","url":null,"abstract":"The more obvious and well known drawbacks of using refinement as the sole means of progressing from an abstract model to a concrete implementation are reviewed. Retrenchment is presented in a simple partial correctness framework as a more flexible development concept for formally capturing the early and otherwise preformal stages of development, and briefly justified. Given a retrenchment from an abstract to a concrete model, the problem of finding a model at the level of abstraction of the abstract model, but refinable to the concrete one, is examined. A construction is given that solves the problem in a universal manner, there being a canonical factorisation of the original retrenchment, into a retrenchment to the universal system followed by an I/O-filtered refinement. The universality amounts to the observation that the retrenchment component of any similar factorisation, factors uniquely through the universal model. The construction's claim to be at the right level of abstraction is supported by an idempotence property. The consequences of including termination criteria in the formal models is briefly explored.","PeriodicalId":290677,"journal":{"name":"ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130113788","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Translating UAN into CSP 将UAN转换为CSP
ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods Pub Date : 2000-09-04 DOI: 10.1109/ICFEM.2000.873812
Ian MacColl, D. Carrington
{"title":"Translating UAN into CSP","authors":"Ian MacColl, D. Carrington","doi":"10.1109/ICFEM.2000.873812","DOIUrl":"https://doi.org/10.1109/ICFEM.2000.873812","url":null,"abstract":"We define a translation from the User Action Notation (UAN) to the process algebra Communicating Sequential Processes (CSP). UAN is an informal notation, used for task modeling and design. Translating a UAN task description to CSP provides a base for rigorous development of an interactive system. The resulting CSP description is a suitable abstract starting point for development, as it describes externally visible behaviour with no mention of presented or underlying state. Our translation covers all UAN constructs except for waiting, interruptibility and true concurrency which cannot be expressed in interleaving, un-timed CSP. Our approach integrates task models, typically based on user-oriented concerns, into rigorous development which is typically system-oriented. It provides a bases for a framework for formal development of interactive systems.","PeriodicalId":290677,"journal":{"name":"ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123863724","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
An integrated CSP-based tool for the visualisation, animation and performance evaluation of message passing algorithms 一个集成的基于csp的工具，用于消息传递算法的可视化、动画和性能评估
ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods Pub Date : 2000-09-04 DOI: 10.1109/ICFEM.2000.873819
A. Abdallah, Mark Green
{"title":"An integrated CSP-based tool for the visualisation, animation and performance evaluation of message passing algorithms","authors":"A. Abdallah, Mark Green","doi":"10.1109/ICFEM.2000.873819","DOIUrl":"https://doi.org/10.1109/ICFEM.2000.873819","url":null,"abstract":"This paper presents ongoing research and development on an integrated tool for the visualisation and animation of message-passing communicating systems described in Hoare's CSP (Communicating Sequential Processes). It introduces major new developments to the original VisualNets implemented in C++ and reported in (Abdallah, 1998). The new tool is implemented partly in Java and partly in the functional programming language Haskell. Not only does the new tool enjoy greater expressive power and a better user interface, it has new capabilities for aiding the user in animating, analysing and reasoning about CSP specifications. These include provisions for nested parallelism within a single node, improved profiling and animation, and the possibility of applying generic timing cost models for performance evaluation. The paper briefly describes the new features, explains the methods by which they have been implemented and illustrates their use with examples.","PeriodicalId":290677,"journal":{"name":"ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125782700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Formal derivation of multilayered hardware/software structures 多层硬件/软件结构的形式化推导
ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods Pub Date : 2000-09-04 DOI: 10.1109/ICFEM.2000.873800
T. Plaks
{"title":"Formal derivation of multilayered hardware/software structures","authors":"T. Plaks","doi":"10.1109/ICFEM.2000.873800","DOIUrl":"https://doi.org/10.1109/ICFEM.2000.873800","url":null,"abstract":"Presents a formal method for synthesising multi-layered regular processor arrays from algorithm specifications. A multi-layered array is a structure where 2D sub-arrays are connected into a 3D array only by one edge, and thus it fits, for example, the structure of a motherboard with FPGA daughter-boards. The synthesis of multi-layerd structures requires the extensive use of algebraic transformations, which is not possible using the classical regular array theory. We apply the iso-plane method which was developed for mapping reductions into regular arrays. In this paper, we further develop the iso-plane method and use it in a more general case - for decomposing a problem into parallel, loosely coupled parts (layered); we provide the conditions for regularly increasing the degree of parallelism in the problem specification; and we introduce partial lexicographic orders for data propagation and provide the conditions for mapping these data propagation structures on to arrays.","PeriodicalId":290677,"journal":{"name":"ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods","volume":"11 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131687726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Using use cases in Executable Z 使用可执行文件Z中的用例
ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods Pub Date : 2000-09-04 DOI: 10.1109/ICFEM.2000.873811
W. Grieskamp, M. Lepper
{"title":"Using use cases in Executable Z","authors":"W. Grieskamp, M. Lepper","doi":"10.1109/ICFEM.2000.873811","DOIUrl":"https://doi.org/10.1109/ICFEM.2000.873811","url":null,"abstract":"Use cases are a widespread informal method for specifying the requirements of a technical system in the early development phase. Z is a formal notation which aims to support, beside others, the specification of early requirements. We develop a representation of use cases in Z and apply it to several examples. Our focus is on instrumenting the formalization for black-box test evaluation in Executable Z, a computation model and implementation for Z based on concurrent constraint resolution.","PeriodicalId":290677,"journal":{"name":"ICFEM 2000. Third IEEE International Conference on Formal Engineering Methods","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123624835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 29
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书