Advances of Proof Scores in CafeOBJ

12/20/2021
by   Kokichi Futatsugi, et al.
0

Critical flaws continue to exist at the level of domain, requirement, and/or design specification, and specification verification (i.e., to check whether a specification has desirable properties) is still one of the most important challenges in software/system engineering. CafeOBJ is an executable algebraic specification language system and domain/requirement/design engineers can write proof scores for improving quality of specifications by the specification verification. This paper describes advances of the proof scores for the specification verification in CafeOBJ.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2023

A Formal Algebraic Framework for DSL Composition

We discuss a formal framework for using algebraic structures to model a ...
research
03/06/2018

From SysML/KAOS Domain Models to B System Specifications

In this paper, we use a combination of the SysML/KAOS requirements engin...
research
07/02/2019

Specifying verified x86 software from scratch

We present a simple framework for specifying and proving facts about the...
research
04/25/2023

Modeling Adaptive Self-healing Systems

Motivation: Smart grids design requires energy distribution operations t...
research
08/10/2022

Verification of the busy-forbidden protocol (using an extension of the cones and foci framework)

The busy-forbidden protocol is a new readers-writer lock with no resourc...
research
06/07/2018

Specification of State and Time Constraints for Runtime Verification of Functions

Techniques for runtime verification often utilise specification language...
research
10/28/2020

Specification description and verification of multitask hybrid systems in the OTS/CafeOBJ method

To develop IoT and/or CSP systems, we need consider both continuous data...

Please sign up or login with your details

Forgot password? Click here to reset