检索结果-内蒙古大学图书馆

Proof Method for correctness of refinements of algebraic specification in abstract sequential machine style

SYSTEMS AND COMPUTERS IN JAPAN 1996年第5期27卷 25-38页

作者： Okano, K Higashino, T Taniguchi, K Member Faculty of Engineering Science Osaka University Toyonaka Japan 560 Teruo Hipshino received his B.E. M.E.and Ph.D. degrees in Information and Computer Sciences from Osaka University Osaka Japan in 1R9 1981 and 1984 respectively. He joined the Faculty of Osaka University in 1984. Since 1991 he has been an Associate Professor in the Department of Information and Computer Sciences at Osaka University. In 1990 he was a Visiting Researcher of Dept. I.R.O. at University of Montreal Canada. His current research interests include design and analysis of distributed systems specification and verification of communication protocols and formal approach of program design. He is a member of IEEE-CS ACM IEICE of Japan and IPS of Japan.

In this paper, new methods for providing the correctness of refinement among abstract sequential machine style programs are described. The programs are described in algebraic language ASL using some useful notions, i.e., the extended projection and the valid reachability condition for each transition function. These notions allow a designer to refine a given text (program or specification) to a concrete text more freely than the text that does not use such notions. These notions can also enhance the expressive power of the text. On the other hand, these advantages would have lost half their values, if useful methods to prove the correctness of refinement among the texts using them are not found. Thus new methods for proving the correctness of the texts are proposed, and they do not require much proof loads. First, the correctness of refinement among the ASL texts with the extended projection is defined. Second, a method is proposed for proving the correctness of refinement among such texts. Also proposed is a definition of the correctness of refinement among the texts with the valid reachability conditions and a method to prove their correctness. These methods do not require more proof loads than the usual methods for the texts that do not use such notions in the abstract sequential machine style. Therefore, these methods are useful.

关键词： abstract sequential machine ASL language proof algebraic specification

来源：评论

学校读者我要写书评

暂无评论

Run-time consistency checking of algebraic specifications 4

Run-time consistency checking of algebraic specifications

引用

4th Symposium on Testing, analysis, and verification, TAV 1991

作者： Sankar, Sriram Program Analysis and Verification Group Computer Systems Laboratory Stanford University United States

ISBN: (纸本)089791449X

Run-time consistency checking is the process of ensuring that a program is running correctly with respect to its specification. This checking is performed while the program is running. Languages like Pascal and Ada provide run-time consistency checking with respect to a limited repertoire of specifications - for example, one can specify that the values of a variable have to lie within a certain range. Specification languages such as Anna and Larch extend this repertoire with sophisticated specification mechanisms. A popular specification mechanism is the algebraic specification - equations comprising of terms of abstract data type operations which axiomatically specify the abstract data type. In this paper, we discuss how a program can be checked for consistency with respect to algebraic specifications at run-time. The problem is precisely defined and a technique for run-time consistency checking is presented. This technique requires a theorem prover. A specialized theorem prover and its incremental operation are also described. © 1991 ACM.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Exploiting locality in maintaining potential causality 91

Exploiting locality in maintaining potential causality

引用

10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991

作者： Meldal, Sigurd Sankar, Sriram Vera, James Program Analysis and Verification Group Computer Systems Laboratory Stanford University StanfordCA94305 United States

ISBN: (纸本)0897914392

In distributed systems it is often important to be able to determine the temporal relationships between events generated by different processes. An algorithm to determiue such relationships is presented in [3] and [5]. This algorithm has many favorable attributes such as it allows for any kind of interprocess communication, and it requires no extra synchronization messages, additional communication links or central time stamping authority. The algorithm, however, requires O(n) space for each process (where n is the number of processes). i.e., it requires an overall space of O(n2). This can be a large overhead especially when there are a very large number of processes. By cutting down on this generality, we can significantly decrease the amount of space required to determine temporal relationships. In this paper, we show how one may reduce the space requirements by assuming that the communication links between processes is static and known ahead of time;and also that one is interested only in determining the temporal ordering between messages arriving at the same process. We argue that these assumptions are reasonable to make for a large class of problems. © 1991 ACM.

关键词：

来源：评论

学校读者我要写书评

暂无评论

AN ALGEBRAIC SPECIFICATION OF THE PARTIAL ORDERS GENERATED BY CONCURRENT ADA COMPUTATIONS

AN ALGEBRAIC SPECIFICATION OF THE PARTIAL ORDERS GENERATED B...

引用

CONF ON ADA TECHNOLOGY IN CONTEXT : APPLICATION, DEVELOPMENT, AND DEPLOYMENT ( TRI-ADA 89 )

作者： BRYAN, D Program Analysis and Verification Group Computer Systems Laboratory Stanford University United States

来源：评论

学校读者我要写书评

暂无评论

Storage reclamation models for adat programs

Storage reclamation models for adat programs

引用

1987 Annual ACM SIGAda International Conference on Ada, SIGAda 1987

作者： Mendal, Geoffrey O. Program Analysis and Verification Group Computer Systems Laborakory Stanford University StanfordCA94305 United States

ISBN: (纸本)0897912438

Given Ada's semantics regarding dynamically allocated objects, do programmers believe that storage reclamation is impractical? At first glance, it would appear that given these semantics, one cannot derive workable models for reclaiming all unneeded objects. III reality, Ada provides features that allow programmers to define storage recla mation models that operate at close to 100 percent capacity. This paper describes methods by which Ada programs can reclaim objects. Examples of Ada storage reclamation models are presented along with their associated algorithms. A taxonomy of units that perform storage reclamation is also discussed.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Task sequencing language for specifying distributed Ada systems

