Reachability Analysis of Term Rewriting Systems with Timbuk
From MaRDI portal
Publication:2996202
DOI10.1007/3-540-45653-8_48zbMath1275.68083OpenAlexW1510965759MaRDI QIDQ2996202
Valérie Viet Triem Tong, Thomas Genet
Publication date: 6 May 2011
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00072321/file/RR-4266.pdf
Related Items
Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy, Descendants of a recognizable tree language for sets of linear monadic term rewrite rules, A logic of reachable patterns in linked data-structures, Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols, Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting, Symbol different term rewrite systems, Reachability in Conditional Term Rewriting Systems, Equational approximations for tree automata completion, Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism, Reachability analysis over term rewriting systems, Generalized rewrite theories, coherence completion, and symbolic methods, Narrowing and Rewriting Logic: from Foundations to Applications
Uses Software
