標(biāo)題: Titlebook: Certified Programs and Proofs; Third International Georges Gonthier,Michael Norrish Conference proceedings 2013 Springer International Pub [打印本頁(yè)] 作者: HBA1C 時(shí)間: 2025-3-21 18:39
書目名稱Certified Programs and Proofs影響因子(影響力)
書目名稱Certified Programs and Proofs影響因子(影響力)學(xué)科排名
書目名稱Certified Programs and Proofs網(wǎng)絡(luò)公開(kāi)度
書目名稱Certified Programs and Proofs網(wǎng)絡(luò)公開(kāi)度學(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é)科排名
作者: 有助于 時(shí)間: 2025-3-21 20:58
Mostly Sound Type System Improves a Foundational Program VerifiermpCert verified optimizing C compiler. The C language is known to not be type-safe but we show the value of a provably . type system: integrating the typechecker with the program logic makes the logic significantly more usable. The computational nature of our typechecker (within Coq) makes program p作者: 不利 時(shí)間: 2025-3-22 02:54 作者: Negotiate 時(shí)間: 2025-3-22 07:11 作者: 不確定 時(shí)間: 2025-3-22 12:08 作者: Cardiac 時(shí)間: 2025-3-22 13:17 作者: Cardiac 時(shí)間: 2025-3-22 18:30 作者: GROG 時(shí)間: 2025-3-22 23:24
Nonfree Datatypes in Isabelle/HOLssive datatypes on axiomatic means: nonfree datatypes generated from constructors modulo equations. We have implemented an Isabelle/HOL package for nonfree datatypes, without compromising foundations. The use of the package, and its nonfree iterator in particular, is illustrated with examples: bags,作者: Chronic 時(shí)間: 2025-3-23 04:28
Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOLlibrary of operations and theorems about an abstract type, but they want to write definitions and proofs in terms of a more concrete representation type, or “raw” type. Earlier work on the Isabelle Quotient package has yielded great progress in automation, but it still has many technical limitations作者: PANT 時(shí)間: 2025-3-23 09:09
Refinements for Free!fficient. One way to reconcile both consists in adopting a high-level view when proving correctness and then refining stepwise down to an efficient low-level implementation. Some refinement steps are interesting, in the sense that they improve the algorithms involved, while others only express a swi作者: 不遵守 時(shí)間: 2025-3-23 12:38
A Formal Proof of Borodin-Trakhtenbrot’s Gap Theoremeen complexity classes. The proof is done at an abstract, machine independent level, and is particularly aimed to identify the minimal set of assumptions required to prove the result (smaller than expected, actually). The work is part of a long term . program, whose goal is to obtain, via a reverse 作者: neuron 時(shí)間: 2025-3-23 17:13
Extracting Proofs from Tabled Proof Searchroach to model checking with such specifications often involves state exploration. We consider four different tabling strategies that can minimize such exploration significantly. In general, tabling involves storing previously proved subgoals and reusing (instead of reproving) them in proof search. 作者: 嚴(yán)厲譴責(zé) 時(shí)間: 2025-3-23 18:18
Formalizing the SAFECode Type Systemes out a wide range of common vulnerabilities. SVA uses an enhanced version of the Low-Level Virtual Machine (LLVM) compiler called SAFECode to enforce the policy through a combination of static and dynamic type-checks. However, this results in a relatively large trusted computing base (TCB). SVA re作者: 愚蠢人 時(shí)間: 2025-3-24 01:39
Certifiably Sound Parallelizing Transformationstial programs. At the same time, formal methods researchers have pushed compiler verification technology forward to the point that real compilers may be checked for correctness by proving that the compiler preserves a simulation relation between the source and target languages. We join these two lin作者: 新娘 時(shí)間: 2025-3-24 03:38 作者: Diverticulitis 時(shí)間: 2025-3-24 06:51 作者: CRUMB 時(shí)間: 2025-3-24 14:28 作者: corn732 時(shí)間: 2025-3-24 16:31
A Formal Model and Correctness Proof for an Access Control Policy Frameworkn this paper the Role-Compatibility Model—a framework, introduced by Ott, in which access control policies can be expressed. We also give a dynamic model determining which security related events can happen while a system is running. We prove that if a policy in this framework ensures a resource is 作者: concise 時(shí)間: 2025-3-24 22:35 作者: hangdog 時(shí)間: 2025-3-25 00:42
Certifiably Sound Parallelizing Transformationsth respect to a new simulation relation, called ., that resolves this issue and is equivalent to weak bisimulation when no internal nondeterminism is present. All formal details presented are proven and mechanically checked using the Coq Proof Assistant.作者: Madrigal 時(shí)間: 2025-3-25 06:21
A Formal Model and Correctness Proof for an Access Control Policy Frameworkproof are mechanised in the Isabelle/HOL theorem prover using Paulson’s inductive method for reasoning about valid sequences of events. Our results apply to the Role-Compatibility Model, but can be readily adapted to other role-based access control models.作者: 包租車船 時(shí)間: 2025-3-25 10:24
Medizin, eingebettet in die Wissenschaften,s contain unproved entries. We design a proof system with tables and show that by managing tabled entries carefully, one would still be able to obtain a sound proof system. That is, we show how one can extract a post-fixed point from a tabled proof for a co-inductive goal. We then apply this idea to作者: 瑣碎 時(shí)間: 2025-3-25 15:15
Paradigma der Medizin im 21. Jahrhundertth respect to a new simulation relation, called ., that resolves this issue and is equivalent to weak bisimulation when no internal nondeterminism is present. All formal details presented are proven and mechanically checked using the Coq Proof Assistant.作者: stress-response 時(shí)間: 2025-3-25 18:40
Paradigma der Medizin im 21. Jahrhundertproof are mechanised in the Isabelle/HOL theorem prover using Paulson’s inductive method for reasoning about valid sequences of events. Our results apply to the Role-Compatibility Model, but can be readily adapted to other role-based access control models.作者: thalamus 時(shí)間: 2025-3-25 23:57
Evolution of Basic Education in China,t al., 1990] with new principles such as Voevodsky’s univalence axiom and higher-dimensional inductive types [Lumsdaine and Shulman, 2013]. These extensions are interesting both from a computer science perspective, where they imbue the equality apparatus of type theory with new computational meaning作者: Myofibrils 時(shí)間: 2025-3-26 01:03 作者: flaunt 時(shí)間: 2025-3-26 06:46
Paradigm Shift of Education Governance,ts programs written in NetCore, a new declarative network programming language. Our work builds on a recent effort by Guha, Reitblatt, and Foster to build a machine-verified compiler from NetCore to OpenFlow, a new protocol for software-defined networking.作者: 夸張 時(shí)間: 2025-3-26 09:23 作者: 無(wú)法破譯 時(shí)間: 2025-3-26 14:30 作者: sleep-spindles 時(shí)間: 2025-3-26 18:34 作者: MOTIF 時(shí)間: 2025-3-26 23:44 作者: 內(nèi)行 時(shí)間: 2025-3-27 01:11 作者: Commission 時(shí)間: 2025-3-27 07:45 作者: 滑動(dòng) 時(shí)間: 2025-3-27 13:17 作者: LUCY 時(shí)間: 2025-3-27 17:10 作者: 藥物 時(shí)間: 2025-3-27 18:03 作者: Rebate 時(shí)間: 2025-3-27 22:05
Paradigma der Medizin im 21. Jahrhundertes out a wide range of common vulnerabilities. SVA uses an enhanced version of the Low-Level Virtual Machine (LLVM) compiler called SAFECode to enforce the policy through a combination of static and dynamic type-checks. However, this results in a relatively large trusted computing base (TCB). SVA re作者: 中和 時(shí)間: 2025-3-28 02:19
Paradigma der Medizin im 21. Jahrhunderttial programs. At the same time, formal methods researchers have pushed compiler verification technology forward to the point that real compilers may be checked for correctness by proving that the compiler preserves a simulation relation between the source and target languages. We join these two lin作者: 可以任性 時(shí)間: 2025-3-28 07:59
,Ethik und ?sthetik in der Medizin,or languages containing binding constructs, and often leads to subtle, hard to find errors. In this paper, we exploit higherorder abstract syntax (HOAS) to implement a type-preserving compiler for the simply-typed lambda-calculus, including transformations such as closure conversion and hoisting, in作者: embolus 時(shí)間: 2025-3-28 13:11 作者: Interferons 時(shí)間: 2025-3-28 16:44 作者: 能得到 時(shí)間: 2025-3-28 22:47
Paradigma der Medizin im 21. Jahrhundertn this paper the Role-Compatibility Model—a framework, introduced by Ott, in which access control policies can be expressed. We also give a dynamic model determining which security related events can happen while a system is running. We prove that if a policy in this framework ensures a resource is 作者: FLEET 時(shí)間: 2025-3-29 01:33 作者: 宣誓書 時(shí)間: 2025-3-29 04:57 作者: Herbivorous 時(shí)間: 2025-3-29 08:53 作者: 集合 時(shí)間: 2025-3-29 12:59
Certified Kruskal’s Tree TheoremThis paper gives the first formalization of Kruskal’s tree theorem in a proof assistant. More concretely, an Isabelle/HOL development of Nash-Williams’ minimal bad sequence argument for proving the tree theorem is presented. Along the way, the proofs of Dickson’s lemma and Higman’s lemma are discussed.作者: 跑過(guò) 時(shí)間: 2025-3-29 16:56 作者: 能量守恒 時(shí)間: 2025-3-29 20:47
Paradigm Shift of Education Governance,ts programs written in NetCore, a new declarative network programming language. Our work builds on a recent effort by Guha, Reitblatt, and Foster to build a machine-verified compiler from NetCore to OpenFlow, a new protocol for software-defined networking.作者: brassy 時(shí)間: 2025-3-30 01:04
https://doi.org/10.1007/978-3-319-03545-1Coq; Isabelle/HOL; formal verification; mechanized proofs; regular languages作者: 憤慨點(diǎn)吧 時(shí)間: 2025-3-30 06:45 作者: 終端 時(shí)間: 2025-3-30 09:31
Computational Verification of Network Programs in Coqts programs written in NetCore, a new declarative network programming language. Our work builds on a recent effort by Guha, Reitblatt, and Foster to build a machine-verified compiler from NetCore to OpenFlow, a new protocol for software-defined networking.作者: BRIBE 時(shí)間: 2025-3-30 14:43 作者: Congruous 時(shí)間: 2025-3-30 20:18 作者: 盟軍 時(shí)間: 2025-3-30 21:43 作者: 祖?zhèn)髫?cái)產(chǎn) 時(shí)間: 2025-3-31 03:13 作者: STERN 時(shí)間: 2025-3-31 05:56
Reflecting on Theoretical Context, representations and show that equivalence of representations is decidable. We also establish the usual closure properties, give a minimization algorithm for DFAs, and prove that minimal DFAs are unique up to state renaming. Our development profits much from Ssreflect’s support for finite types and graphs.作者: 可觸知 時(shí)間: 2025-3-31 09:46 作者: 違抗 時(shí)間: 2025-3-31 15:32 作者: 過(guò)濾 時(shí)間: 2025-3-31 19:37 作者: cuticle 時(shí)間: 2025-3-31 23:15
, ,(, ,) in Homotopy Type Theorynsions are interesting both from a computer science perspective, where they imbue the equality apparatus of type theory with new computational meaning, and from a mathematical perspective, where they allow higher-dimensional mathematics to be expressed cleanly and elegantly in type theory.作者: defuse 時(shí)間: 2025-4-1 05:02 作者: Stable-Angina 時(shí)間: 2025-4-1 09:04 作者: Reservation 時(shí)間: 2025-4-1 11:49
Certified Parsing of Regular Languagess a regular expression if and only if the NFA accepts it. The proof of the if-part is effectively a function turning acceptance of a string into a parse tree while the only-if part gives a function turning rejection into a proof of impossibility of a parse tree.作者: BOLUS 時(shí)間: 2025-4-1 17:22
A Formal Proof of Borodin-Trakhtenbrot’s Gap Theoremons required to prove the result (smaller than expected, actually). The work is part of a long term . program, whose goal is to obtain, via a reverse methodological approach, a formal treatment of Complexity Theory at a comfortable level of abstraction and logical rigor.作者: Cocker 時(shí)間: 2025-4-1 20:26 作者: hyperuricemia 時(shí)間: 2025-4-2 01:57 作者: 拋物線 時(shí)間: 2025-4-2 04:35
Episode I: The 1986 Legislation, polynomials and .-terms modulo .-equivalence. The many-sorted metatheory of nonfree datatypes is formalized as an ordinary Isabelle theory and is animated by the package into user-specified instances. HOL lacks a type of types, so we employ an ad hoc construction of a universe embedding the relevant parameter types.作者: 放肆的你 時(shí)間: 2025-4-2 10:32
