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