Susan L. Gerhart, David R. Musser, D. H. Thompson, D. A. Baker, R. L. Bates, R. W. Erickson, R. L. London, D. G. Taylor, and D. S. Wile. An overview of AFFIRM: A specification and verification system. In S. H. Lavington, editor, Proceedings of IFIP Congress 80, pages 343-- 347, Tokyo, Japan, October 1980. North-Holland.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....sequence of configurations of an automaton. Examples of the transition based models are finite state machines [Hopcroft 79] S R Model [Aggarwal 87] UCLA graphs [Cerf 72] and Petri nets [Reisig 85] Examples of modeling and analysis tools based on these models are Spanner [Aggarwal 87] Affirm [Gerhart 80] and PROTEAN [Billington 88] Algebraic systems promote hierarchical description and verification, whereas transition based models have the advantage that they are graphical in nature. For this reason, it is sometimes easier to use an algebraic description, and othertimes a transition based ....

S.L.Gerhart, et al., "An Overview of Affirm: A Specification and Verification System", Proc. IFIP 80, pp 343-348, Australia, October 1980.

....formation to development and extension, major publications and frequent appearance of the concept in new programming languages (e.g. CLU [37] as the shift to internal exploration, and . propagation of abstract data types to other technologies such as the Affirm program verification system [23] as the shift to external exploration. Their study ended in 1984, so they did not have the opportunity to note the influence of abstract data types on object oriented programming techniques and on the incorporation of objects classes in new programming languages. As technologies mature, their ....

S.L. Gerhart, D.R. Musser, D.H. Thompson, D.A. Baker, R.L. Bates, R.W. Erickson, R.L. London, D.G. Taylor and D.S. Wile. An Overview of AFFIRM: A Specification and Verification System. Information Processing 80, S. H. Lavington (Ed.), October, 1980, pp. 343-348.

....the order of the operations critical section i and critical section j . Allowing the request operations to be nonatomic means that the order of service does not matter (is not specified) if the requests are issued too close together . 5 All the formal specification methods I know of including [4], 5] 8] 11] 13] 14] 15] 16] 17] and [18] specify FCFS with condition (#) although the formal expression of this condition di#ers with the di#erent methods. These di#erences are irrelevant to the fundamental problem with condition (#) To verify that a Blaise program satisfies ....

Susan Gerhart et al. An Overview of AFFIRM: A Specification and Verification System, IFIP Congress 80, (Oct. 1980).

....Gypsy verification methodology. A fully mechanical proof of a safety property was obtained. What is perhaps more interesting is that the proof was performed with the combined help of two separate verification systems: the Gypsy system [Good, 77] Good, 78a] and the Affirm system [Musser, 80] Gerhart, 80] The modeling and specification effort was a more or less straightforward application of the Gypsy methodology for concurrent programming. In addition, the Alternating Bit Protocol is by now a very well known example problem. Therefore, the following discussion will not dwell on those aspects of ....

Gerhart, S. L., et al, "An Overview of Affirm: A Specification and Verification System," Proc. IFIP, Oct. 1980.

....methods involves two major tasks: program development and theorem proving. Over the last two decades, many prototype tools for program development and theorem proving have been developed to investigate computeraided support for formal methods. These include: HDM [17] EHDM [16] Gypsy [9] Affirm [8, 12, 13], EVES [7] several assistants for the refinement calculus [4, 18, 2] Mural [11] RAISE [14] B [19] Demo2 [15] HOL [10] LF [1] and Nuprl [6] Most of these tools concentrate on the semantic checking and calculation involved in the development steps. Limited attention is given to systematic ....

S.L. Gerhart, D.R. Musser, et al. An overview of AFFIRM: A specification and verification system. In S.H. Lavington, editor, Information Processing 80, Proceedings of IFIP Congress 80, volume 8 of IFIP Congress Series, pages 343--347. NorthHolland Publishing Company, October 1980.

