13 Hits in 4.3 sec

Proving Modal Properties of Rewrite Theories Using Maude's Metalevel

Isabel Pita, Miguel Palomino
2005 Electronical Notes in Theoretical Computer Science  
Here we present a technique to mechanically prove VLRL properties of rewrite theories using the reflective capability of rewriting logic through its Maude implementation.  ...  In contrast, VLRL is a modal logic built on top of rewriting logic to reason precisely about that change.  ...  Acknowledgement We thank Narciso Martí-Oliet for his helpful comments on a previous draft and Francisco Durán for his interesting remarks during the presentation of the paper.  ... 
doi:10.1016/j.entcs.2005.01.042 fatcat:flp4uuykfzbozjuq2yx5jwsmnm

Maude: specification and programming in rewriting logic

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martı́-Oliet, J. Meseguer, J.F. Quesada
2002 Theoretical Computer Science  
Rewriting logic is re ective, in the sense of being able to express its own metalevel at the object level.  ...  Since rewriting logic contains equational logic, Maude also supports equational speciÿcation and programming in its sublanguage of functional modules and theories.  ...  Acknowledgements We would like to thank David de Frutos, Miguel Palomino, Alberto Verdejo, and the anonymous referees for all their helpful comments to previous versions of this paper.  ... 
doi:10.1016/s0304-3975(01)00359-0 fatcat:qx6ctc4thbgghje2mqarzxjxdy

Implementing CCS in Maude 2

Alberto Verdejo, Narciso Martí-Oliet
2004 Electronical Notes in Theoretical Computer Science  
This paper describes in detail how to bridge the gap between theory and practice in a new implementation of the CCS operational semantics in Maude, where transitions become rewrites and inference rules  ...  We implement both the usual transition semantics and the weak transition semantics where internal actions are not observed, and on top of them we also implement the Hennessy-Milner modal logic for describing  ...  Acknowledgements We would like to thank Roberto Bruni for his comments on a previous version of this paper, Steven Eker for all his help and explanations in using the new version of Maude, and José Meseguer  ... 
doi:10.1016/s1571-0661(05)82540-x fatcat:ptcfsyb3nnamdgo64w6lun5tfi

Rewriting Logic and Maude: A Wide-Spectrum Semantic Framework for Object-Based Distributed Systems [chapter]

José Meseguer
2000 IFIP Advances in Information and Communication Technology  
Furthermore, high-level properties of such specifications expressed in nonexecutable formalisms such as temporal and modal logics can likewise be analyzed and verified.  ...  Both the distributed states and the local concurrent transitions of such systems can be naturally specified by rewrite theories in which such local concurrent transitions are described by rewrite rules  ...  US, Europe, Australia, and Japan.  ... 
doi:10.1007/978-0-387-35520-7_5 fatcat:7oy4kfnjxnadxmojkv7jv34t3q

Rewriting logic: roadmap and bibliography

Narciso Martı́-Oliet, José Meseguer
2002 Theoretical Computer Science  
Acknowledgements We would like to thank all our colleagues who have given us comments on earlier versions of this roadmap and have helped us in compiling the following bibliography; we thank specially  ...  Miguel Palomino, whose extensive help has made possible the existence of the bibliography.  ...  can endow a rewriting logic language with powerful theory composition operations [120, 116, 118, 124] ; and it can be used to prove metalogical properties about families of theories in rewriting logic  ... 
doi:10.1016/s0304-3975(01)00357-7 fatcat:loych2t2vzcgjfnidkola4wvoe

Two Case Studies of Semantics Execution in Maude: CCS and LOTOS

Alberto Verdejo, Narciso Martí-Oliet
2005 Formal methods in system design  
Moreover, it cannot be used to answer questions such as which are the successors of a process after performing an action, which is used to define the semantics of Hennessy-Milner modal logic.  ...  This executable specification plus the reflective control of rewriting can be used to analyze CCS processes.  ...  This paper is a much longer and revised version of [61] .  ... 
doi:10.1007/s10703-005-2254-x fatcat:zhh27qp5tzdcpato76kjtbqc5u

Programming and symbolic computation in Maude

