Joseph Goguen, Claude Kirchner, Helene Kirchner, Aristide M'egrelis, and Jos'e Meseguer. An introduction to OBJ3. In Jean-Pierre Jouannaud and Stephane Kaplan, editors, Proceedings of the Workshop on Conditional Term Rewriting Systems (Orsay, France), pages 258--263. Springer-Verlag LNCS 308, Berlin, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....which binds any process algebra with any algebraic specification formalism. We detail this single suggestion since it includes the two others. We begin with a quick survey of the formalisms concerned by this extension. For algebraic specifications, there are mainly ACT ONE [17] ASF [4] OBJ [19, 22], ASL [52] Larch [24] CLEAR [9] PLUSS [6] CASL [15] etc. Concerning process algebras, we cite CCS [36] CSP [26] ACP [5] basic LOTOS [7] calculus [37, 38] etc. Generalization of the Algebraic Specification Language A first idea is to conserve the CASL formalism as a target language. ....

J. Goguen, C. Kirchner, H. Kirchner, A. Megrelis, J. Meseguer, and T. Winkler. An Introduction to OBJ-3. In J.-P. Jouannaud and S. Kaplan, eds., Proceedings of the 1st International Workshop on Conditional Term Rewriting Systems, France, volume 308 of Lecture Notes in Computer Science, pages 258--263. SpringerVerlag, 1987. Also as internal report CRIN: 88-R-001.

....their source rules (r 1 ) to get a normalisation trace of t w.r.t. R (in the sense of normal rewriting) T R t = fhr2; 1i; hr2; 1:2i; hr1; ig. Notice that applying an innermost strategy on t using the rules in R leads to in nite reductions. 8 Related Work Lazy rewriting can be obtained in OBJ [9] and CafeOBJ [6] using operator evaluation strategy (E strategy) where each operator (function symbol) has its own evaluation order. There are two suggested ways to simulate lazy rewriting by E strategy: i) omit lazy arguments from local strategy of its function symbol (ii) use negative ....

J. A. Goguen, J.M. Winkler, J. Meseguer, K. Futatsugi, and J-P. Jouannaud. An introduction to OBJ. In J A. Goguen and G. Malcolm, editors, Software engineering with OBJ, Advances in Formal Methods. Kluwer Academic Publishers, 2000.

....[Broy, 81] introduces the proprieties of composition from the point of view of category theory. Parameterization is subject to very intensive research. A good introduction with reasonable examples can be found in [Goguen, 85a] There is some philosophy in [Goguen, 85b] It is interesting to read [Goguen, 79] where a working language is presented with many examples. Wagner, 81] is more formal, but still readable. This last paper was presented to a congress in [Tatcher, 82] in a more formal style. If the reader wants brain food, he may try [Ehrig, 81] At least there are several interesting examples. ....

J.A. Goguen and J.J. Tardo. An Introduction to OBJ. IEEE Conf. Spec. for Reliable Software, M.I.T. April, 1979. pp. 170-189.

....to take note of some metrics that characterize these kinds of projects. In Table 1 we summarized the 5 components. In the second column you find an entity called eqs. This abbreviation stands for equations that are encodings of conditional term rewriting rules possibly containing negative premises [71, 69, 45, 52, 79]. Such term rewriting systems are a very powerful means to succinctly express, e.g. code transformations. These term rewriting systems can be compiled into executables [68, 107, 23, 18, 43, 44] In this example the implementation discussed in [23, 18] was used. The executables that were built are ....

J.A. Goguen, C. Kirchner, H. Kirchner, A. M'egrelis, J. Meseguer, and T. Winkler. An introduction to OBJ3. In S. Kaplan and J.-P. Jouannaud, editors, Conditional Term Rewriting Systems (CTRS '88), volume 308 of Lecture Notes in Computer Science, pages 258--263. Springer-Verlag, 1988.

....performed by the system and hidden from the user (specifier) 6 Related work Methods to handle exceptional states in algebraic specification is a much discussed subject [9] however type errors encountered during type checking are not exceptions of this nature. Order sorted algebras [8] allow errors to be dealt in separate sorts. This by itself does not help modularization, whereas our recommended style could be used in that context. Thus specifiers of type checkers need not be bothered about building the error propagation machinery from the start. In Section 3 we compared our ....

J. Goguen, C. Kirchner, H. Kirchner, A. M'egrelis, J. Meseguer, and T. Winkler. An introduction to OBJ3. In S. Kaplan and J.-P. Jouannaud, editors, Proceedings of the First International Workshop on Conditional Term Rewriting Systems, volume 308 of Lecture Notes in Computer Science, pages 258--263. Springer-Verlag, 1988.

