Timbuk

swMATH6351MaRDI QIDQ18478FDOQ18478

Author name not available (Why is that?)

Cited In (48)

• Towards an Efficient Implementation of Tree Automata Completion
• Generalized rewrite theories, coherence completion, and symbolic methods
• Title not available (Why is that?)
• Reachability in Conditional Term Rewriting Systems
• Title not available (Why is that?)
• Rewriting Approximations for Properties Verification over CCS Specifications
• Foundations of Software Science and Computation Structures
• Feasible Trace Reconstruction for Rewriting Approximations
• A theoretical limit for safety verification techniques with regular fix-point computations
• Title not available (Why is that?)
• Term orderings for non-reachability of (conditional) rewriting
• \texttt{Autowrite}: a tool for term rewrite systems and tree automata
• A note on partially ordered tree automata
• Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
• How to Tackle Integer Weighted Automata Positivity
• VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
• Title not available (Why is that?)
• TAGED Approximations for Temporal Properties Model-Checking
• Title not available (Why is that?)
• Reachability analysis of fragments of mobile ambients in AC term rewriting
• Reachability Analysis of Term Rewriting Systems with Timbuk
• Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
• Finer Is Better: Abstraction Refinement for Rewriting Approximations
• Handling Algebraic Properties in Automatic Analysis of Security Protocols
• Equational approximations for tree automata completion
• Narrowing and rewriting logic: from foundations to applications
• Combining Equational Tree Automata over AC and ACI Theories
• Symbolic Model Checking of Infinite-State Systems Using Narrowing
• Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
• Tiburon: A Weighted Tree Automata Toolkit
• The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
• Rewriting Approximations for Fast Prototyping of Static Analyzers
• Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies
• Symbol different term rewrite systems
• Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives
• Reachability analysis over term rewriting systems
• Controlled Term Rewriting
• Termination criteria for tree automata completion
• Formalizing and analyzing the Needham-Schroeder symmetric-key protocol by rewriting
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• On tree automata that certify termination of left-linear term rewriting systems
• A logic of reachable patterns in linked data-structures
• Some decidability results on one-pass reductions
• Reachability, confluence, and termination analysis with state-compatible automata
• Handling Left-Quadratic Rules When Completing Tree Automata
• The Isabelle Collections Framework
• One-variable context-free hedge automata
• HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA

This page was built for software: Timbuk