Functorial models for petri nets
Information and Computation
Theoretical Computer Science - Special issue on theories of types and proofs
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Reflection in conditional rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
A Framework for Order-Sorted Algebra
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
A Total Approach to Partial Algebraic Specification
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Rewriting Logic as a Metalogical Framework
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Rewriting Logic as a Unifying Framework for Petri Nets
Unifying Petri Nets, Advances in Petri Nets
Certifying Domain-Specific Policies
Proceedings of the 16th IEEE international conference on Automated software engineering
Revisiting the algebra of Petri net processes under the collective token philosophy
Fundamenta Informaticae - Concurrency specification and programming
Reflective metalogical frameworks
ACM Transactions on Computational Logic (TOCL)
Proving termination of membership equational programs
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Formal prototyping in early stages of protocol design
WITS '05 Proceedings of the 2005 workshop on Issues in the theory of security
Rewriting-Based Techniques for Runtime Verification
Automated Software Engineering
Relational analysis of algebraic datatypes
Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Operational termination of conditional term rewriting systems
Information Processing Letters
Semantic foundations for generalized rewrite theories
Theoretical Computer Science
Proving termination of context-sensitive rewriting by transformation
Information and Computation
The rewriting logic semantics project
Theoretical Computer Science
Writing and executing ODP computational viewpoint specifications using Maude
Computer Standards & Interfaces
Higher-Order and Symbolic Computation
Science of Computer Programming
Coding Mobile Synchronizing Petri Nets into Rewriting Logic
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)
Abstraction and Model Checking of Core Erlang Programs in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving operational termination of membership equational programs
Higher-Order and Symbolic Computation
Theoretical Computer Science
Declarative Debugging of Membership Equational Logic Specifications
Concurrency, Graphs and Models
MTT: The Maude Termination Tool (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Automated Induction with Constrained Tree Automata
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Simultaneous checking of completeness and ground confluence for algebraic specifications
ACM Transactions on Computational Logic (TOCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
A Declarative Debugger for Maude Functional Modules
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational Termination of Membership Equational Programs: the Order-Sorted Way
Electronic Notes in Theoretical Computer Science (ENTCS)
Web Services and Interoperability for the Maude Termination Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
Methods for Proving Termination of Rewriting-based Programming Languages by Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
A formalization of the SMEPP model in Maude
Proceedings of the 5th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking, and Services
A Tutorial on Specifying Data Structures in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A fold/unfold transformation framework for rewrite theories extended to CCT
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
PMaude: Rewrite-based Specification Language for Probabilistic Object Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
The Rewriting Logic Semantics Project
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed Mobile Ambients in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational termination of conditional term rewriting systems
Information Processing Letters
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Order-sorted parameterization and induction
Semantics and algebraic specification
On the specification and verification of model transformations
Semantics and algebraic specification
A Natural Implementation of Plural Semantics in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a rewriting logic semantics for ATL
ICMT'10 Proceedings of the Third international conference on Theory and practice of model transformations
A Church-Rosser checker tool for conditional order-sorted equational Maude specifications
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
On the behavioral semantics of real-time domain specific visual languages
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Enhancing the debugging of Maude specifications
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Constructors, sufficient completeness, and deadlock freedom of rewrite theories
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
A transformation contract to generate aspects from access control policies
Software and Systems Modeling (SoSyM)
Parameterized metareasoning in membership equational logic
Formal modeling
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
An introduction to maude and some of its applications
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
A sufficient completeness reasoning tool for partial specifications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Coverset induction with partiality and subsorts: a powerlist case study
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Test-Case generation for maude functional modules
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
A generic framework for n-protocol compatibility checking
Science of Computer Programming
Simplifying questions in maude declarative debugger by transforming proof trees
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Revisiting the Algebra of Petri Net Processes under the Collective Token Philosophy
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Using semantics specified in maude to generate test cases
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
S-Narrowing for constructor systems
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Using narrowing to test maude specifications
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
| Hi-index | 0.01 |