Implementing Lyee-Calculus in Java

Hamido Fujita

doi:10.1016/j.knosys.2005.10.004

Implementing Lyee-Calculus in Java

2006-06-01

1

PRE

AI

DOI：10.1016/j.knosys.2005.10.004

原文链接

原文求助

摘要

En 中文

The Lyee methodology allows the development of a software by simply defining its requirements. More precisely, a developer has only to provide words, calculation formulae, calculation conditions and layout of screens and printouts, and then leaves in the hands of the computer, all subsequent troublesome programming process, i.e. control logic aspects. The formalization of Lyee methodology led to the definition of Lyee-Calculus, a formal process algebra, that easily and naturally supports the basic concepts of the Lyee methodology. In fact, this calculus can be seen as an abstract machine, which is more suitable to support the Lyee methodology concepts than the Von Newman one. This machine considers a program as a set of molecules that interact together to produce the desired result. Basically, the Lyee-Calculus allows a high level specification of sequential, parallel and alternative processes that synchronized through communicating channels. This paper provides an implementation of the constructs of the Lyee-Calculus in Java language in order to concretely show the efficiency of this calculus and its suitability for the Lyee methodology. Moreover, this implementation aims to give to programmers an environment that allows them to automatically generate applications from formal descriptions in Lyee-Calculus. In other words, this Java implementation of the Lyee-Calculus provides a means of bridging the gap between Lyee requirement specifications and their implementations. (c) 2005 Elsevier B.V. All rights reserved.

Keyword:

Lyee methodology

Lyee-Calculus

process algebra

Java

JCSP

Implementing Lyee-Calculus in Java

摘要

AI总结

期刊

机构

引用论文