排序方式: 共有37条查询结果,搜索用时 15 毫秒
1.
This paper describes a verified compiler for PreScheme, the implementation language for thevlisp run-time system. The compiler and proof were divided into three parts: A transformational front end that translates source text into a core language, a syntax-directed compiler that translates the core language into a combinator-based tree-manipulation language, and a linearizer that translates combinator code into code for an abstract stored-program machine with linear memory for both data and code. This factorization enabled different proof techniques to be used for the different phases of the compiler, and also allowed the generation of good code. Finally, the whole process was made possible by carefully defining the semantics ofvlisp PreScheme rather than just adopting Scheme's. We believe that the architecture of the compiler and its correctness proof can easily be applied to compilers for languages other than PreScheme.This work was supported by Rome Laboratory of the United States Air Force, contract No. F19628-89-C-0001, through the MITRE Corporation, and by NSF and DARPA under NSF grants CCR-9002253 and CCR-9014603. Author's current address: Department of Computer Science and Engineering, Oregon Graduate Institute, P.O. Box 91000, Portland, OR 97291-1000.The work reported here was supported by Rome Laboratory of the United States Air Force, contract No. F19628-89-C-0001. Preparation of this paper was generously supported by The MITRE Corporation.This work was supported by Rome Laboratory of the United States Air Force, contract No. F19628-89-C-0001, through the MITRE Corporation, and by NSF and DARPA under NSF grants CCR-9002253 and CCR-9014603. 相似文献
2.
《中国橡胶》2014,(20):11-11
Recently, European SHINE R & D group, focusing on the research and development of synthetic rubber self-recovery technology, made a technological breakthrough. Up to now, SHINE R & D group has achieved the development and production of the new elastomer material in laboratory, has verified all self-recovery features and is preparing for the demonstration project of the pilot scale experiment. 相似文献
3.
4.
本文介绍了以滤光片标准物质作为标准器对紫外可见分光光度计按照JJG 178-2007《紫外、可见、近红外分光光度计检定规程》进行检定的方法及相关说明. 相似文献
5.
设计验证码的主要目的是区分人类和计算机,用来防止网络机器人的一些恶意行为。验证码的出现也催生了一批新工种,电子商务的发展迫切需要一种推广方式来推销他们的商品,残障人士上网问题也需要迫切关注,因此许多人开始研究网络机器人技术,用来实现邮箱自动注册、群发信息、自动灌水、自动登录等功能。目前,各种类型网站系统都利用验证码阻止网络机器人入侵,从而验证码识别技术成为研究热点。基于SVM技术对图像验证码进行识别,取得了良好的效果。 相似文献
6.
7.
Zhibin YANG Jean-Paul BODEVEIX Mamoun FILALI Kai HU Yongwang ZHAO Dianfu MA 《Frontiers of Computer Science》2016,10(1):37-53
SIGNAL belongs to the synchronous languages family which are widely used in the design of safety-critical real-time systems such as avionics, space systems, and nuclear power plants. This paper reports a compiler prototype for SIGNAL. Compared with the existing SIGNAL compiler, we propose a new intermediate representation (named S-CGA, a variant of clocked guarded actions), to integrate more synchronous programs into our compiler prototype in the future. The front-end of the compiler, i.e., the translation from SIGNAL to S-CGA, is presented. As well, the proof of semantics preservation is mechanized in the theorem prover Coq. Moreover, we present the back-end of the compiler, including sequential code generation and multithreaded code generation with time-predictable properties. With the rising importance of multi-core processors in safetycritical embedded systems or cyber-physical systems (CPS), there is a growing need for model-driven generation of multithreaded code and thus mapping on multi-core. We propose a time-predictable multi-core architecture model in architecture analysis and design language (AADL), and map the multi-threaded code to this model. 相似文献
8.
9.
The VLISP project has produced a rigorously verified compiler from Scheme to byte codes, and a verified interpreter for the resulting byte codes. The official denotational semantics for Scheme provides the main criterion of correctness. The Wand-Clinger technique was used to prove correctness of the primary compiler step. Then a state machine operational semantics is proved to be faithful to the denotational semantics. The remainder of the implementation is verified by a succession of state machine refinement proofs. These include proofs that garbage collection is a sound implementation strategy, and that a particular garbage collection algorithm is correct.The work reported here was carried out as part of The MITRE Corporation's Technology Program, under funding from Rome Laboratory, Electronic Systems Command, United States Air Force, through contract F19628-89-C-0001. Preparation of this paper was generously supported by The MITRE Corporation. 相似文献
10.