Testing Type Consistency of Method Schemas
スポンサーリンク
概要
- 論文の詳細を見る
Method schemas were proposed as a formal model of object-oriented languages. A method schema S is called consistent if, for each method invocation during the execution of S, a method definition to be bound to the invoked method name is uniquely determined. However, the consistency testing problem is known to be undecidable in general. This paper presents an algorithm which analyzes the consistency of a given method schema. The algorithm decides the consistency problem in polynomial time for monadic method schemas. We also provide an incremental algorithm for testing consistency after updates of a method schema.
- 社団法人電子情報通信学会の論文
- 1998-03-25
著者
-
Ishihara Yasunori
With Graduate School Of Information Science Nara Institute Of Science And Technology
-
SEKI Hiroyuki
with Graduate School of Information Science, Nara Institute of Science and Technology
-
DODO Hiroki
with Graduate School of Information Science, Nara Institute of Science and Technology
-
Dodo Hiroki
With Graduate School Of Information Science Nara Institute Of Science And Technology:kansai Electric
-
Seki Hiroyuki
With Graduate School Of Information Science Nara Institute Of Science And Technology