Testing Type Consistency of Method Schemas
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E81-D No.3 pp.278-287
- Publication Date
- 1998/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Software Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroyuki SEKI, Yasunori ISHIHARA, Hiroki DODO, "Testing Type Consistency of Method Schemas" in IEICE TRANSACTIONS on Information,
vol. E81-D, no. 3, pp. 278-287, March 1998, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e81-d_3_278/_p
Copy
@ARTICLE{e81-d_3_278,
author={Hiroyuki SEKI, Yasunori ISHIHARA, Hiroki DODO, },
journal={IEICE TRANSACTIONS on Information},
title={Testing Type Consistency of Method Schemas},
year={1998},
volume={E81-D},
number={3},
pages={278-287},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Testing Type Consistency of Method Schemas
T2 - IEICE TRANSACTIONS on Information
SP - 278
EP - 287
AU - Hiroyuki SEKI
AU - Yasunori ISHIHARA
AU - Hiroki DODO
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E81-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 1998
AB - 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.
ER -
English
