中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
A graph-based generic type system for object-oriented programs
Author: Ke, Wei ; Liu, Zhiming ; Wang, Shuling ; Zhao, Liang
Keyword: OO programs ; type systems ; generics ; type graphs ; recursive types
Source: FRONTIERS OF COMPUTER SCIENCE
Issued Date: 2013
Volume: 7, Issue:1, Pages:109-134
Indexed Type: SCI
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.
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.
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.
Language: 英语
WOS ID: WOS:000316261500009
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16947
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Ke, Wei,Liu, Zhiming,Wang, Shuling,et al. A graph-based generic type system for object-oriented programs[J]. FRONTIERS OF COMPUTER SCIENCE,2013-01-01,7(1):109-134.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Ke, Wei]'s Articles
[Liu, Zhiming]'s Articles
[Wang, Shuling]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Ke, Wei]‘s Articles
[Liu, Zhiming]‘s Articles
[Wang, Shuling]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace