Conditional narrowing modulo SMT and axioms
Open Access
- 9 October 2017
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 17-28
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theoriesThe Journal of Logic and Algebraic Programming, 2012
- Folding variant narrowing and optimal variant terminationThe Journal of Logic and Algebraic Programming, 2012
- Twenty years of rewriting logicThe Journal of Logic and Algebraic Programming, 2012
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocolsHigher-Order and Symbolic Computation, 2007
- Semantic foundations for generalized rewrite theoriesTheoretical Computer Science, 2006
- Operational termination of conditional term rewriting systemsInformation Processing Letters, 2005
- Rewriting logic: roadmap and bibliographyTheoretical Computer Science, 2002
- Strong Completeness of a Narrowing Calculus for Conditional Rewrite Systems with Extra VariablesElectronic Notes in Theoretical Computer Science, 2000
- Completeness results for basic narrowingApplicable Algebra in Engineering, Communication and Computing, 1994
- Conditional narrowing modulo a set of equationsApplicable Algebra in Engineering, Communication and Computing, 1993