標(biāo)題: Titlebook: Certified Programs and Proofs; Second International Chris Hawblitzel,Dale Miller Conference proceedings 2012 Springer-Verlag Berlin Heidelb [打印本頁] 作者: CT951 時間: 2025-3-21 17:47
書目名稱Certified Programs and Proofs影響因子(影響力)
書目名稱Certified Programs and Proofs影響因子(影響力)學(xué)科排名
書目名稱Certified Programs and Proofs網(wǎng)絡(luò)公開度
書目名稱Certified Programs and Proofs網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Certified Programs and Proofs被引頻次
書目名稱Certified Programs and Proofs被引頻次學(xué)科排名
書目名稱Certified Programs and Proofs年度引用
書目名稱Certified Programs and Proofs年度引用學(xué)科排名
書目名稱Certified Programs and Proofs讀者反饋
書目名稱Certified Programs and Proofs讀者反饋學(xué)科排名
作者: Aspirin 時間: 2025-3-22 00:19 作者: 誘導(dǎo) 時間: 2025-3-22 03:18
https://doi.org/10.1007/978-3-642-35308-6completeness; formal verification; mechanized proofs; real-time systems; verified software作者: Fibrinogen 時間: 2025-3-22 06:17 作者: Amplify 時間: 2025-3-22 09:03
Mechanized Semantics for Compiler Verification,ource, intermediate and target languages. In this invited talk, I review various forms of operational semantics and their mechanization, based on my experience with the formal verification of the CompCert?C compiler.作者: DRAFT 時間: 2025-3-22 15:31
An Executable Semantics for CompCert C,m is defined in terms of a semantics for the ‘CompCert C’ language, but how can we gain faith in those semantics? We explore one approach: building an equivalent executable semantics that we can check test suites of code against.作者: DRAFT 時間: 2025-3-22 19:48 作者: 混合物 時間: 2025-3-22 21:55 作者: placebo-effect 時間: 2025-3-23 01:51 作者: 懶惰民族 時間: 2025-3-23 08:59
On the Topology of Three-Dimensional Space,ource, intermediate and target languages. In this invited talk, I review various forms of operational semantics and their mechanization, based on my experience with the formal verification of the CompCert?C compiler.作者: FOIL 時間: 2025-3-23 13:21 作者: exigent 時間: 2025-3-23 16:18 作者: 夾死提手勢 時間: 2025-3-23 20:58 作者: Pericarditis 時間: 2025-3-24 01:00 作者: Misgiving 時間: 2025-3-24 02:46
https://doi.org/10.1007/978-1-4612-4668-8ch [9,6,8] to provable security [7], but revisit its realization from a formal verification pespective. More specifically, . and . use a probabilistic programming language pWHILE for expressing cryptographic constructions, security properties, and computational assumptions, and a probabilistic relat作者: Popcorn 時間: 2025-3-24 09:06 作者: Basal-Ganglia 時間: 2025-3-24 14:43 作者: 出處 時間: 2025-3-24 17:47 作者: 背書 時間: 2025-3-24 21:18 作者: 蘑菇 時間: 2025-3-25 02:19
Papers on Group Theory and Topologym is defined in terms of a semantics for the ‘CompCert C’ language, but how can we gain faith in those semantics? We explore one approach: building an equivalent executable semantics that we can check test suites of code against.作者: cochlea 時間: 2025-3-25 05:35 作者: 恃強(qiáng)凌弱 時間: 2025-3-25 10:34
Papers on Group Theory and Topologyrategies. The previous Quickcheck only tested conjectures by random testing. The new Quickcheck extends the previous one and integrates two novel testing strategies: exhaustive testing with concrete values; and symbolic testing, evaluating conjectures with a narrowing strategy. Orthogonally to the s作者: 賞錢 時間: 2025-3-25 14:11
Nucleins?uren und ihre BausteineWe develop a uniform framework where we express a wide range of noninterference variants from the literature and compare them w.r.t.?their .: the strength of the security properties they ensure weighed against the harshness of the syntactic conditions they enforce. This results in a simple implement作者: Diuretic 時間: 2025-3-25 19:48
Theorie der Papierchromatographiel-purpose kernel enforces this property is yet to be achieved. In this paper we take a significant step towards this vision by presenting a machine-checked formulation of intransitive noninterference for OS kernels, and its associated sound and complete unwinding conditions, as well as a scalable pr作者: 懦夫 時間: 2025-3-25 20:26
Theorie der Papierchromatographiein size, it involves complicated and interdependent invariants that make monolithic verification of the VMM and the kernel running on top of it difficult. In this paper, we make the observation that a VMM is constructed in layers: physical page allocation, page table drivers, address space API, etc.作者: meditation 時間: 2025-3-26 01:04
https://doi.org/10.1007/978-3-642-87770-4a condition for the pattern to be valid. In this paper, the theory is formalized in terms of ., reflecting the fact that the validity of toss juggling is related to a property of infinite phenomena. A tactic is implemented for proving the validity of toss patterns in Coq. Additionally, the completen作者: 幻影 時間: 2025-3-26 05:22 作者: 歡樂中國 時間: 2025-3-26 10:49 作者: Climate 時間: 2025-3-26 14:41 作者: MIR 時間: 2025-3-26 20:29
Thomas Krainer,Bert-Wolfgang Schulzeert system. In this paper we develop a constructive completeness proof for the axiomatization using Coq with Ssreflect. The proof is based on a novel analytic Gentzen system, which yields a certifying decision procedure that for a formula constructs either a derivation or a finite countermodel. Comp作者: 機(jī)械 時間: 2025-3-26 23:36 作者: AMEND 時間: 2025-3-27 03:15 作者: Infant 時間: 2025-3-27 07:26
Papers on Group Theory and Topologyint of certificates. In particular, I plan to discuss the following questions: (i) How can we certify the result of program verification based on higher-order model checking? (ii) Why does higher-order model checking work at all, despite its extremely high worst-case complexity?作者: heartburn 時間: 2025-3-27 09:29
Theorie der Papierchromatographiecation, we develop a framework that assists in creation of verification systems for each layer and refinements between the layers. Using this framework, we have produced a certification of BabyVMM, a small VMM designed for simplified hardware. The same proof also shows that a certified kernel using 作者: 乞討 時間: 2025-3-27 16:32
Automation in Computer-Aided Cryptography: Proofs, Attacks and Designs,public-key encryption schemes, modes of operation, signature schemes, hash function designs, zero-knowledge proofs. Recently, we have also used both tools to certify the output of a zero-knowledge compiler [1].作者: 特別容易碎 時間: 2025-3-27 20:15 作者: 凹室 時間: 2025-3-27 23:43 作者: 包租車船 時間: 2025-3-28 02:09 作者: 四牛在彎曲 時間: 2025-3-28 07:33 作者: Gene408 時間: 2025-3-28 12:02 作者: 形容詞詞尾 時間: 2025-3-28 18:15
Rating Disambiguation Errors,rors from the most meaningful to the least, showing that it can be implemented in a natural way in the existing disambiguation algorithm. We also describe a neat interface to present disambiguation errors to the user, suitable for the use in interactive theorem proving applications.作者: 金絲雀 時間: 2025-3-28 19:52
0302-9743 e carefully reviewed and selected from 37 submissions. They deal with those topics in computer science and mathematics in which certification via formal techniques is crucial.978-3-642-35307-9978-3-642-35308-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: antidote 時間: 2025-3-29 00:42 作者: REIGN 時間: 2025-3-29 05:14
Papers on Group Theory and Topologyesents applications of dominance analysis: an SSA-form type checker, verifying SSA-based optimizations, and constructing dominator trees. This development is a part of the Vellvm project. All proofs and implementation have been carried out in Coq.作者: 排名真古怪 時間: 2025-3-29 08:27 作者: Motilin 時間: 2025-3-29 14:51 作者: 內(nèi)疚 時間: 2025-3-29 17:38
Conference proceedings 2012, in December 2012.The 18 revised regular papers presented were carefully reviewed and selected from 37 submissions. They deal with those topics in computer science and mathematics in which certification via formal techniques is crucial.作者: 多嘴多舌 時間: 2025-3-29 20:04 作者: 有權(quán) 時間: 2025-3-30 00:35
On the Topology of Three-Dimensional Space,specifications a way to extract functions from them and automatically produce the proof of soundness of the extracted function w.r.t. its inductive specification. In addition, using user-defined modes which label inputs and outputs, we are able to extract several computational contents from a single inductive type.作者: happiness 時間: 2025-3-30 05:17
Papers on Group Theory and Topologyo deal with conditional conjectures, i.e., conjectures with premises. We evaluate the testing strategies and techniques on a number of specifications, functional data structures and a hotel key card system.作者: 腐敗 時間: 2025-3-30 11:41 作者: 壓迫 時間: 2025-3-30 15:37 作者: 常到 時間: 2025-3-30 18:44
The New Quickcheck for Isabelle,o deal with conditional conjectures, i.e., conjectures with premises. We evaluate the testing strategies and techniques on a number of specifications, functional data structures and a hotel key card system.作者: Electrolysis 時間: 2025-3-30 21:36 作者: 蜈蚣 時間: 2025-3-31 01:08
Mechanized Verification of Computing Dominators for Formalizing Compilers,esents applications of dominance analysis: an SSA-form type checker, verifying SSA-based optimizations, and constructing dominator trees. This development is a part of the Vellvm project. All proofs and implementation have been carried out in Coq.作者: PAD416 時間: 2025-3-31 08:46
Proving Concurrent Noninterference,able algorithm for proving that a program has a specific noninterference property, using only compositionality, which captures uniformly several security type-system results from the literature and suggests a further improved type system. All formalism and theorems have been mechanically verified in Isabelle/HOL.作者: gustation 時間: 2025-3-31 12:53
Noninterference for Operating System Kernels,oof calculus over nondeterministic state monads for discharging these unwinding conditions across a kernel’s implementation. Our ongoing experience applying this noninterference framework and proof calculus to the seL4 microkernel validates their utility and real-world applicability.作者: 碎石 時間: 2025-3-31 16:40 作者: Chronological 時間: 2025-3-31 17:50 作者: infarct 時間: 2025-4-1 00:57
https://doi.org/10.1007/978-3-642-87770-4 is related to a property of infinite phenomena. A tactic is implemented for proving the validity of toss patterns in Coq. Additionally, the completeness and soundness of a well-known algorithm for checking the validity is demonstrated. The result exposes a practical aspect of coinductive proofs.作者: Isometric 時間: 2025-4-1 05:26
Anorganische Kationen und Anionenrk in Abella, a recent proof assistant based on higher-order abstract syntax and provided with a nominal quantifier. By revisiting Huet’s approach and exploiting the features of Abella, we get a strikingly compact and natural development, which makes Huet’s idea really shine.作者: Canvas 時間: 2025-4-1 07:49
Thomas Krainer,Bert-Wolfgang Schulzeanalytic Gentzen system, which yields a certifying decision procedure that for a formula constructs either a derivation or a finite countermodel. Completeness of the axiomatization then follows by translating Gentzen derivations to Hilbert derivations. The main difficulty throughout the development is the treatment of transitive closure.作者: 遺傳學(xué) 時間: 2025-4-1 14:13
A Formally-Verified Alias Analysis,yped. Its soundness proof follows the general style of abstract interpretation. The analysis is designed to fit in the CompCert C verified compiler, supporting future aggressive optimizations over memory accesses.作者: 禁止 時間: 2025-4-1 17:04
