Specifying and Checking Fault-Tolerant Agent-Based Protocols Using Maude

Baalen, Jeffrey Van; Caldwell, James L.; Mishra, Shivakant

doi:10.1007/3-540-45484-5_15

Cited by 8 publications

(10 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With respect to reflection, Clavel and Meseguer have formerly given detailed proofs for increasingly general fragments of rewriting logic, namely: (1) unsorted and unconditional [10], (2) unsorted conditional [17]; and (3) many-sorted conditional [17]. This paper generalizes these previous results to the case of conditional rewrite theories whose underlying equational specifications are theories in membership equational logic [43].…”

Section: Introductionmentioning

confidence: 85%

“…= true whose depth is equal to 1 + max(depth(δ ), depth(δ )) ≤ 1 + max(depth(δ ), depth(δ )) = depth(δ), and we have (2).…”

Section: By Induction Hypothesis U Melmentioning

confidence: 98%

“…1 Finally, to rule out unfaithful representations, we should require that the function is injective. 2 Note that in a reflective entailment system, since U itself is representable, representation can be iterated so that we immediately have a "reflective tower":…”

Section: Reflective Logicsmentioning

confidence: 99%

“…-A proof assistant built by Stehr for the Open Calculus of Constructions, which extends Coquand and Huet's calculus of constructions [49]. -Executable specifications of models of computation [2,52,50,9].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic

Clavel

Meseguer

Palomino

2007

Theoretical Computer Science

View full text Add to dashboard Cite

We show that the generalized variant of formal systems where the underlying equational specifications are membership equational theories, and where the rules are conditional and can have equations, memberships and rewrites in the conditions is reflective. We also show that membership equational logic, many-sorted equational logic, and Horn logic with equality are likewise reflective. These results provide logical foundations for reflective languages and tools based on these logics.

show abstract

Section: Introductionmentioning

confidence: 85%

“…= true whose depth is equal to 1 + max(depth(δ ), depth(δ )) ≤ 1 + max(depth(δ ), depth(δ )) = depth(δ), and we have (2).…”

Section: By Induction Hypothesis U Melmentioning

confidence: 98%

Section: Reflective Logicsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic

Clavel

Meseguer

Palomino

2007

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…• van Baalen et al [2] have used Maude to give a formal semantics to, and to analyze, key fault-tolerant protocols in the DaAgents mobile agent system. Their analysis, which includes detailed analyses of the protocols' behavior under different fault models, has revealed mistakes and inconsistencies in the protocols' informal specifications.…”

Section: Agent and Mobile Languagesmentioning

confidence: 99%

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

Meseguer¹

2000

Formal Methods for Open Object-Based Distributed Systems IV

View full text Add to dashboard Cite

Rewriting logic seems very weH suited as a semantic framework for open object-based distributed systems. 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. Maude is a high-performance rewriting logic language and system developed at SRI International that supports executable specification and programming, and a flexible variety of formal analyses. As a wide-spectrum semantic framework, rewriting logic can span the gap between high-level properties and architectural designs on the one hand, and distributed or mobile system implementations on the other. Rewriting logic has been used to give a precise semantics to a number of distributed architectural notations and to obtain formal executable specifications from them. Using Maude and its associated tools, such executable specifications can then be formally analyzed in a variety of ways. Furthermore, high-level properties of such specifications expressed in nonexecutable formalisms such as temporal and modal logics can likewise be analyzed and verified. Since under quite reasonable assuptions rewriting logic specifications can be directly implemented as distributed and mobile systems, it is possible to span the gap from highlevel designs to implementations without leaving the formal frarnework. This paper intro duces rewriting logic and Maude, and surveys the experience that, thanks to the efforts of several research teams, has been gained so far in applying them to open object-based distributed systems.

show abstract

Automated Protocol Analysis in Maude

Baalen

Böhne

2003

Formal Approaches to Agent-Based Systems

View full text Add to dashboard Cite

Specifying and Checking Fault-Tolerant Agent-Based Protocols Using Maude

Cited by 8 publications

References 5 publications

Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic

Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic

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

Automated Protocol Analysis in Maude

Contact Info

Product

Resources

About