Results 71 to 80 of about 491 (95)
Some of the next articles are maybe not open access.
Formal digital license language with OTS/CafeOBJ method
2008 IEEE/ACS International Conference on Computer Systems and Applications, 2008This paper discusses how to model digital licenses as observational transition systems (OTSs) with CafeOBJ, a formal algebraic specification language. To extend the concept of licensing to cover various application domains of digital rights management, we first analyze the concepts of permission and obligation with some real-world examples which are ...
Jianwen Xiang +2 more
openaire +1 more source
Fostering Proof Scores in CafeOBJ
2010Proof 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.
openaire +1 more source
Past, Present, and Future of SRA Implementation of CafeOBJ
2003CafeOBJ is a formal language for specifying or defining models of real problems, and also for analyzing and/or verifying the properties of the models [1, 7, 8]. It is based on algebraic specification techniques and is a member of OBJ [6, 14, 19] language family.
Toshimi Sawada +2 more
openaire +1 more source
Key-Secrecy of PACE with OTS/CafeOBJ
2015The ICAO-standardized Password Authenticated Connection Establishment (PACE) protocol is used all over the world to secure access to electronic passports. Key-secrecy of PACE is proven by first modeling it as an Observational Transition System (OTS) in CafeOBJ, and then proving invariant properties by induction.
openaire +2 more sources
A Methodological Guide to the CafeOBJ Logic
2007CafeOBJ is an executable industrial-strength algebraic specification language; it is a modern successor of OBJ and incorporates several new algebraic specification paradigms. It was developed in Japan with large-scale support from the Japanese government.
openaire +1 more source
Generate & Check Method for Verifying Transition Systems in CafeOBJ
2015An interactive theorem proving method for the verification of infinite state transition systems is described.
openaire +1 more source
Generic Proof Scores for Generate & Check Method in CafeOBJ
2015Generic 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 ...
openaire +1 more source
Prove it! Inferring Formal Proof Scripts from CafeOBJ Proof Scores
ACM Transactions on Software Engineering and Methodology, 2018Adrian Riesco, Kazuhiro Ogata
exaly