An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks

Futatsugi, Kokichi; Nakagawa, Ataru T.

doi:10.1109/icfem.1997.630424

Cited by 50 publications

(29 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For each domain characterisable by a distinct set of analysis & description calculus prompts such calculi must be identified. [FN97,FGO12]. The analysis and the description prompts remain the same.…”

Section: Analysis and Description Calculi For Other Domainsmentioning

confidence: 91%

Manifest domains: analysis and description

Bjørner¹

2017

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract.We show that manifest domains, an understanding of which are a prerequisite for software requirements prescriptions, can be precisely described: narrated and formalised. We show that such manifest domains can be understood as a collection of endurant, that is, basically spatial entities: parts, components and materials, and perdurant, that is, basically temporal entities: actions, events and behaviours. We show that parts can be modeled in terms of external qualities whether: atomic or composite parts, having internal qualities: unique identifications, mereologies, which model relations between parts, and attributes. We show that the manifest domain analysis endeavour can be supported by a calculus of manifest domain analysis prompts: is entity, is endurant, is perdurant, is part, is component, is material, is atomic, is composite, has components, has materials, has concrete type, attributenames, is stationary, etcetera; and show how the manifest domain description endeavour can be supported by a calculus of manifest domain description prompts: observe part sorts, observe part type, observe components, observe materials, observe unique identifier, observe mereology, observe attributes. We show how to model attributes, essentially following Michael Jackson, [Jac95], but with a twist: The attribute model introduces the attribute analysis prompts is static attribute, is dynamic attribute, is inert attribute, is reactive attribute, is active attribute, is autonomous attribute, is biddable attribute and is programmable attribute. The twist suggests ways of modeling "access" to the values of these kinds of attributes: the static attributes by simply "copying" them, once, the reactive and programmable attributes by "carrying" them as function parameters whose values are kept always updated, and the remaining, the external attributes, by inquiring, when needed, as to their value, as if they were always offered on CSP-like channels [Hoa85]. We show how to model essential aspects of perdurants in terms of their signatures based on the concepts of endurants. And we show how one can "compile" descriptions of endurant parts into descriptions of perdurant behaviours. We do not show prompt calculi for perdurants. The above contributions express a method with principles, techniques and tools for constructing domain descriptions. It is important to realise that we do not wish to nor claim that the method can describe all that it is interesting to know about domains.

show abstract

Section: Analysis and Description Calculi For Other Domainsmentioning

confidence: 91%

Manifest domains: analysis and description

Bjørner¹

2017

Form. Asp. Comput.

View full text Add to dashboard Cite

show abstract

“…JCI-2012-13528. Actually, the idea of strategy annotation (where the list of arguments whose evaluation is allowed is explicitly given for each function symbol) originally introduced by José and other colleagues as part of the design of OBJ2 [11] anticipated the main ideas underlying the development of Context-Sensitive Rewriting for a rather different purpose 1 . On the basis of previous work in [23,24], in the aforementioned tutorial Context-Sensitive Rewriting (CSR, [22]) was shown useful to model rewriting-based programming languages like CafeOBJ [12], ELAN [8], OBJ [15], and Maude [9] that are able to use such kind of strategies.…”

Section: Introductionmentioning

confidence: 99%

Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting

Gutiérrez

Lucas

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Context-sensitive rewriting (CSR) is a variant of rewriting where only selected arguments of function symbols can be rewritten. Consequently, the subterm positions of a term are classified as either active, i.e., positions of subterms that can be rewritten; or frozen, i.e., positions that cannot. Frozen positions can be used to denote subexpressions whose evaluation is delayed or just forbidden. A typical example is the if-then-else operator whose second and third arguments are not evaluated until the evaluation of the first argument yields either true or false. Imposing replacement restrictions can improve the termination behavior of rewriting-based computational systems. Termination of CSR has been investigated by several authors and a number of automatic tools are able to prove it. In this paper, we analyze how frozen subterms affect termination of CSR. This analysis helps us to improve our ContextSensitive Dependency Pair (CS-DP) framework for automatically proving termination of CSR. We have implemented these improvements in our tool mu-term. The experiments show the power of the improvements in practice.

show abstract

“…Outermost rewriting is a rewriting strategy where a redex may be contracted as long as it is not a proper subterm of another redex occurrence. The main reason for studying outermost termination is its practical relevance: lazy functional programming languages like Miranda [Tur86], Haskell [PJ03] or Clean [PvE01], are based on outermost rewriting as an evaluation strategy, and in implementations of rewrite logic such as Maude [CELM96] and CafeOBJ [FN97], outermost rewriting is an optional strategy.…”

Section: Introductionmentioning

confidence: 99%

Transforming Outermost into Context-Sensitive Rewriting

Endrullis¹,

Hendriks²

2010

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. We define two transformations from term rewriting systems (TRSs) to contextsensitive TRSs in such a way that termination of the target system implies outermost termination of the original system. In the transformation based on 'context extension', each outermost rewrite step is modeled by exactly one step in the transformed system. This transformation turns out to be complete for the class of left-linear TRSs. The second transformation is called 'dynamic labeling' and results in smaller sized context-sensitive TRSs. Here each modeled step is adjoined with a small number of auxiliary steps.As a result state-of-the-art termination methods for context-sensitive rewriting become available for proving termination of outermost rewriting. Both transformations have been implemented in Jambox, making it the most successful tool in the category of outermost rewriting of the annual termination competition of 2008.

show abstract

An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks

Cited by 50 publications

References 18 publications

Manifest domains: analysis and description

Manifest domains: analysis and description

Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting

Transforming Outermost into Context-Sensitive Rewriting

Contact Info

Product

Resources

About