K. Ogata

Publications156
h-index19
Citations1,219
Highly Influential Citations53
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • K. Futatsugi
  • 211 Publications • 2,932 Citations
  • J. Meseguer
  • 455 Publications • 16,749 Citations
  • A. Riesco
  • 65 Publications • 419 Citations
  • J. Goguen
  • 286 Publications • 17,724 Citations
  • Publications
  • Influence
The evaluation strategy for head normal form with and without on-demand flags
TLDR
We propose two conditions of the E-strategy with and without on-demand flags on which an evaluated term is always in head normal form for left-linear constructor TRSs. Expand
  • 44
  • 12
Some Tips on Writing Proof Scores in the OTS/CafeOBJ Method
TLDR
We describe some tips on writing proof scores in the OTS/CafeOBJ method and use a mutual exclusion protocol to exemplify the tips. Expand
  • 60
  • 4
  • PDF
CafeOBJ: Logical Foundations and Methodologies
TLDR
OBJ is an executable industrial strength multi-logic specification language which is a modern successor of OBJ and incorporates several new algebraic specification paradigms. Expand
  • 36
  • 4
Operational semantics of rewriting with the on-demand evaluation strategy
TLDR
We have written the operational semantics of rewriting with the on-demand E-strategy in CafeOBJ so that we can deeply understand rewriting with this strategy. Expand
  • 25
  • 4
  • PDF
Induction-Guided Falsification
TLDR
The induction-guided falsification searches a bounded reachable state space of a transition system for a counterexample that the system satisfies an invariant property, from which some other invariant properties may be obtained as lemmas. Expand
  • 18
  • 2
  • PDF
Constructor-based Logics
TLDR
We give an institution-independent definition of reachable model, and we apply it to obtain a new institution by enhancing the syntax of a base institution with constructors and restricting the semantics to reachable models. Expand
  • 19
  • 2
  • PDF
Proof Scores in the OTS/CafeOBJ Method
TLDR
A way to write proof scores showing that distributed systems have invariant properties in algebraic specification languages is described, which has been devised through several case studies. Expand
  • 99
  • 1
  • PDF
Equational Approach to Formal Analysis of TLS
  • K. Ogata, K. Futatsugi
  • Computer Science
  • 25th IEEE International Conference on Distributed…
  • 6 June 2005
TLS has been formally analyzed with the OTS/CafeOBJ method. In the method, distributed systems are modeled as transition systems, which are written in terms of equations, and it is verified that the… Expand
  • 47
  • 1
  • PDF
Formal Analysis of the iKP Electronic Payment Protocols
TLDR
iKP (i-Key-Protocol, i = 1,2,3) is a family of payment protocols and one of the ancestors of SET. Expand
  • 38
  • 1
Model Checking of a Mobile Robots Perpetual Exploration Algorithm
TLDR
This paper presents a case study of how to specify and model check a given robot algorithm in Maude, a rewriting logic-based programming and specification language. Expand
  • 21
  • 1
...
1
2
3
4
5
...