Results 1 to 10 of about 491 (95)

Transport Layer Security 1.0 handshake protocol formal verification case study: How to use a proof script generator for existing large proof scores [PDF]

open access: yesPeerJ Computer Science, 2023
The Transport Layer Security (TLS) 1.0 protocol has been formally verified with CafeInMaude Proof Generator (CiMPG) and Proof Assistant (CiMPA), where CafeInMaude is the second major implementation of CafeOBJ, a direct successor of OBJ3, a canonical ...
Duong Dinh Tran   +2 more
doaj   +3 more sources

Using CafeOBJ to Mechanise Refactoring Proofs and Application [PDF]

open access: yesElectronic Notes in Theoretical Computer Science, 2007
AbstractIn this paper we show how rewriting systems, in particular CafeOBJ, can be used to automatically prove refactoring rules. In addition, a small case study that illustrates the application of a refactoring rule in an arbitrary program is also developed. Our approach is based on a sequential object-oriented language of refinement (rool) similar to
Antonio Carvalho Júnior   +2 more
exaly   +4 more sources

Advances of proof scores in CafeOBJ

open access: yesScience of Computer Programming, 2022
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.
Kokichi Futatsugi
exaly   +3 more sources

An integrated tool set for verifying CafeOBJ specifications [PDF]

open access: yesJournal of Systems and Software, 2022
CafeOBJ is a language for specifying and verifying a wide variety of software and/or hardware systems. Traditionally, verification has been carried out via proof scores, which consist of reducing goalrelated terms in user-defined modules. Although proof scores are semi-formal (the specifier is partially responsible for soundness), their flexibility ...
Adrian Riesco, Kazuhiro Ogata
exaly   +4 more sources

An Integration of CafeOBJ into Full Maude [PDF]

open access: yesLecture Notes in Computer Science, 2014
We present in this paper an integration of CafeOBJ into Full Maude. We have developed a grammar to parse any CafeOBJ specification, an intermediate language to store it, and a translation from this representation into Maude specifications. This integration enhances CafeOBJ functionality in many ways: our intermediate representation has been developed ...
Adrian Riesco
exaly   +2 more sources

Principles of proof scores in CafeOBJ

open access: yesTheoretical Computer Science, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Gaina, Kazuhiro Ogata
exaly   +3 more sources

Trace anonymity in the OTS/CafeOBJ method

open access: yes2008 8th IEEE International Conference on Computer and Information Technology, 2008
We report on a case study in which the OTS/CafeOBJ method is used to formalize and verify trace anonymity property of distributed systems. In this case study, the property of trace anonymity is formalized with the trace notations of observational transition systems (OTSs), and CafeOBJ language/system is used as an interactive theorem prover to verify ...
Kazuhiro Ogata
exaly   +4 more sources

Simulation-Based Invariant Verification Technique for the OTS/CafeOBJ Method

open access: yesIEEE Access, 2021
We demonstrate the power of the simulation-based invariant verification technique through two case studies in which it is formally verified that two mutual exclusion protocols, MCS protocol and Anderson protocol, enjoy the mutual exclusion property by ...
Duong Dinh Tran   +2 more
doaj   +1 more source

Parchments for CafeOBJ Logics [PDF]

open access: yes, 2014
This paper addresses issues arising in the systematic construction of large logical systems. We rely on a model-theoretic view of logical systems, captured by institutions that are in turn presented by parchments. We define their categories, and study constructions that may be carried out in these categories.
Till Mossakowski   +3 more
openaire   +2 more sources

Logical foundations of CafeOBJ

open access: yesTheoretical Computer Science, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Razvan Diaconescu, Kokichi Futatsugi
openaire   +1 more source

Home - About - Disclaimer - Privacy