On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We study partial and total correctness proof methods based on generalized fixpoint/iteration/variant induction principles applied to the denotational semantics of first-order functional and iterative programs.

Original languageEnglish (US)
Title of host publicationLogic-Based Program Synthesis and Transformation - 29th International Symposium, LOPSTR 2019, Revised Selected Papers
EditorsMaurizio Gabbrielli
PublisherSpringer
Pages3-18
Number of pages16
ISBN (Print)9783030452599
DOIs
StatePublished - 2020
Event29th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2019 - Porto, Portugal
Duration: Oct 8 2019Oct 10 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12042 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference29th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2019
Country/TerritoryPortugal
CityPorto
Period10/8/1910/10/19

Keywords

  • Denotational semantics
  • Induction principles
  • Partial and total correctness
  • Verification

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics'. Together they form a unique fingerprint.

Cite this