Results 61 to 70 of about 491 (95)

Towards a correct translation from ASN.1 into CafeOBJ

International Journal of Reasoning-based Intelligent Systems, 2010
The adoption of algebraic specification techniques by the networks' research community is happening slowly but steadily. We present a software environment that can translate a protocol's specification, from Abstract Syntax Notation One (ASN.1), into the powerful algebraic specification language CafeOBJ.
Konstantinos Barlas
exaly   +2 more sources

Writing Concurrent Java Programs Based on CafeOBJ Specifications

2017 24th Asia-Pacific Software Engineering Conference (APSEC), 2017
CafeOBJ is an advanced algebraic specification language that can be used for writing formal specifications of various software systems and verifying properties of them. It implements equational logic by rewriting and can be used as a powerful interactive theorem proving system.
Kazuhiro Ogata
exaly   +2 more sources

Specifying and verifying a railroad crossing with cafeOBJ

Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, 2005
CafeOBJ is a wide spectrum specification language based on multiple logical foundations. CafeOBJ can be used to specify dynamic as well as static aspects of systems including object-oriented and reactive systems and verify their properties with the help of the CafeOBJ system.
Kazuhiro Ogata 0001, Kokichi Futatsugi
openaire   +1 more source

Towards a Combination of CafeOBJ and PAT

2014
In the quest for tractable formal methods to improve the practice of software engineering, both CafeOBJ [7] and PAT [12] have made great achievements based on different formal techniques. CafeOBJ has an evident advantage in specifying concurrent systems with object-oriented methods and proving behavioral properties based on reusability of proof ...
Yongxin Zhao, Jin Song Dong, Yang Liu 0003, Jun Sun 0001   +3 more
openaire   +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

On Automation of OTS/CafeOBJ Method

2014
The proof scores method is an interactive verification method in algebraic specification that combines manual proof planning and reduction (automatic inference by rewriting). The proof score approach to software verification coordinates efficiently human intuition and machine automation.
Daniel Gâinâ, Dorel Lucanu, Kazuhiro Ogata 0001, Kokichi Futatsugi   +3 more
openaire   +1 more source

Formal Methods in CafeOBJ

2002
Formal methods are still expected to improve the practice of software engineering. The areas in which formal methods will play important roles include at least: (1) distributed component software, (2) network/system security, (3) embedded systems. Formal methods are better supported by formal specification languages equipped with formal verification ...
openaire   +1 more source

Chocolat/SMV: A Translator from CafeOBJ into SMV

Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Chocolat/SMV is a translator that takes a CafeOBJ specification of a transition system called an OTS and generates an SMV specification of a finite version of the OTS. The primary purpose of the translation is to find errors lurked in CafeOBJ specifications of OTSs with SMV.
Kazuhiro Ogata 0001, Masahiro Nakano, Masaki Nakamura 0001, Kokichi Futatsugi   +3 more
openaire   +1 more source

Verifying Specifications with Proof Scores in CafeOBJ

21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06), 2006
Verifying specifications is still one of the most important undeveloped research topics in software engineering. It is important because quite a few critical bugs are caused at the level of domains, requirements, and/or designs. It is also important for the cases where no program codes are generated and specifications are analyzed and verified only for
openaire   +1 more source

CafeOBJ as a Tool for Behavioral System Verification

2003
We report on a machine supported method for verifying safety properties of dynamic systems based on the first-order description of underlying state transition systems. By capturing a set of states by a state predicate, we can verify safety properties of infinite-state systems using predicate calculus in the set-theoretic iterative calculation of least ...
Akira Mori, Kokichi Futatsugi
openaire   +1 more source