Using Maude to write and execute ODP information viewpoint specifications

Durán, Francisco; Roldán, Manuel; Vallecillo, Antonio

doi:10.1016/j.csi.2004.10.008

Cited by 9 publications

(4 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have experimented with the specification of the dining philosophers problem, which has been executed under the different strategies provided using invariants expressed in the different logics considered. The proposal has also been used in [26] for writing and executing ODP Information Viewpont specifications, in particular for driving the system execution according to the dynamic and invariant schemata defined for the system. An alternative approach to the strategies, based on program transformations, has been presented in [25].…”

Section: Discussionmentioning

confidence: 99%

Invariant-driven specifications in Maude

Roldán

Durán

Vallecillo

2009

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

a b s t r a c tThis work presents a general mechanism for executing specifications that comply with given invariants, which may be expressed in different formalisms and logics. We exploit Maude's reflective capabilities and its properties as a general semantic framework to provide a generic strategy that allows us to execute Maude specifications taking into account user-defined invariants. The strategy is parameterized by the invariants and by the logic in which such invariants are expressed. We experiment with different logics, providing examples for propositional logic, (finite future time) linear temporal logic and metric temporal logic.

show abstract

Section: Discussionmentioning

confidence: 99%

Invariant-driven specifications in Maude

Roldán

Durán

Vallecillo

2009

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…For example, there is work on formalizing different aspects of ODP [154,[166][167][168]350,402], SOAP [13], CORBA [14], and the SMEPP P2P middleware [153]. Similarly, work on formal models of coordination includes [85,86,441,444].…”

Section: Network Distributed Architectures Middleware and Coordinamentioning

confidence: 99%

Twenty years of rewriting logic

Meseguer

2012

The Journal of Logic and Algebraic Programming

165

View full text Add to dashboard Cite

Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations; (ii) its semantic framework and logical framework uses; (iii) its language implementations and its formal tools; and (iv) its many applications to automated deduction, software and hardware specification and verification, security, real-time and cyber-physical systems, probabilistic systems, bioinformatics and chemical systems.

show abstract

“…Among all the works, probably the most widely accepted notations for formalizing the computational viewpoint are Z, LOTOS, and SDL. Lately, rewriting logic and Maude have also shown their adequacy for modeling the ODP languages [6,5,23]. However, the lack of acceptance of formal notations in industrial and commercial environments has encouraged the quest for graphical and more appealing notations for modeling the ODP viewpoint concepts.…”

Section: No Uml Interfaces For Two-way Interactionsmentioning

confidence: 99%