a graph-based implementation for mechanized refinement calculus of oo programs

ISCAS OpenIR

	a graph-based implementation for mechanized refinement calculus of oo programs
	Liu Zhiming; Morisset Charles; Wang Shuling
	2011
会议名称	13th Brazilian Symposium on Formal Methods, SBMF 2010
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	258-273
会议日期	8-Nov
会议地点	Natal, Brazil
收录类别	ei
出版地	Germany
ISSN	3029743
ISBN	9783642198281
部门归属	(1) UNU-IIST, P.O. Box 3058, Macau, China; (2) Royal Holloway, Information Security Group, University of London, Egham, Surrey TW20 0EX, United Kingdom; (3) State Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences, China
摘要	This paper extends the mechanization of the refinement calculus done by von Wright in HOL, representing the state of a program as a graph instead of a tuple, in order to deal with object-orientation. The state graph structure is implemented in Isabelle, together with definitions and lemmas, to help the manipulation of states. We then show how proof obligations are automatically generated from the rCOS tool and can be loaded in Isabelle to be proved. We illustrate our approach by generating the proof obligations for a simple example, including object access and method invocation. © 2011 Springer-Verlag Berlin Heidelberg.
关键词	Calculations Formal Methods Machinery Problem Solving
主办者	CNPq, Brazilian Scientific and Technological Research Council; CAPES, Brazilian Higher Education Funding Council; The Federal University of Rio Grande do Norte (UFRN); Miranda Computacao e Comercio Ltda; SETIRN
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/14385
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Liu Zhiming,Morisset Charles,Wang Shuling. a graph-based implementation for mechanized refinement calculus of oo programs[C]. Germany,2011:258-273.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
a graph-based implem（266KB）			开放获取	--	请求全文