Results 241 to 250 of about 566,370 (267)

Prove it! Inferring Formal Proof Scripts from CafeOBJ Proof Scores

ACM Transactions on Software Engineering and Methodology, 2018
CafeOBJ is a language for writing formal specifications for a wide variety of software and hardware systems and for verifying their properties. CafeOBJ makes it possible to verify properties by using either proof scores, which consists of reducing goal-related terms in user-defined modules, or by using theorem proving. While the former is more flexible,
Adrian Riesco, Kazuhiro Ogata
exaly   +2 more sources

Fostering Proof Scores in CafeOBJ 

Lecture Notes in Computer Science, 2010
Proof scores are instructions to a proof engine such that when executed, if everything evaluates as expected, then a desired theorem is proved. Proof scores hide the detailed calculations done by machines, while revealing the proof plan created by humans.
Kokichi Futatsugi
exaly   +2 more sources

Generic Proof Scores for Generate & Check Method in CafeOBJ 

Lecture Notes in Computer Science, 2015
Generic proof scores for the generate & check method in CafeOBJ are described. The generic proof scores codify the generate & check method as parameterized modules in the CafeOBJ language independently of specific systems to which the method applies. Basic proof scores for a specific system can be obtained by instantiating the formal parameter modules ...
Kokichi Futatsugi
exaly   +2 more sources

Some Tips on Writing Proof Scores in the OTS/CafeOBJ Method

Lecture Notes in Computer Science, 2006
The OTS/CafeOBJ method is an instance of the proof score approach to systems analysis, which has been mainly devoted by researchers in the OBJ community. We describe some tips on writing proof scores in the OTS/CafeOBJ method and use a mutual exclusion protocol to exemplify the tips. We also argue soundness of proof scores in the OTS/CafeOBJ method.
Kazuhiro Ogata
exaly   +2 more sources

IPSG: Invariant Proof Score Generator

2022 IEEE 46th Annual Computers, Software, and Applications Conference (COMPSAC), 2022
Duong Dinh Tran, Kazuhiro Ogata
exaly   +2 more sources

Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs

Lecture Notes in Computer Science, 2014
We have intensively used proof scores to theorem prove that equational theory specifications of observational transition systems (OTSs) have properties. The paper describes a way to theorem prove that rewrite theory specifications of OTSs have invariant properties by proof score writing.
Kazuhiro Ogata, Kokichi Futatsugi
exaly   +2 more sources

Advances of Proof Scores in CafeOBJ : Invited Paper

2021 International Symposium on Theoretical Aspects of Software Engineering (TASE), 2021
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.
openaire   +1 more source

Strategy-proofness of scoring allocation correspondences for indivisible goods

Social Choice and Welfare, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nhan-Tam Nguyen, Dorothea Baumeister, Jörg Rothe   +2 more
openaire   +3 more sources

PROOF SCORE APPROACH TO ANALYSIS OF ELECTRONIC COMMERCE PROTOCOLS

International Journal of Software Engineering and Knowledge Engineering, 2010
Proof scores are documents of comprehensible plans to prove theorems. The proof score approach to systems analysis is a method in which proof scores are used to verify that systems enjoy properties (or analyze systems). In this paper, we describe a way to analyze electronic commerce protocols with the proof score approach, which has been developed and
Kazuhiro Ogata 0001, Kokichi Futatsugi
openaire   +1 more source