.... VERIFICATION RESEARCH CENTRE DEPARTMENT OF COMPUTER SCIENCE THE UNIVERSITY OF QUEENSLAND Queensland 4072 Australia TECHNICAL REPORT Phone: 61 7 365 1003 Fax: 61 7 365 1533 No. 93 5 Jian Chen and Jun Han A Review of EVES May 1993 A Review of EVES Jian Chen and Jun Han Software Verification Research Centre The University of Queensland, Australia May 1993 Abstract We review EVES, a ....

.... VERIFICATION RESEARCH CENTRE DEPARTMENT OF COMPUTER SCIENCE THE UNIVERSITY OF QUEENSLAND Queensland 4072 Australia TECHNICAL REPORT Phone: 61 7 365 1003 Fax: 61 7 365 1533 No. 93 5 Jian Chen and Jun Han A Review of EVES May 1993 A Review of EVES Jian Chen and Jun Han Software Verification Research Centre The University of Queensland, Australia May 1993 Abstract We review EVES, a tool for supporting formal mathematical ....

[Article contains additional citation context not shown here]

Gerhart, S.L., Musser, D.R., et al., "An Overview of AFFIRM: A specification and verification system", in Information Processing 80, Proceedings of IFIP Congress 80, Lavington, S.H. (ed.), volume 8 of IFIP Congress Series, pages 343-347, North-Holland Publishing Company, October 1980.

....systems components, including the conceptual place of Kit in this stack [Bevier, et al. 89] There are many formal specification languages other than the Boyer Moore logic some of which are supported by mechanical tools. A list of approaches to specification and verification must include Affirm [Gerhart 80] Gypsy [Good, et al. 78] HDM [Robinson Levitt 77] HOL [HOL 87] VDM [Jones 86] and Z [Spivey 88] The purpose of the Kit project was to specify an operating system kernel with a particular process isolation property, and mechanically check the proof of a correct implementation of that ....

S. L. Gerhart, D. R. Musser, D. H. Thompson, D. A. Baker, R. L. Bates, R. W. Erickson, R. L. London, D. G. Taylor and D. S. Wile. An Overview of AFFIRM: A Specification and Verification System. In Information Processing 80, S. H. Lavington (Ed.), pages 343-348. October, 1980. North Holland Publishing Company. 27

....79] theory contains a rather substantial number of theorems that have been mechanically proved to follow from their axioms, and these have been used in proving a variety of programs. A library of proved properties about abstract data types also has developed in conjunction the Affirm system [Gerhart 80] The reason for this association is that mechanical support makes it possible to do enough verifications and proofs so that one can find useful theories. In fact, these mechanical systems may be the essential tools that we need to develop these theories. 18 ....

S. L. Gerhart, D. R. Musser, D. H. Thompson, D. A. Baker, R. L. Bates, R. W. Erickson, R. L. London, D. G. Taylor and D. S. Wile. An Overview of AFFIRM: A Specification and Verification System. In Information Processing 80, S. H. Lavington (Ed.), pages 343-348. October, 1980. North Holland Publishing Company.

....consists of computer exploration of all possible behaviors of the system. Many concurrent systems are based on finite state machines, making them particularly amenable to computer analysis. This approach has been used by many researchers, especially for the verification of communication protocols [Gerhart 80, Aggarwal 84, Blumer 86, West 78, Zafirolpulo 80] There are many existing algorithms to check if a given temporal logic formula is true in the global state transition graph[Clarke 86a, Dill 86] There are two main hurdles to this approach the number of processes may not be known initially, and ....

S.L.Gerhart, et al., "An Overview of Affirm: A Specification and Verification System," Proc. IFIP 80, pp 343-348, Australia, October 1980.

....then hA Omega ; d; Ei is an implementation of A Sigma . The significance of this theorem is that it characterizes implementation in terms of equational rewriting mechanisms. Therefore, the correctness of implementations can be examined with a help of theorem provers such as OBJ [13] and AFFIRM [14]. In the example, the first derivor d was to transfer an architecture with stack to one with memory (From Specification 2. to Specification 3. It is specified as follows: 1. The function is: is identity function except (S) M A] where M and A are the sorts for memory and address of ....

