D. Kapur and D. Musser. Tecton: a framework for specifying and verifying generic system components. Technical Report RPI--92--20, Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York 12180, July 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....and flexible formalism for the specification and verification of software and hardware. They provide a very attractive specification language. Apart from simple functional programs they also allow to describe very complex algebraic data structures. Systems like OBJ3 [14] Larch [15] and Tecton [20] show that term rewriting systems form a natural basis for generic and parameterized programming. They are suitable to for computations both in concrete structures (initial models) and in abstract structures (varieties) Yet a major disadvantage of term rewriting systems is their weak performance, ....

Kapur, D., and Musser, D. R.: Tecton: A framework for specifying and verifying generic system components. Technical Report 92-20, Rennselaer Polytechnic Institute, Troy, New York 12180-3590, 1992.

....choice of basic specification constructs has been to use the notions most familiar to the programming society. Such notions are mainly functions, data types, generic (parameterized) functions and data types, and type constructors (in contrast to such strange notions as universe [1] concept [12], trait [13] sort [14] etc. The author believes that the closer the notions used in a specification language to the notions used in a programming language, the more chances exist that a programmer will ever pay attention to a specification. Another task has been avoidence of any other ....

. D. Kapur and D.R. Musser, Tecton: a framework for specifying and verifying generic system components. Rensselaer Polytechnic Institute, Computer Science Technical Report 92-20, July, 1992.

....say Godel [12] nor in logical environments such as IMPS [8] or Nuprl [5] which all use some form of datatypes for creating term algebras. The same situation can be found in specification systems such as OBJ3 [9] which creates term algebras implicitly from executable specifications or Tecton [16] which does not provide both structures and signatures. Also in the literature about recursive datatypes the authors use sometimes the phrase word algebra for describing datatypes but do not use any explicit term algebra constructor [13, 22] We first discussed the shortcomings of using free ....

Deepak Kapur and David R. Musser. Tecton: a framework for specifying and verifying generic system components. Technical Report RPI--92--20, Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York 12180, July 1992.

No context found.

Deepak Kapur and David Musser, Tecton: a Framework for Specifying and Verifying Generic System Components, Technical Report, SUNY, Albany and RPI, Troy, 1992.

No context found.

D. Kapur and D. R. Musser, Tecton: a framework for specifying and verifying generic system components, RPI Computer Science Department Technical Report 92-20, Troy, NY, July 1992.

..... 39 11.2 Morphisms for Rings . 40 A Indices and References 41 Chapter 1 Introduction We have defined well over 100 algebraic concepts in the concept description language Tecton [5], 4] The main goal of these definitions is to provide a torture test of Tecton; but at the same time we are interested to have a conceptual framework for algorithm specification for a generic library for computer algebra. If the Tecton translator and the generic library evolve in the future the ....

Deepak Kapur and David R. Musser, Tecton: A Framework for Specifying and Verifying Generic System Components, Report 92-20, Department of Computer Science, Rensselaer Polytechnic Institute, Troy, 1992. 1

....out with a very high degree of mathematical rigor. It is also conceivable that processing of this language could be automated to a great degree using algorithmic decision procedures or heuristic arti cial intelligence approaches. Work in this direction and further references can be found in [1, 2, 4]. Given present limitations of computer science and computer hardware, the formal approach may be too restrictive for some. In this document I choose to state concepts in informal natural language, but the framework and terminology are based on a fairly well developed formalism. This de nition of ....

....In the Age of the Smart Machine, to describe the way that information technology could be used to expand knowledge, particularly in the workplace, in contrast to the concerns associated with automating of work. 3 of formal concept analysis [6, 7] and the Tecton concept description language [1, 2, 4]. Formal concept analysis seems heretofore to have been mainly applied to concepts in which the abstractions are merely names or simple descriptions of objects, so that the only real abstraction going on is from objects to concepts, making the types of concept analysis often no more complicated ....

Kapur, D. and Musser, D. R., \Tecton: A Framework for Specifying and Verifying Generic System Components," RPI Computer Science Department Technical Report 92-20, Troy, NY, July 1992.

No context found.

D. Kapur and D.R. Musser, "Tecton: A Framework for Specifying and Verifying Generic System Components," invited talk at TPCD Conf. 1992 (Theorem Provers in Circuit Design), University of Nijmegen, Netherlands, June 22-24, 1992.

....: 31 6. 3 Inference rules and mechanisms : 31 7 Conclusion 32 ii 1 Introduction Tecton (Greek for builder ) is a methodology and tool set for formal specification and verification of computational systems (both hardware designs and software) [19, 20, 23, 24, 21]. In formulating the goals of Tecton and designing its tools, we are seeking to combine many of the key advances in specification and proof technology, from both the authors and many others work on earlier specification language and proof systems. Beyond this, we also seek to simplify the use of ....

....although we have used it to carry out major parts of proofs about generic software components. The major weakness of the system is its specification language, which is essentially just traditional first order logic and Hoare 1 formulas. However, we have designed a new language, also named Tecton [19], in which we attempt to unify and simplify previous research with similar goals, mainly drawing from research on abstract data types and from previous formal specification languages that emphasized behavioral abstraction, including mainly OBJ [13] Larch [16] and an earlier Tecton language ....

[Article contains additional citation context not shown here]