....chosen to be both terminating (there is no infinite sequence of rewrites) and confluent (applying rules to overlapping subterms gets the same result in the end) so that the order and position where rules are applied makes no difference to the final result. Some examples of such models are OBJ [97 99], a functional language whose semantics is based on equational logic, and Maude [136, 151, 152, 203] An example, based on one in [139] will give the flavor of this approach. The following is a functional module for polynomial differentiation, assuming the existence of a module that represents ....

Joseph Goguen, Claude Kirchner, H'el'ene Kirchner, Aristide M'egrelis, Jos'e Meseguer, and Tim Winkler. An introduction to OBJ3. In Lecture Notes in Computer Science, volume 308, pages 258--263, 1994.

....and modification of software requirements. It has three main tasks: knowledge representation and reasoning, interaction with the human analyst, and domain specific knowledge maintenance. 1 An indirect approach to requirements analysis is the use of executable specification languages. OBJ [22] and PAISLey [39] are two well established executable specification languages. We have also developed an executable specification language that can be used effectively for rapid protoytping [6, 7] The FORREST project [14, 21] has synthesized a formal specification language based on modal logic. ....

Goguen, J. and T. Winkler, Introduction to OBJ3, SRI International (1988).

....take account of properties given by the user. Moreover, it must be able to help to prove or disprove some of the properties suggested by the programmer. 1. 1 ations in f nctional pro rams Either a purely functional fragment of a language like ML or a fragment of an order sorted language like OBJ [10] can be considered as a good candidate for a specification language. It is relatively easy to write or to translate a specification with such languages in an equational form. We will consider a specification given by: ffl a signature 6 composed of a set of sort symbols and a set of function ....

....R if all its ground instances are R reducible. An equation s = t is an inductive theorem (or inductive consequence of E if for any ground substitution oe, oe(s) oe(t) 1. 3 hec in properties of enrichments Using equational logic as a programming language was proposed by O Donnell [17] by Gogen [10] and by Dershowitz [8] An operational semantics can be given to functions defined by equations by using term rewriting systems. We consider programs presented in a specification S = 6; E) by a set of equations E. The specification S is constructed by successive enrichments of a specification S ....

J. Goguen and C. Kirchner and H. Kirchner and A. Megrelis and J. Meseguer and T. Winkler. An introduction to OBJ-3. In Proceedings of the 1rst Intern. Workshop on Conditional Term Rewriting Systems, Lecture Notes in Computer Science 308, 1988.

....For example, a complete set of uni ers must be produced during each superposition in a completion procedure or during a proof by consistency of an inductive theorem. A complete set of matchers must also be computed for each reduction step in conditional rewriting, as it is done, e.g. in OBJ (Goguen et al. 1987; Jouannaud et al. 1992) or LP (Garland and Guttag, 1989; Garland and Guttag, 1991) Assume that E is some nitary equational theory and A is an algorithm such that, given two terms s and t as input, the algorithm A returns a minimal complete set of Ematchers (E uni ers) of s and t, if s and t ....

Goguen, J., Kirchner, C., Kirchner, H., M#grelis, A., Meseguer, J., and Winkler, T. (1987). An introduction to OBJ-3. In Jouannaud, J.-P. and Kaplan, S., editors, Proceedings 1st International Workshop on Conditional Term Rewriting Systems, Orsay (France), volume 308 of Lecture Notes in Computer Science, pages 258263. Springer-Verlag.

....related work by other researchers. In Section 5, we conclude our current findings and make suggestions for future work. 2. SELECTION OF TEST CASES 2. 1 Background Equivalent Terms as Test Cases Algebraic specifications have been widely used to specify target programs [Ehrig and Mahr 1985; Goguen et al. 1978; 1988; 1992] An algebraic specification for a class consists of a syntax declaration and a semantic specification. The syntax declaration lists the operations involved, plus their domains and co domains, corresponding to the input and output parameters of the operations. The semantic specification ....

Goguen, J.A., Kirchner, C., Kirchner, H., Megrelis, A., and Meseguer, J. 1988. An introduction to OBJ3. In Conditional Term Rewriting Systems: Proceedings of 1st Workshop, S. Kaplan and J.- P. Jouannaud, Eds. Lecture Notes in Computer Science, Vol. 308. Springer-Verlag, Berlin, 258263.

....The result of the impressive KORSO project [2] and documented in [3] It is supported by KIV, the Karlsruhe Interactive Verifier [27] It uses loose semantics and a higher order specification language. OBJ The algebraic language based on initial algebra semantics. See [9] Now updated to OBJ3 [8] with extensive tool support, based on term rewriting. HOL Higher Order Logic [11] Mainly a theorem prover, but some people use it has a specification language. Based on LCF [10] it uses Church s simple type theory [4] to define a higher order logic. It comes equipped with a powerful tactical ....

J. Goguen, C. Kirchner, H. Kirchner, A. M'egrelis, and J. Meseguer. An introduction to obj3. In J. J. Jouannaud and S. Kaplan, editors, Conference on Conditional Term Rewriting, number 308 in LNCS, pages 258--263, 1988.

