Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
ELAN from a rewriting logic point of view
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
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Formalization and abstract implementation of rewriting with nested rules
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Exploring adaptability of secure group communication using formal prototyping techniques
ARM '04 Proceedings of the 3rd workshop on Adaptive and reflective middleware
Reputation-based trust management
Journal of Computer Security - Special issue on WITS'03
Strategies for combining decision procedures
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
A semantic model for safe protocol interaction
Proceedings of the 2006 ACM symposium on Applied computing
Proving termination of context-sensitive rewriting by transformation
Information and Computation
Formal Model Merging Applied to Class Diagram Integration
Electronic Notes in Theoretical Computer Science (ENTCS)
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Modeling and verification of real-time systems based on equations
Science of Computer Programming
Coding Mobile Synchronizing Petri Nets into Rewriting Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities
Electronic Notes in Theoretical Computer Science (ENTCS)
Policy-based Coordination in PAGODA: A Case Study
Electronic Notes in Theoretical Computer Science (ENTCS)
Q-Automata: Modelling the Resource Usage of Concurrent Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Programmed Strategies for Program Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Induction for positive almost sure termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Electronic Notes in Theoretical Computer Science (ENTCS)
A rule-based approach for RNA pseudoknot prediction
International Journal of Data Mining and Bioinformatics
A rewriting framework for the composition of access control policies
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Constraint refinement for online verifiable cross-layer system adaptation
Proceedings of the conference on Design, automation and test in Europe
Modelling collaborative workflows using recursive ECATNets
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Dependency Pairs for Rewriting with Non-free Constructors
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Maude as a Platform for Designing and Implementing Deep Inference Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of rewriting under strategies
ACM Transactions on Computational Logic (TOCL)
Cadmium: An Implementation of ACD Term Rewriting
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A Transformational Approach to Prove Outermost Termination Automatically
Electronic Notes in Theoretical Computer Science (ENTCS)
Action Control by Term Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparison of Maude and SAL by Conducting Case Studies Model Checking a Distributed Algorithm
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Analytical Inductive Functional Programming
Logic-Based Program Synthesis and Transformation
Memory Representations in Rewriting Logic Semantics Definitions
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium
Unification and Narrowing in Maude 2.4
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Automatic assessment of failure recovery in Erlang applications
Proceedings of the 8th ACM SIGPLAN workshop on ERLANG
Quantitative Pathway Logic for Computational Biology
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Handling mixed-criticality in SoC-based real-time embedded systems
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Automated Verification of Multi-Agent Programs
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
TomML: A Rule Language for Structured Data
RuleML '09 Proceedings of the 2009 International Symposium on Rule Interchange and Applications
A Tutorial on Specifying Data Structures in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Rule-based Programming in Java For Protocol Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
New Evaluation Commands for Maude Within Full Maude
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
Coordination Models Based on a Formal Model of Distributed Object Reflection
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining Aspect-Oriented and Strategic Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed event-based access control
International Journal of Information and Computer Security
The pathalyzer: a tool for analysis of signal transduction pathways
RECOMB'05 Proceedings of the 2005 joint annual satellite conference on Systems biology and regulatory genomics
A fast algebraic web verification service
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Integrating verification, testing, and learning for cryptographic protocols
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Dynamic event-based access control as term rewriting
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Algebraic models of simultaneous multithreaded and multi-core processors
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
On formal analysis of OO languages using rewriting logic: designing for performance
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
A probabilistic formal analysis approach to cross layer optimization in distributed embedded systems
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Tom: piggybacking rewriting on java
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
KOOL: an application of rewriting logic to language prototyping and analysis
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Combining formal verification with observed system execution behavior to tune system parameters
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Flexible, rule-based constraint model linearisation
PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
Type checking evolving languages with MSOS
Semantics and algebraic specification
Cybernetics and Systems Analysis
Model Testing Asynchronously Communicating Objects using Modulo AC Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Cybernetics and Systems Analysis
Modularisation in maude of parametrized RBAC for row level access control
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Rewrite specifications of access control policies in distributed environments
STM'10 Proceedings of the 6th international conference on Security and trust management
Applications of pathway logic modeling to target identification
Formal modeling
Term rewriting for access control
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Reducing nondeterminism in the calculus of structures
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Run your research: on the effectiveness of lightweight mechanization
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Multiple representations of biological processes
Transactions on Computational Systems Biology VI
Executable interface specifications for testing asynchronous creol components
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
Symbolic semantics for the verification of security properties of mobile petri nets
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Category-Based authorisation models: operational semantics and expressive power
ESSoS'10 Proceedings of the Second international conference on Engineering Secure Software and Systems
Tactics for reasoning modulo AC in coq
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
MoScript: a DSL for querying and manipulating model repositories
SLE'11 Proceedings of the 4th international conference on Software Language Engineering
Using term rewriting to solve bit-vector arithmetic problems
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Trace matching in a concurrent logical framework
Proceedings of the seventh international workshop on Logical frameworks and meta-languages, theory and practice
HPobSAM for modeling and analyzing IT Ecosystems - Through a case study
Journal of Systems and Software
Automated analysis of rule-based access control policies
PLPV '13 Proceedings of the 7th workshop on Programming languages meets program verification
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A term rewriting system for the calculus of moving surfaces
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Using maude rewriting system to modularize and extend SQL
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
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 built-in modules, the more general Full Maude module algebra, the new META-LEVEL module, the LTL model checker, and new implementation techniques yielding substantial performance improvements in rewriting modulo. We also comment on Maude's formal tool environment and on applications.