Conditional circular coinductive rewriting with case analysis

Joseph A. Goguen, Kai Lin, Grigore Roşu

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

We argue for an algorithmic approach to behavioral proofs, review the hidden algebra approach, develop circular coinductive rewriting for conditional goals, extend it with case analysis, and give some examples.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsMartin Wirsing, Dirk Pattinson, Rolf Hennicker
PublisherSpringer-Verlag Berlin Heidelberg
Pages216-232
Number of pages17
ISBN (Print)3540205373, 9783540205371
DOIs
StatePublished - Jan 1 2003

Publication series

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Conditional circular coinductive rewriting with case analysis'. Together they form a unique fingerprint.

  • Cite this

    Goguen, J. A., Lin, K., & Roşu, G. (2003). Conditional circular coinductive rewriting with case analysis. In M. Wirsing, D. Pattinson, & R. Hennicker (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 216-232). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2755). Springer-Verlag Berlin Heidelberg. https://doi.org/10.1007/978-3-540-40020-2_12