Testing Type Consistency of Method Schemas

摘要

Method schemas were propose 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 prob- lem 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 poly- nomial time for monadic method schemas. We also provide an incremental algorithm for testing consistency after updates of a method schema.