Francisco Durán, Steven Eker, Santiago Escobar, Narciso Martí-Oliet, José Meseguer, Rubén Rubio, Carolyn Talcott
2019 Journal of Logical and Algebraic Methods in Programming  
Maude programs are exactly rewrite theories. Maude has also a formal environment of verification tools.  ...  They include: (i) very general unification modulo user-definable equational theories, and (ii) symbolic reachability analysis of concurrent systems using narrowing.  ...  The Tamarin theorem-proving tool [88] for verification of cryptographic protocols uses Maude's variant-generation algorithm, initially only for the Diffie-Hellman theory, but recently extended to finite  ... 
doi:10.1016/j.jlamp.2019.100497 fatcat:loloa2temzgubgorsxnqwefuwi

A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting

Kyungmin Bae, José Meseguer
2012 Electronical Notes in Theoretical Computer Science  
For this, the reflective features of both rewriting logic and its Maude implementation have proved extremely useful.  ...  Furthermore, the semantics of TLR * is given in terms of rewrite theories, so that the concurrent systems on which the LTLR properties are model checked can be specified at a very high level with rewrite  ...  For this, the reflective features of both rewriting logic and its Maude implementation [15] have proved extremely useful.  ... 
doi:10.1016/j.entcs.2012.11.009 fatcat:3d3etxo2evdu7jcjjsakvuksy4

Reflective metalogical frameworks

David Basin, Manuel Clavel, José Meseguer
2004 ACM Transactions on Computational Logic  
In particular, one can prove metatheorems that relate theories or establish properties of parameterized classes of theories.  ...  A metalogical framework is a logic with an associated methodology that is used to represent other logics and to reason about their metalogical properties.  ...  Acknowledgments We thank Narciso Martí-Oliet and Miguel Palomino for their careful reading of a draft of this paper and their detailed suggestions for improving the exposition.  ... 
doi:10.1145/1013560.1013566 fatcat:de32o3kdjrd3bfylrotomrp46q

Reachability Analysis for Spatial Concurrent Constraint Systems with Extrusion [article]

Miguel Romero, Camilo Rocha
2018 arXiv   pre-print
This work presents an executable rewriting logic semantics of SCCP with extrusion (i.e., process mobility) that uses rewriting modulo SMT, a novel technique that combines the power of term rewriting, matching  ...  Spatial concurrent constraint programming (SCCP) is an algebraic model of spatial modalities in constrained-based process calculi; it can be used to reason about spatial information distributed among the  ...  This approach can be especially useful for symbolically proving or disproving safety properties of T R such as fault-tolerance, consistency, and privacy.  ... 
arXiv:1805.07434v1 fatcat:trtncfvnkvdpni2f6vzqnruiyi

Executable structural operational semantics in Maude

Alberto Verdejo, Narciso Martí-Oliet
2006 The Journal of Logic and Algebraic Programming  
In addition, on top of CCS we develop an implementation of the Hennessy-Milner modal logic for describing local capabilities of processes, and for LOTOS we build an entire tool where Full LOTOS specifications  ...  This paper describes in detail how to bridge the gap between theory and practice when implementing in Maude structural operational semantics described in rewriting logic, where transitions become rewrites  ...  In the interpreter implementation the approach of transitions as rewrites is used, by making an extension of Maude implemented using the reflective features of Maude itself that allows conditional rules  ... 
doi:10.1016/j.jlap.2005.09.008 fatcat:ysv7hkxg3rhm5hwial7hpbfz64

A Non-Deterministic Multiset Query Language [article]

Bartosz Zielinski
2022 arXiv   pre-print
We argue that this feature is very useful, e.g., in modelling user choices during simulation or reachability analysis of a data-centric business process - the intended application of our work.  ...  We develop a multiset query and update language executable in a term rewriting system.  ...  The specification compiles into a Maude's system module which contains definitions of 196 operators, 285 equations and 83 rewriting rules (in actual implementation we used equations in place of deterministic  ... 
arXiv:2111.00218v2 fatcat:owrb7erq7nalbmsxwvivoz4dla

On the stepwise and disciplined engineering of adaptive service-oriented applications [article]

Nasreddine Aoumeur, Universitäts- Und Landesbibliothek Sachsen-Anhalt, Martin-Luther Universität, Gunter Saake
My particular thanks go also to the reviewers of this work. For the practical side of this thesis, I am particularly thankful to Msc.  ...  The fruitful discussions within the Database group allowed me to significantly reshape and improve the output of this work. Therefore, many thanks to each member of the group.  ...  can be directly applicable at the base-level using the inherent rewrite theory.  ... 
doi:10.25673/5105 fatcat:rdtpvphxl5hs3hdtwhhokdjbya