On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems
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 resulting system represents transitions of the whole execution environment with a call stack. More precisely, we prepare...
Main Authors: | Yoshiaki Kanazawa, Naoki Nishida |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2019-02-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1902.08421v1 |
Similar Items
-
Transformational approach to inverse computation in term rewriting
by: Nishida, Naoki
Published: (2004) -
Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction
by: Shinnosuke Mizutani, et al.
Published: (2018-02-01) -
Transformation for Refining Unraveled Conditional Term Rewriting Systems
by: Nishida, Naoki, et al.
Published: (2007) -
Convergent Term Rewriting Systems for Inverse Computation of Injective Functions
by: Nishida, Naoki, et al.
Published: (2007) -
Generation of Inverse Term Rewriting Systems for Pure Treeless Functions
by: Nishida, Naoki, et al.
Published: (2001)