Algebraic Model Checking
TL;DR: Three algebraic approaches to model checking are presented and compared with each other with respect to their range of applications and their degree of automation.
read more
Abstract: Three algebraic approaches to model checking are presented and compared with each other with respect to their range of applications and their degree of automation. They have been implemented and tested in our Haskell-based formal-reasoning and -presentation system Expander2. Besides realizing and integrating state-of-the-art proof and computation rules the system admits the co/algebraic specification of the models to be checked in terms of rewrite rules and functional-logic programs. It also offers flexible features for visualizing and even animating models and computations. This paper does not present purely theoretical work. Due to the increasing abstraction potential of programming languages like Haskell, traditional gaps between specification formalisms and their executable implementations as well as between systems developed in different communities are going to vanish. The topics discussed in this article and the way of their presentation reflect this fact.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Mathematical Theory of Computation
John J. McCarthy
- 01 Aug 1991
TL;DR: The goals of this project were the development of logical formalisms for reasoning about programs that use abstractions and reflection, and the application of these theoretical results to selected software problems.
735
Conditional circular coinductive rewriting with case analysis
Joseph A. Goguen,Kai Lin,Grigore Rosu +2 more
- 01 Dec 2003
TL;DR: It is argued 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.
23
From grammars and automata to algebras and coalgebras
Peter Padawitz
- 21 Jun 2011
TL;DR: The basic concepts of co/algebra are summarized and illustrated at a couple of signatures including those used in language or compiler construction like regular expressions or acceptors.
1
References
Universal coalgebra: a theory of systems
TL;DR: The three basic notions of universal algebra: algebra, homomorphism of algebras, and congruence, turn out to correspond to: coalgebra, homomorphicism of coalgebrAs, and bisimulation, respectively, which are taken as the basic ingredients of a theory called universal coalgebra.
1.4K
Universal coalgebra: a theory of systems
Jan Rutten
- 01 Jan 1996
TL;DR: In this article, the notion of bisimulation on coalgebras has been shown to be formally dual to that of congruence on coalgebra homomorphisms, which is called universal coalgebra.
1K
•Book
Mathematical Theory of Computation
Zohar Manna
- 01 Jan 1972
TL;DR: This book is a classic text on sequential program verification; it has been widely translated from the original Hebrew and is much in demand among graduate students in the field of computer science.
739
Mathematical Theory of Computation
John J. McCarthy
- 01 Aug 1991
TL;DR: The goals of this project were the development of logical formalisms for reasoning about programs that use abstractions and reflection, and the application of these theoretical results to selected software problems.
735
Logic in Computer Science: Modelling and Reasoning About Systems
TL;DR: Logic mathematics and computer science modern foundations with practical applications and automated reasoning and mathematics essays in memory of william w mccune lecture notes in computer science PDF
684