Proving Theorems by Program Transformation

From MaRDI portal

Revision as of 19:25, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2865083

Jump to:navigation, search

DOI10.3233/FI-2013-899zbMath1315.03019OpenAlexW1555798792MaRDI QIDQ2865083

Fabio Fioravanti, Valerio Senni, Alberto Pettorossi, Maurizio Proietti

Publication date: 28 November 2013

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2013-899

zbMATH Keywords

quantifier elimination program transformation automated theorem proving constraint logic programming temporal logics bisimilarity program specialization

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Logic programming (68N17) Temporal logic (03B44) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Analysis and Transformation of Constrained Horn Clauses for Program Verification

This page was built for publication: Proving Theorems by Program Transformation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2865083&oldid=15806573"