Presentation 1994/3/9
Formal Verification for stepwise programming in concurrent logic language
Yukihiro Oda, Masaki Murakami,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper,we construct a new semantics for concurrent logic programming language GHG-which maps a program to a finite set.We achieve that by a finite set and an operator which extends the set to an infinite one.We regard the semantics-mapping as a procedure to extract specifications of programs.We apply the semantics to the formal verification for stepwise programming such as rapid- prototyping.We present a method to verify whether the next version of a program inherits the functions of the original version using the specification generated from the original one by the semantics- mapping.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) GHC / formal semantics / stepwise programming / formal specification
Paper # COMP93-81,SS93-49
Date of Issue

Conference Information
Committee COMP
Conference Date 1994/3/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Formal Verification for stepwise programming in concurrent logic language
Sub Title (in English)
Keyword(1) GHC
Keyword(2) formal semantics
Keyword(3) stepwise programming
Keyword(4) formal specification
1st Author's Name Yukihiro Oda
1st Author's Affiliation Graduate school Information Technology,Okayama University()
2nd Author's Name Masaki Murakami
2nd Author's Affiliation Department of Information Technology,Okayama University
Date 1994/3/9
Paper # COMP93-81,SS93-49
Volume (vol) vol.93
Number (no) 496
Page pp.pp.-
#Pages 8
Date of Issue