Journal Article10.1016/J.KNOSYS.2003.08.006
Mathematical structure model for word-based program
Osamu Arai,H. Fujita +1 more
6
TL;DR: This paper presents a mathematical ground for the Lyee methodology, which has already produced several achievements in industry, and shows how a system divided for catching correct requirements quickly is integrated and its optimal program with minimum repetitions can be generated by rearranging words into the right order.
read more
Abstract: The new software world is progressing steadily forward but is not yet within range of where it needs to be. This paper presents a mathematical ground for the Lyee methodology, which has already produced several achievements in industry. This method enables us not to attention the sequential order of program execution. By introducing the concept of a state, it is possible to prove the program structure. The construction of such a program structure allows programmers to focus on conditions and formulae that calculate the value. Through this model, a system divided for catching correct requirements quickly is integrated, and its optimal program with minimum repetitions can be generated by rearranging words into the right order.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
New Verification of Reactive Requirement for Lyee Method
Osamu Arai,Hamido Fujita +1 more
- 11 Jun 2007
TL;DR: The structure of Lyee program with multi SF is linked to process model and the properties that requirement and operation should have are described as a proposition in terms of temporal logic and are verified by such logic.
2
•Proceedings Article
Towards a Verification-Based Development Approach for Reactive Systems
Tae Kameda,Osamu Arai,Sergei Gorlatch,Hamido Fujita +3 more
- 19 Jul 2009
TL;DR: In this paper, the authors describe a development approach based on using the formal mechanism of State Transition Rules (STR) for specifying a reactive system, which allows the developer to generate a provably correct target program.
Towards a verification-based development approach for reactive systems
Tae Kameda,Osamu Arai,Sergei Gorlatch,Hamido Fujita +3 more
- 01 Jan 2009
TL;DR: This work describes a novel development approach based on using the formal mechanism of State Transition Rules (STR) for specifying a reactive system's STR into a Lyee program specification, which allows the developer to generate a provably correct target program.
Towards Verifying Declarative Specifications of Reactive Systems
Tae Kameda,Osamu Arai,Sergei Gorlatch,Hamido Fujita +3 more
TL;DR: This paper extends the Lyee software development system with State Transition Rules (STR) to verify declarative specifications of reactive systems, improving program quality through property verification, demonstrated with an Othello game example.
Towards a Verification-Based Development Approach for Reactive Systems
Tae Kameda,Osamu Arai,Sergei Gorlatch,Hamido Fujita +3 more
TL;DR: Researchers propose a verification-based development approach for reactive systems using State Transition Rules (STR) and Lyee program specifications, enabling the generation of provably correct target programs, illustrated through an interactive Othello game example.
References
•Book
Applications of linear algebra
Chris Rorres,Howard Anton +1 more
- 01 Jan 1977
TL;DR: In this article, a least square fitting to data model for human hearing has been proposed, based on the Fourier series cubic spline interpolation (FSCI) algorithm.
84
Applications of linear algebra
Jiřı́ Matoušek,Jaroslav Nešetřil +1 more
- 23 Jul 1998
TL;DR: Applications of linear algebra involve solving problems related to block designs, covering complete graphs, vector spaces, and algorithms. These applications demonstrate the power of linear algebra in solving complex problems.
3
•Book
Semantics With Applications: A Formal Introduction
Hanne Riis Nielson,Flemming Nielson +1 more
- 01 Mar 1992
TL;DR: Axiomatic program verification: direct proofs of program correctness partial correctness assertions soundness and completeness extensions of the axiomatic systems assertions for execution time.