Since the Clean Development Mechanism(CDM) under the Kyoto Protocol was initiated,China and India have overwhelmingly led other developing countries regarding CDM projects development.A comparative study of the CDM in...Since the Clean Development Mechanism(CDM) under the Kyoto Protocol was initiated,China and India have overwhelmingly led other developing countries regarding CDM projects development.A comparative study of the CDM in India and China is conducted as there are many similarities between both India and China with regard to the CDM implementation due to the fact that India is another major developing country with a large population and a potential source of GHG emissions rivaling China in the near future.Through examining the development of and legal issues for CDM projects in India,its experience and lessons regarding developing and managing CDM projects that China can critically learn are discussed.展开更多
Translation validation was invented in the 90＇s by Pnueli et al. as a technique to formally verify the correctness of code generators. Rather than certifying the code generator or exhaustively qualifying it, translat...Translation validation was invented in the 90＇s by Pnueli et al. as a technique to formally verify the correctness of code generators. Rather than certifying the code generator or exhaustively qualifying it, translation validators attempt to verify that program transformations preserve semantics. In this work, we adopt this approach to formally verify that the clock semantics and data dependence are preserved during the compilation of the Signal compiler. Translation valida- tion is implemented for every compilation phase from the initial phase until the latest phase where the executable code is generated, by proving the transformation in each phase of the compiler preserves the semantics. We represent the clock semantics, the data dependence of a program and its trans- formed counterpart as first-order formulas which are called clock models and synchronous dependence graphs （SDGs）, respectively. We then introduce clock refinement and depen- dence refinement relations which express the preservations of clock semantics and dependence, as a relation on clock mod- els and SDGs, respectively. Our validator does not require any instrumentation or modification of the compiler, nor any rewriting of the source program.展开更多
基金supported by the MOE (Ministry of Education in China) Project of Humanities and Social Sciences (Project No.11YJC820045)
文摘Since the Clean Development Mechanism(CDM) under the Kyoto Protocol was initiated,China and India have overwhelmingly led other developing countries regarding CDM projects development.A comparative study of the CDM in India and China is conducted as there are many similarities between both India and China with regard to the CDM implementation due to the fact that India is another major developing country with a large population and a potential source of GHG emissions rivaling China in the near future.Through examining the development of and legal issues for CDM projects in India,its experience and lessons regarding developing and managing CDM projects that China can critically learn are discussed.
文摘Translation validation was invented in the 90＇s by Pnueli et al. as a technique to formally verify the correctness of code generators. Rather than certifying the code generator or exhaustively qualifying it, translation validators attempt to verify that program transformations preserve semantics. In this work, we adopt this approach to formally verify that the clock semantics and data dependence are preserved during the compilation of the Signal compiler. Translation valida- tion is implemented for every compilation phase from the initial phase until the latest phase where the executable code is generated, by proving the transformation in each phase of the compiler preserves the semantics. We represent the clock semantics, the data dependence of a program and its trans- formed counterpart as first-order formulas which are called clock models and synchronous dependence graphs （SDGs）, respectively. We then introduce clock refinement and depen- dence refinement relations which express the preservations of clock semantics and dependence, as a relation on clock mod- els and SDGs, respectively. Our validator does not require any instrumentation or modification of the compiler, nor any rewriting of the source program.
