Automated complexity analysis based on ordered resolution

DOI10.1145/363647.363681zbMath1320.68163OpenAlexW2056241458MaRDI QIDQ2947004

Harald Ganzinger, David A. Basin

Publication date: 20 September 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0014-A1C3-7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (14)

Model Checking Security Protocols ⋮ A rewriting approach to satisfiability procedures. ⋮ On deciding satisfiability by theorem proving with speculative inferences ⋮ Deducibility constraints and blind signatures ⋮ Challenges in the Automated Verification of Security Protocols ⋮ Harald Ganzinger’s Legacy: Contributions to Logics and Programming ⋮ From Search to Computation: Redundancy Criteria and Simplification at Work ⋮ Constructing Bachmair-Ganzinger Models ⋮ On Combinations of Local Theory Extensions ⋮ Automatic decidability and combinability ⋮ On Hierarchical Reasoning in Combinations of Theories ⋮ Variant-Based Satisfiability in Initial Algebras ⋮ Towards an algorithmic construction of cut-elimination procedures ⋮ Algorithms and reductions for rewriting problems. II.

Uses Software

• Saturate

This page was built for publication: Automated complexity analysis based on ordered resolution