Institutional Repository
| A graph-based generic type system for object-oriented programs | |
| Ke, Wei; Liu, Zhiming; Wang, Shuling; Zhao, Liang | |
| 2013 | |
| Source | FRONTIERS OF COMPUTER SCIENCE
![]() |
| ISSN | 2095-2228 |
| Volume | 7Issue:1Pages:109-134 |
| English Abstract | We present a graph-basedmodel of a generic type system for an OO language. The type system supports the features of recursive types, generics and interfaces, which are commonly found in modern OO languages such as Java. In the classical graph theory, we define type graphs, instantiation graphs and conjunction graphs that naturally illustrate the relations among types, generics and interfaces within complex OO programs. The model employs a combination of nominal and anonymous nodes to represent respectively types that are identified by names and structures, and defines graph-based relations and operations on types including equivalence, subtyping, conjunction and instantiation. Algorithms based on the graph structures are designed for the implementation of the type system. We believe that this type system is important for the development of a graph-based logical foundation of a formal method for verification of and reasoning about OO programs.; We present a graph-basedmodel of a generic type system for an OO language. The type system supports the features of recursive types, generics and interfaces, which are commonly found in modern OO languages such as Java. In the classical graph theory, we define type graphs, instantiation graphs and conjunction graphs that naturally illustrate the relations among types, generics and interfaces within complex OO programs. The model employs a combination of nominal and anonymous nodes to represent respectively types that are identified by names and structures, and defines graph-based relations and operations on types including equivalence, subtyping, conjunction and instantiation. Algorithms based on the graph structures are designed for the implementation of the type system. We believe that this type system is important for the development of a graph-based logical foundation of a formal method for verification of and reasoning about OO programs. |
| Indexed Type | SCI |
| Keyword | Oo Programs Type Systems Generics Type Graphs Recursive Types |
| Department | [Ke, Wei] Macao Polytech Inst, Macao, Peoples R China. [Liu, Zhiming; Zhao, Liang] United Nations Univ, Int Inst Software Technol, Macao, Peoples R China. [Wang, Shuling] Chinese Acad Sci, Inst Software, Beijing 100190, Peoples R China. |
| Language | 英语 |
| WOS ID | WOS:000316261500009 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16947 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Ke, Wei,Liu, Zhiming,Wang, Shuling,et al. A graph-based generic type system for object-oriented programs[J]. FRONTIERS OF COMPUTER SCIENCE,2013,7(1):109-134. |
| APA | Ke, Wei,Liu, Zhiming,Wang, Shuling,&Zhao, Liang.(2013).A graph-based generic type system for object-oriented programs.FRONTIERS OF COMPUTER SCIENCE,7(1),109-134. |
| MLA | Ke, Wei,et al."A graph-based generic type system for object-oriented programs".FRONTIERS OF COMPUTER SCIENCE 7.1(2013):109-134. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment