Pages that link to "Item:Q1608917"
From MaRDI portal
The following pages link to Maude: specification and programming in rewriting logic (Q1608917):
Displaying 46 items.
- Static checking of GDPR-related privacy compliance for object-oriented distributed systems (Q2669242) (← links)
- Towards Maude 2. 0 (Q2703706) (← links)
- Parameterized theories and views in full Maude 2. 0 (Q2703707) (← links)
- Maximally Parallel Contextual String Rewriting (Q2827840) (← links)
- Defining actions in concurrent declarative programming (Q2841291) (← links)
- Comparing Meseguer's rewriting logic with the logic CRWL (Q2841300) (← links)
- Strategies and user interfaces in Maude at work (Q2844063) (← links)
- Maude's internal strategies (Q2849581) (← links)
- A tutorial on specifying data structures in Maude (Q2850669) (← links)
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic (Q2851051) (← links)
- A secret-sharing protocol modelled in Maude (Q2851056) (← links)
- Plan in Maude specifying an active network programming language (Q2851057) (← links)
- Prototyping SOS meta-theory in Maude (Q2852099) (← links)
- Mumbo: a rule-based implementation of a run-time program generation language (Q2863869) (← links)
- Deduction, strategies, and rewriting (Q2864357) (← links)
- Recent advances in real-time Maude (Q2864519) (← links)
- An account of implementing applicative term rewriting (Q2866805) (← links)
- A rewriting logic approach to operational semantics (extended abstract) (Q2871834) (← links)
- Regular strategies as proof tactics for \textsf{CIRC} (Q2873678) (← links)
- Partial order reduction for rewriting semantics of programming languages (Q2873775) (← links)
- Solving Sudoku puzzles with rewriting rules (Q2873776) (← links)
- Two Decades of Maude (Q2945709) (← links)
- Validating Timed Models of Deployment Components with Parametric Concurrency (Q3067533) (← links)
- Generating Series in the Cohomology of Hilbert Schemes of Points on Surfaces (Q3091947) (← links)
- A Rewriting Logic Approach to Type Inference (Q3184729) (← links)
- An Object-Oriented Component Model for Heterogeneous Nets (Q3603002) (← links)
- Reachability in Conditional Term Rewriting Systems (Q4916227) (← links)
- Relating State-Based and Process-Based Concurrency through Linear Logic (Q4917995) (← links)
- Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework (Q4923514) (← links)
- Symbolic Analysis of Maude Theories with Narval (Q5108507) (← links)
- A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting (Q5166636) (← links)
- Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors (Q5179127) (← links)
- Memory Representations in Rewriting Logic Semantics Definitions (Q5179135) (← links)
- Proof Search for the First-Order Connection Calculus in Maude (Q5179137) (← links)
- Combining Techniques to Reduce State Space and Prove Strong Properties (Q5179142) (← links)
- Concurrent Objects à la Carte (Q5187829) (← links)
- Defining and Executing P Systems with Structured Data in K (Q5191176) (← links)
- Maude as a Platform for Designing and Implementing Deep Inference Systems (Q5415654) (← links)
- Testing Concurrent Objects with Application-Specific Schedulers (Q5505611) (← links)
- Soft constraint automata with memory (Q5918138) (← links)
- Parallelized sequential composition and hardware weak memory models (Q6045051) (← links)
- Type Theory Unchained : Extending Agda with User-Defined Rewrite Rules (Q6079228) (← links)
- A model learning based testing approach for kernel P systems (Q6162072) (← links)
- QMaude: quantitative specification and verification in rewriting logic (Q6174537) (← links)
- Coverage-based testing with symbolic transition systems (Q6536171) (← links)
- Towards a type-based abstract semantics for Python (Q6671786) (← links)