Task sequencing language for specifying distributed Ada syst...

引用

CRAI Workshop on Software Factories and Ada, 1986

作者： Luckham, D.C. Helmbold, D.P. Meldal, S. Bryan, D.L. Haberler, M.A. Program Analysis and Verification Group Computer Systems Laboratory Stanford University StanfordCA94305 United States

ISBN: (纸本)9783540183419

TSL-1 is a language for specifying sequences of tasking events occuring in the execution of distributed Ada programs. Such specifications are intended primarily for testing and debugging of Ada tasking programs, although they can also be applied in designing programs. TSL-1 specifications are included in an Ada program as formal comments. They express constraints to be satis fied by the sequences of actual tasking events. An Ada program is consistent with its TSL-1 specifications if its runtime behavior always satisfies them. This paper presents an overview of TSL-1. The features of the language are described informally, and examples illustrating the use of TSL-1, both for debugging and for specification of tasking programs, are given. A definition of robust TSL-1 specifications that takes into account uncertainty in runtime observation of behavior of distributed systems is given. A runtime monitor for checking consistency of an Ada program with TSL-1 specifications has been implemented. In the future, constructs for defining abstract tasks will be added to TSL-1, forming a new language, TSL-2, for the specification of distributed systems prior to their implementation in any particular programming language. © 1987, Springer-Verlag.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Task sequencing language for specifying distributed Ada systems TSL-1 1st

引用

1st International Conference on Parallel Architectures and Languages Europe, PARLE 1987

作者： Luckham, D.C. Helmbold, D.P. Bryan, D.L. Haberler, M.A. Program Analysis and Verification Group Computer Systems Laboratory Stanford University StanfordCA94305 United States

ISBN: (纸本)9783540179450

TSL-1 is a language for specifying sequences of tasking events occuring in the execution of distributed Ada1 programs. TSL-1 specifications are included in an Ada program as formal comments. They express constraints to be satisfied by the sequences of actual tasking events that can occur. An Ada program is consistent with its TSL-1 specifications if its runtime behavior satisfies them. This paper presents an overview of TSL-1. The features of the language are described informally, and examples illustrating the use of TSL-1, both for debugging and for specification of tasking programs, are given. Some important constructs, as well as topics related to uncertainty of observation of distributed programs, are dealt with in other papers. In the future, constructs for defining abstract units will be added to TSL-1, forming a new language TSL-2 for the specification of distributed systems prior to their implementation in any programming language. © 1987, Springer-Verlag.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Storage reclamation models for Ada programs 87

Storage reclamation models for Ada programs

引用

Proceedings of the 1987 annual ACM SIGAda international conference on Ada

作者： Geoffrey O. Mendal Program Analysis and Verification Group Computer Systems Laborakory Stanford University Stanford California

ISBN: (纸本)9780897912433

Given Ada's semantics regarding dynamically allocated objects, do programmers believe that storage reclamation is impractical? At first glance, it would appear that given these semantics, one cannot derive workable models for reclaiming all unneeded objects. In reality, Ada provides features that allow programmers to define storage reclamation models that operate at close to 100 percent capacity. This paper describes methods by which Ada programs can reclaim objects. Examples of Ada storage reclamation models are presented along with their associated algorithms. A taxonomy of units that perform storage reclamation is also discussed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TSL: Task sequencing language 85

TSL: Task sequencing language

引用

1985 Annual ACM SIGAda International Conference on Ada, SIGAda 1985

作者： Helmbold, David Luckham, David Program Analysis and Verification Group Computer Systems Laboratory Stanford University StanfordCA94305 United States

ISBN: (纸本)0897911628

TSL is a language for specifying sequences of tasking events in Ada1 programs. TSL specifications are submitted with an Ada program and are monitored at runtime for consistency with the actual tasking events as they occur. This paper presents a preliminary design for TSL, an informal overview of its capabilities, and an operational semantics. © Proceedings of the 1985 Annual ACM SIGAda International Conference on Ada, SIGAda 1985. All rights reserved.

关键词： Ada (programming language)

来源：评论

学校读者我要写书评

暂无评论

An implementation of Anna 85

An implementation of Anna

引用

1985 Annual ACM SIGAda International Conference on Ada, SIGAda 1985

作者： Sankar, Sriram Rosenblum, David Neff, Randall Program Analysis and Verification Group Computer Systems Laboratory Stanford University StanfordCA94305 United States

ISBN: (纸本)0897911628

Anna is a language extension of Ada to include facilities for formally specifying the intended behavior of Ada programs. It augments Ada with precise machine-processable annotations so that well established formal - methods of specification and documentation can be applied to Ada programs. This paper describes an implementation of a subset of Anna. The implementation is a transformer that accepts as input an Anna parse tree and produces as output an equivalent Ada parse tree that contains the necessary executable runtime checks for the Anna specifications. An approach called the Checking Function Approach is used. This involves the generation of a function for each annotation and generating calls to these functions at appropriate places. The transformer has to take care of various details like hiding, overloading, nesting, etc. It is hoped that the transformer will eventually cover most of Anna and have various features like a good user interface, interaction with a symbolic debugger, and optimization of runtime checks for permanent inclusion. © Proceedings of the 1985 Annual ACM SIGAda International Conference on Ada, SIGAda 1985. All rights reserved.

关键词： User interfaces

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：