Art

J-GLOBAL ID：202002222533973036   Reference number：20A1049023

Transforming Programs with Exclusive Control into Logically Constrained Term Rewrite Systems

排他制御を含むプログラムから論理制約付き項書換え系への変換

Author (4)： KOJIMA MISAKI (名古屋大 工) ,  NISHIDA NAOKI (名古屋大 大学院情報学研究科) ,  MATSUBARA YUTAKA (名古屋大 大学院情報学研究科) ,  SAKAI MASAHIKO (名古屋大 大学院情報学研究科)
Material： 電子情報通信学会技術研究報告  (IEICE Technical Report (Institute of Electronics, Information and Communication Engineers))
Volume： 119  Issue： 451(SS2019 41-60)(Web)  Page： 31-36 (WEB ONLY)  Publication year： Feb. 26, 2020 
JST Material Number： S0532B  ISSN： 0913-5685  Document type： Proceedings
Article type： 原著論文  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： *term rewriting system ,  *program transformation ,  program verification ,  concurrent processing ,  program execution ,  programming language ,  mutual exclusion ,  queue ,  set ,  sequential processing ,  equivalency ,  computation model ,  abstract data type
Semi thesaurus term： セマフォ ,  *制約付き項書換え ,  mutual exclusion ,  並行性 ,  命令型プログラミング言語

JST classification (1)： Computer system development  (JD02010R)

Reference (11)：

• F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
• Ştefan Ciobâcă and D. Lucanu. A coinductive approach to proving reachability properties in logically constrained term rewriting systems. In Proc. IJCAR 2018, Vol. 10900 of LNCS, pp. 295-311. Springer, 2018.
• C. Fuhs, C. Kop, and N. Nishida. Verifying procedural programs via constrained rewriting induction. ACM Transactions on Computational Logic, 18(2):14:1-14:50, 2017.
• Y. Kanazawa and N. Nishida. On transforming functions accessing global variables into logically constrained term rewriting systems. In Proc. WPTE 2018, Vol. 289 of EPTCS, pp. 34-52. Open Publishing Association, 2019.
• C. Kop and N. Nishida. Term rewriting with logical constraints. In Proc. FroCoS 2013, Vol. 8152 of LNCS, pp. 343-358. Springer, 2013.

Terms in the title (4)： 排他制御 ,  論理 ,  制約 ,  項書換え系