A Coinductive Approach to Proving Reachability Properties in Logically Constrained Term Rewriting Systems
Authors:
- 30 June 2018
- book chapter
- Published by Springer Nature
- p. 295-311
Abstract
No abstract availableKeywords
All Related Versions
This publication has 23 references indexed in Scilit:
- K-JavaACM SIGPLAN Notices, 2015
- All-Path Reachability Logic2014
- Term Rewriting with Logical Constraints2013
- A Generic Cyclic Theorem Prover2012
- CVC42011
- Sequent calculi for induction and infinite descentJournal of Logic and Computation, 2010
- An overview of the K semantic frameworkThe Journal of Logic and Algebraic Programming, 2010
- Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization2010
- A rewriting logic approach to operational semanticsInformation and Computation, 2009
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocolsHigher-Order and Symbolic Computation, 2007