Results 1  10
of
10,854
Maude: Specification and Programming in Rewriting Logic
, 2001
"... Maude is a highlevel language and a highperformance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules and ..."
Abstract

Cited by 210 (66 self)
 Add to MetaCart
Maude is a highlevel language and a highperformance system supporting executable specification and declarative programming in rewriting logic. Since rewriting logic contains equational logic, Maude also supports equational specification and programming in its sublanguage of functional modules
Principles of Maude
, 1996
"... This paper introduces the basic concepts of the rewriting logic language Maude and discusses its implementation. Maude is a widespectrum language supporting formal specification, rapid prototyping, and parallel programming. Maude's rewriting logic paradigm includes the functional and objector ..."
Abstract

Cited by 132 (28 self)
 Add to MetaCart
This paper introduces the basic concepts of the rewriting logic language Maude and discusses its implementation. Maude is a widespectrum language supporting formal specification, rapid prototyping, and parallel programming. Maude's rewriting logic paradigm includes the functional and object
The Maude 2.0 system
 Rewriting Techniques and Applications, Proceedings of the 14th International Conference
, 2003
"... Abstract. This paper gives an overviewof the Maude 2.0 system. We emphasize the full generality with which rewriting logic and membership equational logic are supported, operational semantics issues, the new builtin modules, the more general Full Maude module algebra, the new METALEVEL module, the ..."
Abstract

Cited by 109 (18 self)
 Add to MetaCart
Abstract. This paper gives an overviewof the Maude 2.0 system. We emphasize the full generality with which rewriting logic and membership equational logic are supported, operational semantics issues, the new builtin modules, the more general Full Maude module algebra, the new METALEVEL module
The Maude Specification of Full Maude
, 1999
"... This document describes the executable formal specification of Full Maude  a version of Maude supporting a rich module algebra with module hierarchies, parameterization, views, theories, module expressions, and objectoriented modules  which is in fact its implementation in the Maude 1.00 system ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
This document describes the executable formal specification of Full Maude  a version of Maude supporting a rich module algebra with module hierarchies, parameterization, views, theories, module expressions, and objectoriented modules  which is in fact its implementation in the Maude 1
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest paths from a given source s to each vertex in the graph, in total time O(m + n log n +kn). We describe applications to dynamic programming problems including the knapsack problem, sequence alignment, maximum inscribed polygons, and genealogical relationship discovery.
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
 IN 14TH IEEE COMPUTER SECURITY FOUNDATIONS WORKSHOP (CSFW14
, 2001
"... We present a new automatic cryptographic protocol verifier based on a simple representation of the protocol by Prolog rules, and on a new efficient algorithm that determines whether a fact can be proved from these rules or not. This verifier proves secrecy properties of the protocols. Thanks to its ..."
Abstract

Cited by 386 (11 self)
 Add to MetaCart
We present a new automatic cryptographic protocol verifier based on a simple representation of the protocol by Prolog rules, and on a new efficient algorithm that determines whether a fact can be proved from these rules or not. This verifier proves secrecy properties of the protocols. Thanks to its use of unification, it avoids the problem of the state space explosion. Another advantage is that we do not need to limit the number of runs of the protocol to analyze it. We have proved the correctness of our algorithm, and have implemented it. The experimental results show that many examples of protocols of the literature, including Skeme [24], can be analyzed by our tool with very small resources: the analysis takes from less than 0.1 s for simple protocols to 23 s for the main mode of Skeme. It uses less than 2 Mb of memory in our tests.
Maude Manual (Version 2.6)
"... The Maude system is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. The Maude system is distributed in the hope that it will ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The Maude system is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. The Maude system is distributed in the hope
Maude Manual (Version 2.5)
"... The Maude system is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. The Maude system is distributed in the hope that it will ..."
Abstract
 Add to MetaCart
The Maude system is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. The Maude system is distributed in the hope
Maude Manual (Version 2.4)
, 2008
"... Park, CA 94025, USA. The Maude system is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. The Maude system is distributed in ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Park, CA 94025, USA. The Maude system is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. The Maude system is distributed
Playing with Maude
 FIFTH INTERNATIONAL WORKSHOP ON RULEBASED PROGRAMMING, RULE 2004, VOLUME 124 OF ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
, 2005
"... This paper is an introduction to rulebased programming in Maude. We illustrate in particular the use of operator attributes to structure the state of a system, and the di#erence between equations and rules. We use mathematical games and puzzles for our examples illustrating the expressive power of ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This paper is an introduction to rulebased programming in Maude. We illustrate in particular the use of operator attributes to structure the state of a system, and the di#erence between equations and rules. We use mathematical games and puzzles for our examples illustrating the expressive power
Results 1  10
of
10,854