期刊文献+

基于ε-互模拟的软件近似正确性模型 被引量:2

Model of software approximate correctness under ε- bisimulation
下载PDF
导出
摘要 软件正确性是软件可信性的重要属性。在实际软件开发和设计中,需要不断地对软件进行修改,从而软件越来越正确。为了讨论软件的动态近似正确性,基于概率进程代数的ε-互模拟,建立软件越来越正确的形式化描述。定义ε-极限互模拟,用来反应软件实现与规范之间的关系,给出一些特殊的ε-极限互模拟。提出ε-互模拟极限,用其刻画规范是软件实现的极限形式,同时证明ε-互模拟极限的一些性质。 The correctness of software is a key attribution for truStworthiness of software. In the real development and design, the software is modified constantly in order to get correctness, and the software is correct more and more. This paper focuses on the dynamic characterization of correctness. Based on ε- bisimulation of probabilistic process algebra,ε- limit bisimulation is defined which reflects the relation between implementation and its specification, and some special ε- limit bisimulations are showed, ε- bisimulation limit is presented, which states that specification is the limit of implementations. Some important pro- perties are proved.
作者 马艳芳 陈亮
出处 《计算机工程与应用》 CSCD 2013年第11期15-19,60,共6页 Computer Engineering and Applications
基金 安徽省自然科学基金(No.1308085QF117) 安徽高校省级自然科学研究重点项目(No.KJ2011A248) 安徽高校省级自然科学研究一般项目(No.KJ2012Z347) 上海市高可信计算重点实验室开放项目(No.07DZ22304201004)
关键词 可信性 正确性 形式化 进程代数 trustworthiness correctness formalization process algebra
  • 相关文献

参考文献15

  • 1Baeten J C,Weijland W P.Process algebra[M].Cambridge:Cam- bridge University Press, 1990.
  • 2Hoare C A R.Communicating sequential processes[M].New York: Prentice Hall, 1985.
  • 3Milner R.Communication and concurrency[M].New York: Pren- tice Hall, 1989.
  • 4Ying M S.Topology in process calculus:approximate correctness and infinite evolution~ of concurrency programs[M].Berlin: Springer-Verlag, 2001.
  • 5Ma Y F, Zhang M.Topological construction of parameterized bisimulation limit[C]//Electronic Notes in Theoretical Com- puter Science.Amsterdam:Elsevier Science,2009,257:57-70.
  • 6Ma Y F, Zhang M.Parameterized bisimulation infinite evolution mechanism[C]//3rd IEEE International Symposium on Theo- retical Aspects of Software Engineering, Tianjin, China.Los Alamitos,CA:IEEE Computer Society,2009:299-300.
  • 7马艳芳,张敏,陈仪香.基于环境的软件正确性形式化描述[J].山东大学学报(理学版),2011,46(9):22-27. 被引量:3
  • 8Frank B, James W.Approximating and computing behavioural distances in probabilistic transition systems[J].Theoretical Com- puter Science,2006,360(1/3) :373-385.
  • 9Song L, Deng Y X, Cai X J.Towards automatic measurement of probabilistic processes[C]//7th International Conference on Quality Software, Portland.Washington: IEEE Computer Society,2009:50-59.
  • 10Deng Y X, Glabbeek R, Hennessy M, et al.Testing finitary probabilistic processes[C]//Lecture Notes in Computer Science 5710: The 20th International Conference on Concurrency Theory, Bologna, Italy.Berlin: Springer-Verlag, 2009 : 274-288.

二级参考文献1

共引文献2

同被引文献27

  • 1郑志明,马世龙,李未,姜鑫,韦卫,马丽丽,唐绍婷.软件可信复杂性及其动力学统计分析方法[J].中国科学(F辑:信息科学),2009,39(10):1050-1054. 被引量:7
  • 2沈昌祥,张焕国,王怀民,王戟,赵波,严飞,余发江,张立强,徐明迪.可信计算的研究与发展[J].中国科学:信息科学,2010,40(2):139-166. 被引量:251
  • 3Berstra J A, Klop J W. Algebra of communicating processes with abstraction. Theoretical Computer Science, 1985, 37: 77-121.
  • 4Reisig W. Petri Nets: An Introduction. New York: Springer, 1985.
  • 5Milner R. A Calculus of Communicating Systems. New York: Springer, 1982.
  • 6Milner R. A complete inference system for a class of regular behaviors. Journal of Compute System, 1984, 28(3): 439- 466.
  • 7Hennessy M, Milner R. Algebraic laws for nodeterminism and concurrency. Journal of the ACM, 1985, 32(1): 137-161.
  • 8Milner R. ICommunication and Concurrency. New York: Prentice Hall, 1989.
  • 9Milner R( Communicating and Mobile Systems: The π-Calculus. Cambridge: Cambridge University Press, 1999.
  • 10Hoare C A R. Communicating sequential processes. Commu- nications of the ACM, 1978, 21(8): 666-677.

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部