Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Types and programming languages
Types and programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Towards a Strategy Language for Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Modular Structural Operational Semantics with Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
Using Maude and Its Strategies for Defining a Framework for Analyzing Eden Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Deduction, Strategies, and Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
On Reachability and Spatial Reachability in Fragments of BioAmbients
Electronic Notes in Theoretical Computer Science (ENTCS)
Strategies and simulations in a semantic framework
Journal of Algorithms
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Multiset rewriting: a semantic framework for concurrency with name binding
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Hi-index | 0.00 |
Maude has revealed itself as a powerful tool for implementing different kinds of semantics so that quick prototypes are available for trying examples and proving properties. In this paper we show how to define in Maude two semantics for Cardelli and Gordon's Ambient Calculus. The first one is the operational (reduction) semantics which requires the definition of Maude strategies in order to avoid infinite loops. The second one is a type system defined by Cardelli and Gordon to avoid communication errors. The correctness of that system was not formally proved. We enrich the operational semantics with error rules and prove that well-typed processes do not produce such errors. The type system is highly non-deterministic. We show here one possible way of implementing such non-determinism in the rules.