....of term rewriting systems. Some of them supports algebraic specifications (ASF [1] ASSPEGIQE [2] other are rewriting laboratories based on Knuth Bendix algorithm for computing canonical systems from a set of equational axioms (REVEUR3 [6] for instance) The languages of OBJ family [3] and O Donnell s languages [11] are the basis for equational programming. Rewriting technique was used in ANALITIC [13] which is in some sense the prototype of APS. It is used in Mathematica TM [14] and other computer algebra systems. In the difference from traditional approach oriented to the ....

J. Gogen, C. Kirchner, H. Kirchner, A. Megrelis, and T. Wincler. An introduction to OBJ-3. In Jouannaud and Kaplan [5].

....arithmetic [LIN 95] One of the most important features of interval arithmetic in relation to its predecessors is efficiency. The introduction of the type interval into a programming language, has always had the main goal of solving algorithms with verified validation. This work uses OBJ3 [GOG 93] to formalize the type interval through some of its algebraic and topological properties. OBJ3 is a functional language and also includes mechanisms for theorem proving. The contribution of this article consists in using an algebraic language to formally specify the type interval and to perform ....

....of the actual value. The interval representation provides information about the computed value what a single number can not do. 2 An Overview of OBJ3 OBJ3 is the latest in a series of OBJ systems, all based upon first order equational logic. A detailed description of OBJ3 can be found in [GOG 93] In this section it is given a brief overview of the system (based on Release 2) OBJ3 is a general purpose declarative language, especially useful for specification and prototyping. A specification in OBJ3 is a collection of modules of two kinds: theories and objects. A theory has loose ....

[Article contains additional citation context not shown here]

GOGUEN, J. A., WINKLER, T., MESEGUER, J., FUTATSIGI, K. and JOUANNAUD, J. P. Introduction to OBJ, SRI International, 1993.

....if the semantics is purely loose, but is undecidable if we work in an initial semantics [14] In the second case, one has to check properties on classes of algebras, which is hard to do automatically. Consequently, in almost all specification languages (e.g. PLUSS [11, 6, 7] ACT TWO [9] OBJ [10, 12], such verifications are left to the user. In this paper, we show that such verifications can partly be done automatically. We describe the model inference system used by the specification language lpg to control instantiation of generic modules. lpg (Langage de Programmation ....

J.A. Goguen, C. Kirchner, H. Kirchner, A. M'egrelis, J. Meseguer, and T. Winkler. An introduction to OBJ3. In Proceedings of the 1 st International Workshop on Conditional Term Rewriting Systems, number 308 in LNCS, pages 258--263. Springer -Verlag, 1987.

No context found.

Joseph Goguen, Claude Kirchner, Helene Kirchner, Aristide M'egrelis, and Jos'e Meseguer. An introduction to OBJ3. In Jean-Pierre Jouannaud and Stephane Kaplan, editors, Proceedings of the Workshop on Conditional Term Rewriting Systems (Orsay, France), pages 258--263. Springer-Verlag LNCS 308, Berlin, 1988.

No context found.

J. Goguen, C. Kirchner, H. Kirchner, A. Megrelis, J. Meseguer, and T. Winkler. An introduction to OBJ3. In S. Kaplan and J.-P. Jouannaud, editors, Conditional Term Rewriting Systems, 1st International Workshop Orsay, France, July 8--10, 1987, Proceedings, volume 308 of Lecture Notes in Computer Science, pages 258--263. Springer-Verlag, 1988.

No context found.

J. Goguen, C. Kirchner, H. Kirchner, A. Megrelis, J. Meseguer, and T. Winkler. An introduction to OBJ3. In S. Kaplan and J.-P. Jouannaud, editors, Conditional Term Rewriting Systems, 1st International Workshop Orsay, France, July 8--10, 1987, Proceedings, volume 308 of Lecture Notes in Computer Science, pages 258--263. Springer-Verlag, 1988.

No context found.

J. Goguen, C. Kirchner, H. Kirchner, A. Megrelis, J. Meseguer, and T. Winkler. An introduction to OBJ3. In S. Kaplan and J.-P. Jouannaud, editors, Conditional Term Rewriting Systems, 1st International Workshop Orsay, France, July 8--10, 1987, Proceedings, volume 308 of Lecture Notes in Computer Science, pages 258--263. Springer-Verlag, 1988.

No context found.

Goguen and Tardo, "An introduction to OBJ," Procceedings of a Conference on Specifications of Reliable Software, 1979.

No context found.

J. Goguen, C. Kirchner, H. Kirchner, A. M'egrelis, J. Meseguer, and T. Winkler. An introduction to OBJ3. In S. Kaplan and J.-P. Jouannaud, editors, Proceedings of the First International Workshop on Conditional Term Rewriting Systems, volume 308 of Lecture Notes in Computer Science, pages 258--263. Springer-Verlag, 1988.

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