A hidden agenda

Goguen, Joseph A.; Malcolm, Grant

doi:10.1016/s0304-3975(99)00275-3

Cited by 174 publications

(156 citation statements)

References 33 publications

Supporting

Mentioning

152

Contrasting

Order By: Relevance

“…This is clearly not the desired effect, so that the notion of extended model cannot in fact be considered suitable for observational specification. It is thus lucky that, given this negative answer to Question A), the answer to Question B) is affirmative: it is common practice to restrict signature morphisms of observational specifications in such a way that extensions never introduce new observers [5,16]. This forces a specification style where all observers are introduced in one go at the beginning, being regarded as constituting the requirements on the system, and the non-observable part, i.e.…”

Section: Application To Other Frameworkmentioning

confidence: 99%

See 1 more Smart Citation

Type Class Polymorphism in an Institutional Framework

Schröder

Mossakowski

Lüth

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Higher-order logic with shallow type class polymorphism is widely used as a specification formalism. Its polymorphic entities (types, operators, axioms) can easily be equipped with a 'naive' semantics defined in terms of collections of instances. However, this semantics has the unpleasant property that while model reduction preserves satisfaction of sentences, model expansion generally does not. In other words, unless further measures are taken, type class polymorphism fails to constitute a proper institution, being only a so-called rps preinstitution; this is unfortunate, as it means that one cannot use institution-independent or heterogeneous structuring languages, proof calculi, and tools with it.Here, we suggest to remedy this problem by modifying the notion of model to include information also about its potential future extensions. Our construction works at a high level of generality in the sense that it provides, for any preinstitution, an institution in which the original preinstitution can be represented. The semantics of polymorphism used in the specification language HasCasl makes use of this result. In fact, HasCasl's polymorphism is a special case of a general notion of polymorphism in institutions introduced here, and our construction leads to the right notion of semantic consequence when applied to this generic polymorphism. The appropriateness of the construction for other frameworks that share the same problem depends on methodological questions to be decided case by case. In particular, it turns out that our method is apparently unsuitable for observational logics, while it works well with abstract state machine formalisms such as state-based Casl.

show abstract

Section: Application To Other Frameworkmentioning

confidence: 99%

“…E.g. in observational logics, signature morphisms are usually not allowed to introduce new observers [5,16], precisely in order to rescue the satisfaction condition. Moreover, in the (non-)institution of SB-Casl [3,4], the satisfaction condition fails for signature morphisms that introduce additional state components [3].…”

Section: Introductionmentioning

confidence: 99%

Type Class Polymorphism in an Institutional Framework

Schröder

Mossakowski

Lüth

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The logic subsumes order-sorted equational logic [12][15], concurrent rewriting logic [20], and hidden algebra [16]. 3 Being an algebraic specification language, CafeOBJ promotes a property-oriented specification style: the target system is modeled as algebra by describing a set of properties to be satisfied.…”

Section: Overview Of Development Processmentioning

confidence: 99%

“…One of methodological advantages of CafeOBJ is to provide hidden algebra or behavioral equations [11][13] [16]. Specifications using hidden algebra are basically statemachines, where sequences of allowable events describe the properties of the statemachine without defining the constituting states explicitly.…”

Section: Role Of Cafeobj Descriptionsmentioning

confidence: 99%

Using algebraic specification techniques in development of object-oriented frameworks

Nakajima

1999

FM’99 — Formal Methods

View full text Add to dashboard Cite

Abstract. This paper reports experience in using CafeOBJ (a multiparadigm algebraic specification language) in the development of objectoriented frameworks of the ODP trader that is implemented with Java and JavaIDL. We first identify several aspects in the target problem before applying the known techniques of developing object-oriented frameworks. We use CafeOBJ to describe each aspect solution to mechanically check the integrity of the descriptions when all the aspects are put together. Although the experience is based on a particular problem only, the proposed method is clear enough to give a systematically and sharply focused help in reaching the solution, and to illustrate practice of using formal methods in the process.

show abstract

“…We chose to develop our techniques directly from the basic definitions, rather than treat them as special cases of general results about the existence of final semantics and coinduction principles (for example, from Hidden Algebras [5,14,4]). Since our expressions do not describe experiments and observations, developing all the necessary machinery to use one such general result would not significantly simplify the presentation.…”

Section: Introductionmentioning

confidence: 99%

Final Semantics for Event-Pattern Reactive Programs

Sánchez

Sipma

Slanina

et al. 2005

Algebra and Coalgebra in Computer Science

View full text Add to dashboard Cite

Abstract. Event-pattern reactive programs are front-end programs for distributed reactive components that preprocess an incoming stream of event stimuli. Their purpose is to recognize temporal patterns of events that are relevant to the serviced program and ignore all other events, outsourcing some of the component's complexity and shielding it from event overload. Correctness of event-pattern reactive programs is essential, because bugs may result in loss of relevant events and hence failure to react appropriately. We introduce PAR, a specification language for event-pattern reactive programs. We propose a new approach for defining such languages in terms of observations and actions. This approach applies standard techniques from coalgebra to obtain instances of the corecursion and coinduction principles. Corecursion is used to formally define the operational semantics of PAR, and coinduction allows to prove general equivalences between (ground and parameterized) PAR programs. This is the first of a series of papers in which we study questions of expressive completeness, complexity, and formal verification techniques for specification languages of event-pattern reactive programs.

show abstract

A hidden agenda

Cited by 174 publications

References 33 publications

Type Class Polymorphism in an Institutional Framework

Type Class Polymorphism in an Institutional Framework

Using algebraic specification techniques in development of object-oriented frameworks

Final Semantics for Event-Pattern Reactive Programs

Contact Info

Product

Resources

About