The following pages link to (Q4447224):
Displaying 46 items.
- A metamodel of access control for distributed environments: applications and properties (Q462495) (← links)
- Domain science and engineering from computer science to the sciences of informatics. II: Science (Q464883) (← links)
- Mitigating covert channels based on analysis of the potential for communication (Q530557) (← links)
- Formal specification of MPI 2.0: case study in specifying a practical concurrent programming API (Q617917) (← links)
- Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
- Debugging Maude programs via runtime assertion checking and trace slicing (Q739630) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- On linear logic planning and concurrency (Q1041042) (← links)
- Model-checking user behaviour using interacting components (Q1047208) (← links)
- Equational rules for rewriting logic (Q1608925) (← links)
- Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\) (Q1653445) (← links)
- Explaining safety failures in NetKAT (Q2043810) (← links)
- Pattern eliminating transformations (Q2119103) (← links)
- Parameterized strategies specification in Maude (Q2185882) (← links)
- Efficient safety enforcement for Maude programs via program specialization in the \textsf{ÁTAME} system (Q2209262) (← links)
- Strategies for combining decision procedures (Q2368951) (← links)
- Executable structural operational semantics in Maude (Q2369036) (← links)
- Rewriting-based repairing strategies for XML repositories (Q2436514) (← links)
- Domain science and engineering from computer science to the sciences of informatics. I: Engineering (Q2452758) (← links)
- Algebraic correctness proofs for compiling recursive function definitions with strictness information (Q2502270) (← links)
- A probabilistic approximate logic for neuro-symbolic learning and reasoning (Q2667187) (← links)
- Towards behavioral Maude: behavioral membership equational logic (Q2842559) (← links)
- Inducing constructor systems from example-terms by detecting syntactical regularities (Q2864518) (← links)
- Coding mobile synchronizing Petri nets into rewriting logic (Q2864520) (← links)
- Programmed strategies for program verification (Q2864527) (← links)
- A rewriting semantics for ABEL with applications to hardware/software co-design and analysis (Q2873774) (← links)
- Partial order reduction for rewriting semantics of programming languages (Q2873775) (← links)
- Solving Sudoku puzzles with rewriting rules (Q2873776) (← links)
- A rewriting logic framework for soft constraints (Q2873783) (← links)
- Expander2: program verification between interaction and automation (Q2873787) (← links)
- Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis (Q2945700) (← links)
- Two Decades of Maude (Q2945709) (← links)
- UTPCalc — A Calculator for UTP Predicates (Q2971182) (← links)
- Tactics for Reasoning Modulo AC in Coq (Q3100211) (← links)
- Generating Specialized Interpreters for Modular Structural Operational Semantics (Q3453654) (← links)
- Analytical Inductive Functional Programming (Q3617432) (← links)
- A Transformational Approach to Prove Outermost Termination Automatically (Q5170158) (← links)
- Verifying Multithreaded Recursive Programs with Integer Variables (Q5179057) (← links)
- Memory Representations in Rewriting Logic Semantics Definitions (Q5179135) (← links)
- Inspecting Rewriting Logic Computations (in a Parametric and Stepwise Way) (Q5403072) (← links)
- Maude as a Platform for Designing and Implementing Deep Inference Systems (Q5415654) (← links)
- Cadmium: An Implementation of ACD Term Rewriting (Q5504678) (← links)
- A Non-Deterministic Multiset Query Language (Q5862341) (← links)
- PTL: a model transformation language based on logic programming (Q5963089) (← links)