D. Kapur and D.R. Musser, Tecton: a framework for specifying and verifying generic system components, Rensselaer Polytechnic Institute Computer Science Technical Report 92-20, July, 1992. Invited talk at TPCD Conf. 1992 (Theorem Provers in Circuit Design), University of Nijmegen, The Netherlands, June 22-24, 1992.

....the first. In the next section, we show how to formally capture and represent the semantic properties common to all the data types that can be used to replace type parameters (such as InputIterator and OutputIterator) of a generic algorithm. 3 Overview of Tecton Concept Specifications Tecton [8, 9, 10] is a specification language for describing and using abstract concepts in formal software development and hardware design. One of the main goals of Tecton is to reduce the need for proof. Tecton achieves this goal by supporting behavioral abstraction and data abstraction as well. Using behavioral ....

....uses clauses of a concept description D. An algebra X = hS; Fi belongs to D s concept C if and only if X is a member of the intersection of C 1 ; C n and also meets the requirements of D regarded as a simple concept definition. For an explanation of the other kinds of Tecton statements, see [8]. 4 Abstract Implementations Unless it contains a generates clause, a Tecton concept definition does not necessarily define a single abstract data type or even a set of isomorphic abstract data types. For example, in concept definition Associative binary op, the operation is not fully defined ....

D. Kapur and D. R. Musser, Tecton: a framework for specifying and verifying generic system components, Rensselaer Polytechnic Institute Computer Science Technical Report 92-20, July, 1992.

....explicit checks for reaching the end of the sequence being partitioned. We plan to report on this example in a separate paper. We are also experimenting with partial automation of proofs about generic algorithms, using the PVS specification language [12] and prover [13] and the Tecton language [4, 5] and proof system [6] Even if such proofs require extensive human direction and attention to detail, the fact that the algorithms are generic means that the necessary investments of effort can be amortized over the many subsequent uses of the algorithms. These efforts will be the subject of ....

D. Kapur and D. R. Musser, Tecton: a framework for specifying and verifying generic system components, Rensselaer Polytechnic Institute Computer Science Technical Report 92-20, July, 1992. 6

....verifying software mechanically. Since 1990, Kapur, in collaboration with David Musser, has been developing the Tecton proof system. Tecton (Greek for builder ) is a methodology and tool set for formal specification and verification of computational systems (both hardware designs and software) [1, 23, 24], in which RRL is the main inference engine. In formulating the goals of Tecton and designing its tools, we are seeking to combine many of the key advances in specification and proof technology. We also seek to simplify the use of formal methods, making them more accessible to nonexperts and more ....

....obtained without the use of the linear arithmetic procedure. Tecton has been used to prove properties of simple (but efficient) programs on integers, equational programs for sorting and searching, and simple programs using abstract data types. More details about the Tecton system can be found in [24, 23]. 4.3 Attacking Challenge Problems In 1988, RRL was successfully used to attack the so called ring commutativity problems, considered a challenge for theorem provers [56] For the theorem that an associative ring is commutative if every element x satisfies x 3 = x, an automatic proof was ....

Kapur, D., and Musser, D. R. (1992): Tecton: A Framework for Specifying and Verifying Generic System Components. Invited talk at TPCD Conf. 1992 (Theorem Provers in Circuit Design), University of Nijmegen, The Netherlands, June 22--24, 1992.

....high level specification language called Tecton we are developing a syntax and semantics of concept descriptions. Concept descriptions are to be used to express abstraction and specialization as structuring mechanisms in development of computational systems (both hardware designs and software) In [1] we proposed a syntax and semantics for concept descriptions, and gave an extended example of hardware description (a behavioral and structural description of a carry lookahead adder circuit, with the circuit realization given in terms of a generic parallel prefix circuit) The present working ....

....of concept descriptions, including an extended example of software specification (generic parallel reduction and sorting algorithms) At present these examples are only loosely organized and are presented almost entirely without commentary. They are intended to conform to the syntax defined in [1], but since a parser for the language is yet to be implemented, only hand checking has been done. Similarly, it is intended that with the semantics defined in [1] these examples correspond to the familiar algebraic and programming concepts that are implied by our choice of concept names ....

[Article contains additional citation context not shown here]

Deepak Kapur and David R. Musser, "Tecton: a framework for specifying and verifying generic system components," Rensselaer Polytechnic Institute Computer Science TR 92-20, July, 1992 (presented at TPCD Conference 1992 (Theorem Provers in Circuit Design), University of Nijmegan, The Netherlands, June 22-24, 1992).

....describing and using abstract concepts in formal software development and hardware design. The language, based in part on a much earlier but incomplete description of a high level specification language (with the same name and goals) 11, 12] and some of the main proof issues are illustrated in [9] with an extended example of a behavioral and structural description of a carry lookahead adder circuit, with the circuit realization given in terms of a generic parallel prefix circuit. We have also implemented and are currently experimenting with a simple proof command language. ....

D. Kapur and D. R. Musser, Tecton: a framework for specifying and verifying generic system components, Rensselaer Polytechnic Institute Computer Science Department TR 92-20 (1992).

No context found.

D. Kapur and D. Musser. Tecton: a framework for specifying and verifying generic system components. Technical Report RPI--92--20, Department of Computer Science, Rensselaer Polytechnic Institute, Troy, New York 12180, July 1992.

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