Term rewriting with logical constraints
In recent works on program analysis, transformations of various programming languages to
term rewriting are used. In this setting, constraints appear naturally. Several definitions …
term rewriting are used. In this setting, constraints appear naturally. Several definitions …
Verifying procedural programs via constrained rewriting induction
This article aims to develop a verification method for procedural programs via a
transformation into logically constrained term rewriting systems (LCTRSs). To this end, we …
transformation into logically constrained term rewriting systems (LCTRSs). To this end, we …
Completion for logically constrained rewriting
S Winkler, A Middeldorp - 3rd International Conference on Formal …, 2018 - drops.dagstuhl.de
We propose an abstract completion procedure for logically constrained term rewrite systems
(LCTRSs). This procedure can be instantiated to both standard Knuth-Bendix completion …
(LCTRSs). This procedure can be instantiated to both standard Knuth-Bendix completion …
Constrained term rewriting tool
This paper discusses Ctrl, a tool to analyse–both automatically and manually–term rewriting
with logical constraints. Ctrl can be used with TRSs on arbitrary underlying logics, and …
with logical constraints. Ctrl can be used with TRSs on arbitrary underlying logics, and …
Automatic constrained rewriting induction towards verifying procedural programs
This paper aims at developing a verification method for procedural programs via a
transformation into logically constrained term rewriting systems (LCTRSs). To this end, we …
transformation into logically constrained term rewriting systems (LCTRSs). To this end, we …
Runtime complexity analysis of logically constrained rewriting
Logically constrained rewrite systems (LCTRSs) are a versatile and efficient rewriting
formalism that can be used to model programs from various programming paradigms, as …
formalism that can be used to model programs from various programming paradigms, as …
Termination of LCTRSs
C Kop - arXiv preprint arXiv:1601.03206, 2016 - arxiv.org
Logically Constrained Term Rewriting Systems (LCTRSs) provide a general framework for
term rewriting with constraints. We discuss a simple dependency pair approach to prove …
term rewriting with constraints. We discuss a simple dependency pair approach to prove …
Higher-Order LCTRSs and Their Termination
L Guo, C Kop - European Symposium on Programming, 2024 - Springer
Logically constrained term rewriting systems (LCTRSs) are a formalism for program analysis
with support for data types that are not (co) inductively defined. Only imperative programs …
with support for data types that are not (co) inductively defined. Only imperative programs …
On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
T Sakata, N Nishida, T Sakabe - International Workshop on Functional and …, 2011 - Springer
In this paper, we propose methods for proving termination of constrained term rewriting
systems, where constraints are interpreted by built-in semantics given by users, and rewrite …
systems, where constraints are interpreted by built-in semantics given by users, and rewrite …
On transforming functions accessing global variables into logically constrained term rewriting systems
Y Kanazawa, N Nishida - arXiv preprint arXiv:1902.08421, 2019 - arxiv.org
In this paper, we show a new approach to transformations of an imperative program with
function calls and global variables into a logically constrained term rewriting system. The …
function calls and global variables into a logically constrained term rewriting system. The …