Informatics, TU Vienna

Foundations of Verification with Proof Scores in CafeOBJ

The Verification method with proof scores is an interactive theorem proving method based on algebraic specifications.

Abstract

The Verification method with proof scores is an interactive theorem proving method based on algebraic specifications. We have been developing verifications with proof scores in CafeOBJ algebraic specification language for more than ten years. This talk explains theoretical foundations of verification with proof scores using simple and insightful examples. The focuses of the talk are (1) Model based verification, (2) Quasi-complete proof rules, (3) Analyses of relations between specifications and proofs.

Biography

Kokichi Futatsugi has been a professor of JAIST since 1993. Before getting a full professorship at JAIST, he worked at ETL (Electrotechnical Laboratory), MITI (Ministry of International Trade and Industry), Japanese Government and was appointed the Chief Researcher of ETL in 1992. He worked also at SRI International (Stanford Research Institute), California for 1983-1984 as a visiting researcher. His research interests include formal specification languages, formal methods, systems verifications, software requirements/specifications, and his current research activities are centered around formal specification and verification based on CafeOBJ (an executable formal specification language). He got a Fellow Award of Japan Society for Software Science and Technology in 2008, and is now adviser/editor of international journals like IJSI, JAL, and JHOSC.

Note

This talk is organized by the Compilers and Languages Group at the Institute of Computer Languages.
Tea at the library of E185/1, Argentinierstr. 8, 4th floor (central) at 14:30.