Verifying procedural programs via constrained rewriting induction

Carsten Fuhs, Cynthia Louisa Martina Kop, Naoki Nishida

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review

29 Citationer (Scopus)

Originalsprog	Engelsk
Artikelnummer	14
Tidsskrift	ACM Transactions on Computational Logic
Vol/bind	18
Udgave nummer	2
Antal sider	50
ISSN	1529-3785
DOI	https://doi.org/10.1145/3060143
Status	Udgivet - jun. 2017

Adgang til dokumentet

@article{708e96c76c7243e882ffb6df314b572a,

title = "Verifying procedural programs via constrained rewriting induction",

keywords = "Constrained term rewriting, inductive theorem proving, rewriting induction, lemma generation, program analysis",

author = "Carsten Fuhs and Kop, {Cynthia Louisa Martina} and Naoki Nishida",

year = "2017",

month = jun,

doi = "10.1145/3060143",

language = "English",

volume = "18",

journal = "ACM Transactions on Computational Logic",

issn = "1529-3785",

publisher = "Association for Computing Machinery, Inc.",

number = "2",

}

TY - JOUR

T1 - Verifying procedural programs via constrained rewriting induction

AU - Fuhs, Carsten

AU - Kop, Cynthia Louisa Martina

AU - Nishida, Naoki

PY - 2017/6

Y1 - 2017/6

KW - Constrained term rewriting

KW - inductive theorem proving

KW - rewriting induction

KW - lemma generation

KW - program analysis

U2 - 10.1145/3060143

DO - 10.1145/3060143

M3 - Journal article

SN - 1529-3785

VL - 18

JO - ACM Transactions on Computational Logic

JF - ACM Transactions on Computational Logic

IS - 2

M1 - 14

ER -