Pages that link to "Item:Q880981"
From MaRDI portal
The following pages link to Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981):
Displaying 42 items.
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- State space reduction in the Maude-NRL protocol analyzer (Q462493) (← links)
- A generic framework for symbolic execution: a coinductive approach (Q507361) (← links)
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
- Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties (Q860906) (← links)
- Programming with narrowing: a tutorial (Q968524) (← links)
- A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude (Q1655486) (← links)
- Symbolic execution based on language transformation (Q1749128) (← links)
- A simple framework for real-time cryptographic protocol analysis with compositional proof rules (Q1887729) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description) (Q2104541) (← links)
- Symbolic computation in Maude: some tapas (Q2119100) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- Programming and symbolic computation in Maude (Q2291818) (← links)
- A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
- On the relationships between models in protocol verification (Q2482448) (← links)
- Optimization of rewrite theories by equational partial evaluation (Q2667190) (← links)
- Built-in Variant Generation and Unification, and Their Applications in Maude 2.7 (Q2817918) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q2849863) (← links)
- Narrowing and rewriting logic: from foundations to applications (Q2873786) (← links)
- José Meseguer: Scientist and Friend Extraordinaire (Q2945698) (← links)
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude (Q2945699) (← links)
- Two Decades of Maude (Q2945709) (← links)
- The Formal System of Dijkstra and Scholten (Q2945729) (← links)
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties (Q3184784) (← links)
- Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories (Q3460872) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- Effectively Checking the Finite Variant Property (Q3522010) (← links)
- Compositional Specification in Rewriting Logic (Q5108529) (← links)
- Variant Narrowing and Equational Unification (Q5179131) (← links)
- Functional Logic Programming in Maude (Q5403075) (← links)
- Universally Composable Symbolic Analysis for Two-Party Protocols Based on Homomorphic Encryption (Q5418723) (← links)
- Termination of Narrowing Using Dependency Pairs (Q5504664) (← links)
- A Non-Deterministic Multiset Query Language (Q5862341) (← links)
- An efficient canonical narrowing implementation with irreducibility and SMT constraints for generic symbolic protocol analysis (Q6052948) (← links)
- Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)
- Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis Method (Q6487294) (← links)
- Building correct-by-construction systems with formal patterns (Q6562511) (← links)