Gerhart, S. L., Musser, D. R., and Thompson, D. H. An overview of AFFIRM: A specification and verification system. In Proceedings IFIP 80 (1980), S. H. Lavington, Ed., North-Holland, pp. 343--348.

....modeled as a configuration of an automaton from which one or more transitions are possible. Examples of the transition based models are finite state machines[12] S R Model[1] UCLA graphs[5] and Petri nets[27] Examples of modeling and analysis tools based on these models are Spanner [1] Affirm [9] and PROTEAN [2] Algebraic systems promote hierarchical description and verification, whereas transition based models have the advantage that they are graphical in nature. For this reason, it is sometimes easier to use an algebraic description, and othertimes a transition based description. We ....

S.L.Gerhart, et al., "An Overview of Affirm: A Specification and Verification System", Proc. IFIP 80, pp 343-348, Australia, October 1980.

....in which the line is drawn somewhere above the highest level executable code in the system. Some verification work addresses code proofs, where traditionally the line has been drawn at the definition of a high level programming language like Gypsy [6, 7, 8] Pascal [19] Fortran [2] and others [20, 5, 13, 17, 4]. There has been some work on compiler verification, notably the work of Polak [15] in which a compiler for a Pascal subset is verified. Finally, there has been some recent work closer to the bottom of the system stack. For example, Gordon [9] and Hunt [10] draw the line essentially at the ....

S. L. Gerhart, D. R. Musser, D. H. Thompson, D. A. Baker, R. L. Bates, R. W. Erickson, R. L. London, D. G. Taylor and D. S. Wile. An Overview of AFFIRM: A Specification and Verification System. Information Processing 80, S. H. Lavington (Ed.), October, 1980, pp. 343-348. North Holland Publishing Company.

No context found.

Susan L. Gerhart, David R. Musser, D. H. Thompson, D. A. Baker, R. L. Bates, R. W. Erickson, R. L. London, D. G. Taylor, and D. S. Wile. An overview of AFFIRM: A specification and verification system. In S. H. Lavington, editor, Proceedings of IFIP Congress 80, pages 343-- 347, Tokyo, Japan, October 1980. North-Holland.

No context found.

Susan Gerhart et al. An Overview of AFFIRM: A Specification and Verification System, IFIP Congress 80, (Oct. 1980).

No context found.

S. Gerhart, "An Overview on AFFIRM: a Specification and Verification System," in Information Processing, Vol. 80 (S.H. Lavington (Ed)), North Holland, 1980, pp. 343-387.

No context found.

Susan L. Gerhart, David R. Musser, D. H. Thompson, D. A. Baker, R. L. Bates, R. W. Erickson, R. L. London, D. G. Taylor, and D. S. Wile. An overview of AFFIRM: A specification and verification system. In S. H. Lavington, editor, Proceedings of IFIP Congress 80, pages 343-- 347, Tokyo, Japan, October 1980. North-Holland.

No context found.

Susan L. Gerhart, David R. Musser, D. H. Thompson, D. A. Baker, R. L. Bates, R. W. Erickson, R. L. London, D. G. Taylor, and D. S. Wile. An overview of AFFIRM: A specification and verification system. In S. H. Lavington, editor, Proceedings of IFIP Congress 80, pages 343-- 347, Tokyo, Japan, October 1980. North-Holland.

No context found.

S. L. Gerhart, D. R. Musser, D. H. Thompson, D. A. Baker, R. L. Bates, R. W. Erickson, R. L. London, D. G. Taylor, and D. S. Wile. An overview of Affirm: A specification and verification system. In S. H. Lavington, editor, Information Processing '80, pages 343--347, Australia, October 1980. IFIP, North-Holland Publishing Company.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC