维普期刊资源整合服务平台（V6.5）

维普中文期刊产品整合服务

6篇 您的检索式：作者名="Pu Geguang"

选中清除导出查看参考文献查看引证文献引用追踪共1页首页上一页第1页下一页末页 /1 跳转

		题名	作者	年代	出处	被引量
	1	A novel requirement analysis approach for periodic control systems显示文摘	Zheng WANG Geguang PU Jiangwen LI Yuxiang CHEN Yongxin ZHAO Mingsong CHEN Bin GU Mengfei YANG Jifeng HE	2013	Frontiers of Computer Science2013，7，2：	3
	2	Towards the Semantics and Verification of BPEL4WS显示文摘	Pu Geguang Zhao Xiangpeng Wang Shuling	2006	Electronic Notes in Theoretical Computer Science2006，151，2：	1
	3	Towards the semantics and verification of BPEL4WS显示文摘	Pu Geguang Zhao Xiangpeng Wang Shuling	2006	Electronic Notes in Theoretical Computer Science2006，151，2：	1
	4	Automated coverage-driven testing: combining symbolic execution and model checking显示文摘Software testing is the primary way to ensure software quality,but occupies more than 50%the cost of software development[1].It was estimated that software failures cost the US economy alone about 60 billion each year largely due to inadequate software testing infrastructures[2].	Ting SU Geguang PU Weikai MIAO Jifeng HE Zhendong SU	2016	Science China(Information Sciences)2016，59，9：	0
	5	The stochastic semantics and verification for periodic control systems显示文摘Periodic control systems(PCS) are widely used in the embedded industry like aerospace and automotive.Such systems usually run periodic tasks and respond to the external signals.Based on our previous work on Mode diagram modeling(MDM) notations for specifying the periodic control system,we present the stochastic semantics for MDM in this paper.The stochastic semantics of MDM is based on the Markov chain.The semantics proposed here provides the basis for the satisfaction of formulae of the interval temporal logic(ITL) based specification language that is aimed to specify the properties of PCS.To verify whether the system satisfies the ITL-based properties,we apply the statistical model checking technique to efficiently estimate the probability of the system satisfying the given property with a desired level of confidence.The empirical experiments show that our approach is both effective and efficient.	YANG MengFei WANG Zheng PU GeGuang Qin ShengChao GU Bin HE JiFeng	2012	Science China(Information Sciences)2012，55，12：	0
	6	Formal modelling of list based dynamic memory allocators显示文摘Existing implementations of dynamic memory allocators(DMA) employ a large spectrum of policies and techniques. The formal specifications of these techniques are quite complicated in isolation and very complex when combined. Therefore, the formal reasoning on a specific DMA implementation is difficult for automatic tools and mostly single-use. This paper proposes a solution to this problem by providing formal models for a full class of DMA, the class using various kinds of lists to manage the memory blocks controlled by the DMA. To obtain reusable formal models and tractable formal reasoning, we organise these models in a hierarchy ranked by refinement relations. We prove the soundness of models and the refinement relations using the modeling framework Event-B and the theorem prover Rodin. We demonstrate that our hierarchy is a basis for an algorithm theory for list based DMA: it abstracts various existing implementations of DMA and leads to new DMA implementations. The applications of this formalisation include model-based code generation, testing, and static analysis.	Bin FANG Mihaela SIGHIREANU Geguang PU Wen SU Jean-Raymond ABRIAL Mengfei YANG Lei QIAO	2018	Science China(Information Sciences)2018，61，12：	0

返回顶部每页显示：

共1页首页上一页第1页下一页末页 /1 跳转

goolge学术搜索-维普

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1　渝公网安备 50019002500403号　违法和不良信息举报中心

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费