scientific article; zbMATH DE number 2043522
From MaRDI portal
Publication:4447224
zbMath1038.68559MaRDI QIDQ4447224
Narciso Martí-Oliet, Steven Eker, Francisco Durán, José Meseguer, Patrick D. Lincoln, Carolyn L. Talcott, Manuel Clavel
Publication date: 16 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2706/27060076.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Strategies for combining decision procedures, Executable structural operational semantics in Maude, Generating Specialized Interpreters for Modular Structural Operational Semantics, Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\), Proving termination of context-sensitive rewriting by transformation, SOS formats and meta-theory: 20 years after, Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols, A probabilistic approximate logic for neuro-symbolic learning and reasoning, Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis, Two Decades of Maude, Parameterized strategies specification in Maude, Formal specification of MPI 2.0: case study in specifying a practical concurrent programming API, UTPCalc — A Calculator for UTP Predicates, Rewriting-based repairing strategies for XML repositories, Efficient safety enforcement for Maude programs via program specialization in the \textsf{ÁTAME} system, A metamodel of access control for distributed environments: applications and properties, Domain science and engineering from computer science to the sciences of informatics. II: Science, Domain science and engineering from computer science to the sciences of informatics. I: Engineering, Inspecting Rewriting Logic Computations (in a Parametric and Stepwise Way), Maude as a Platform for Designing and Implementing Deep Inference Systems, Mitigating covert channels based on analysis of the potential for communication, A Transformational Approach to Prove Outermost Termination Automatically, Verifying Multithreaded Recursive Programs with Integer Variables, Memory Representations in Rewriting Logic Semantics Definitions, Characterizing and proving operational termination of deterministic conditional term rewriting systems, Algebraic correctness proofs for compiling recursive function definitions with strictness information, PTL: a model transformation language based on logic programming, Analytical Inductive Functional Programming, Explaining safety failures in NetKAT, Debugging Maude programs via runtime assertion checking and trace slicing, Tactics for Reasoning Modulo AC in Coq, Towards Behavioral Maude, On linear logic planning and concurrency, Model-checking user behaviour using interacting components, Cadmium: An Implementation of ACD Term Rewriting, A Non-Deterministic Multiset Query Language, Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities, Coding Mobile Synchronizing Petri Nets into Rewriting Logic, Programmed Strategies for Program Verification, A Rewriting Semantics for ABEL with Applications to Hardware/Software Co-Design and Analysis, Partial Order Reduction for Rewriting Semantics of Programming Languages, Solving Sudoku Puzzles with Rewriting Rules, A Rewriting Logic Framework for Soft Constraints, Expander2: Program Verification Between Interaction and Automation, Equational rules for rewriting logic, Pattern eliminating transformations
Uses Software
