Principles of proof scores in CafeOBJ

Authors:
Kokichi Futatsugi;Daniel Gin;Kazuhiro Ogata
Affiliations:
-;-;-
Venue:
Theoretical Computer Science
Year:
2012

Citing 17
Cited 0

Specifications in an arbitrary institution

Information and Computation - Semantics of Data Types
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations

Theoretical Computer Science
Institutions: abstract model theory for specification and programming

Journal of the ACM (JACM)
Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems

Information and Computation
Principles of OBJ2

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Logical foundations of cafeOBJ

Theoretical Computer Science - Rewriting logic and its applications
Logical systems for structured specifications

Theoretical Computer Science
Membership algebra as a logical framework for equational specification

WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Formal Methods in CafeOBJ

FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks

ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
Verifying Specifications with Proof Scores in CafeOBJ

ASE '06 Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering
Verifying Design with Proof Scores

Verified Software: Theories, Tools, Experiments
Institution-independent Model Theory

Institution-independent Model Theory
Constructor-based institutions

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Twenty years of rewriting logic

WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Fostering proof scores in CafeOBJ

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Coverset induction with partiality and subsorts: a powerlist case study

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper describes the theoretical principles of a verification method with proof scores in the CafeOBJ algebraic specification language. The verification method focuses on specifications with conditional equations and realizes systematic theorem proving (or interactive verification). The method is explained using a simple but instructive example, and the necessary theoretical foundations, which justify every step of the verification, are described with precise mathematical definitions. Some important theorems that result from the definitions are also presented.