標(biāo)題: Titlebook: Certified Programs and Proofs; First International Jean-Pierre Jouannaud,Zhong Shao Conference proceedings 2011 Springer-Verlag GmbH Berli [打印本頁] 作者: 乳缽 時間: 2025-3-21 19:26
書目名稱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é)科排名
作者: biosphere 時間: 2025-3-21 22:42
Schleiermacherean Panentheism and Ecologys and theories will never be native to any solver. We here explore different theories that extend Microsoft Research’s SMT solver Z3’s basic support. Some can be directly encoded or axiomatized, others make use of user theory plug-ins. Plug-ins are a powerful way for tools to supply their custom domains.作者: 鉆孔 時間: 2025-3-22 01:40 作者: atrophy 時間: 2025-3-22 07:55 作者: OPINE 時間: 2025-3-22 10:53
Engineering Theories with Z3s and theories will never be native to any solver. We here explore different theories that extend Microsoft Research’s SMT solver Z3’s basic support. Some can be directly encoded or axiomatized, others make use of user theory plug-ins. Plug-ins are a powerful way for tools to supply their custom domains.作者: Influx 時間: 2025-3-22 14:24
Algebra, Logic, Locality, Concurrencyore axioms. Rules of program logic, related to Hoare and Separation logics, flow at once from the algebraic axioms. So, one gets a generic program logic from the algebra, which holds for a range of concrete models.作者: Influx 時間: 2025-3-22 19:47
A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses solver .. Experiments highlight the efficiency of this checker. On top of it, new reflexive . tactics have been built that can decide a subset of .’s logic by calling external provers and carefully checking their answers.作者: 傲慢物 時間: 2025-3-22 23:03 作者: 淡紫色花 時間: 2025-3-23 03:52 作者: 進(jìn)入 時間: 2025-3-23 05:58
Applications of paper chemistry, does not require axioms. Our main results are an algorithmic proof of a small model theorem and the computational decidability of satisfiability, validity, and equivalence of formulas. We present our work in three steps: propositional logic, modal logic, and finally hybrid logic.作者: ARCHE 時間: 2025-3-23 10:42 作者: Efflorescent 時間: 2025-3-23 16:48
https://doi.org/10.1007/978-3-642-99749-5dle associative only operations, neutral elements, uninterpreted function symbols, and user-defined equivalence relations. By relying on type-classes for the reification phase, we can infer these properties automatically, so that end-users do not need to specify which operation is A or AC, or which constant is a neutral element.作者: omnibus 時間: 2025-3-23 18:44
On Infinite Discontinuous Groups,d-size bit-vectors, although difficult because Z3’s proofs provide limited detail, is often possible. We thereby obtain high correctness assurances for Z3’s results, and increase the degree of proof automation for bit-vector problems in HOL4 and Isabelle/HOL.作者: 影響深遠(yuǎn) 時間: 2025-3-24 01:43
Papers on Group Theory and Topologyrn is proved correct in Coq w.r.t. Leroy’s operational semantics for C minor. Thus when our VeriSmall static analyzer claims some shape property of a program, an end-to-end machine-checked proof guarantees that the assembly language of the compiled program will actually have that property.作者: 惰性氣體 時間: 2025-3-24 05:22 作者: 迅速成長 時間: 2025-3-24 09:21 作者: 輕快來事 時間: 2025-3-24 12:02 作者: defenses 時間: 2025-3-24 16:26
Reconstruction of Z3’s Bit-Vector Proofs in HOL4 and Isabelle/HOLd-size bit-vectors, although difficult because Z3’s proofs provide limited detail, is often possible. We thereby obtain high correctness assurances for Z3’s results, and increase the degree of proof automation for bit-vector problems in HOL4 and Isabelle/HOL.作者: enchant 時間: 2025-3-24 20:16 作者: 動作謎 時間: 2025-3-24 23:49
Electrokinetics of the papermaking industry,the certification process and show that the certification time is reasonable even for industrial-size applications. As a case study, we automatically prove and certify more than 40% of the lemmas needed for the validation of a conformance algorithm for the ABR protocol.作者: 維持 時間: 2025-3-25 03:20
Applications of paper chemistry, in a growing library of mathematics for proof assistant Coq. On the other hand the computational issues raised by the univalent semantics may lead in the future to a new class of programming languages.作者: 橫條 時間: 2025-3-25 10:18
Practical applications of paper chemistry,ed part of reasoning with Nominal Isabelle, and together with analysing freshness is the part that differs most from paper proofs. In this paper we show how to define terms from .-calculus and reason about them without having to carry around the freshness conditions. As a case study we formalize the second fixed point theorem of the .-calculus.作者: 燈絲 時間: 2025-3-25 14:41 作者: Defraud 時間: 2025-3-25 16:02
Automated Certification of Implicit Induction Proofsthe certification process and show that the certification time is reasonable even for industrial-size applications. As a case study, we automatically prove and certify more than 40% of the lemmas needed for the validation of a conformance algorithm for the ABR protocol.作者: 大漩渦 時間: 2025-3-25 23:32 作者: 發(fā)微光 時間: 2025-3-26 01:23
Reasoning about Constants in Nominal Isabelle or How to Formalize the Second Fixed Point Theoremed part of reasoning with Nominal Isabelle, and together with analysing freshness is the part that differs most from paper proofs. In this paper we show how to define terms from .-calculus and reason about them without having to carry around the freshness conditions. As a case study we formalize the second fixed point theorem of the .-calculus.作者: 啞劇 時間: 2025-3-26 05:16
The Teaching Tool , A Proof-Checker for Gries and Schneider’s “Logical Approach to Discrete Math”rticular compromise between full formality and customary, more informal, mathematical practises, and thus teaches aspects of both. This is one source of several unusual requirements for a mechanised proof-checker; other interesting aspects arise from details of their notational conventions.作者: 較早 時間: 2025-3-26 09:20
Practical applications of paper chemistry,zed using the HOL4 theorem prover. Memoized parsers based on our approach are polynomial-time in the size of the input. Preliminary real-world performance testing on highly ambiguous grammars indicates our parsers are faster than those generated by the popular Happy parser generator.作者: Alpha-Cells 時間: 2025-3-26 14:04 作者: 結(jié)束 時間: 2025-3-26 18:16
A Proposal for Broad Spectrum Proof Certificatessent the structure of proof evidence captured by a particular class of computational logic systems. While such proof certificates can capture a wide variety of proof structures, a proof checker can remain simple since it must only understand the micro-rules and the discipline of focusing. Since proo作者: Hyperlipidemia 時間: 2025-3-26 21:42
Modular SMT Proofs for Fast Reflexive Checking Inside Coqe relatively small and their proof is obtained with a modest overhead by our proof-producing prover. We present experiments assessing the feasibility of the approach for benchmarks obtained from the SMT competition.作者: 使混合 時間: 2025-3-27 04:40
https://doi.org/10.1007/978-94-011-0605-4sent the structure of proof evidence captured by a particular class of computational logic systems. While such proof certificates can capture a wide variety of proof structures, a proof checker can remain simple since it must only understand the micro-rules and the discipline of focusing. Since proo作者: HERTZ 時間: 2025-3-27 05:19 作者: Forehead-Lift 時間: 2025-3-27 10:59 作者: CURL 時間: 2025-3-27 17:19 作者: 故意 時間: 2025-3-27 19:04 作者: 慷慨不好 時間: 2025-3-27 22:07
Proof-Carrying Code in a Session-Typed Process Calculusw how to exploit dependent session types to express proof-carrying communication. We further introduce two modal operators into the type theory to provide detailed control about how much information is communicated: one based on traditional proof irrelevance and one integrating digital signatures.作者: 使迷醉 時間: 2025-3-28 04:52
Automated Certification of Implicit Induction Proofs certify properties about conditional specifications that are proved using automated proof techniques like those employed by the Spike prover, a rewrite-based implicit induction proof system. The certification methodology is based on a new representation of the implicit induction proofs for which th作者: agglomerate 時間: 2025-3-28 06:29
A Proposal for Broad Spectrum Proof Certificates the construction of “macro” level inference rules based on the “micro” inference rules which introduce single logical connectives. After presenting focused proof systems for first-order classical logics (one with and one without fixed points and equality) we illustrate several examples of proof cer作者: Evacuate 時間: 2025-3-28 13:34 作者: DEAF 時間: 2025-3-28 18:37 作者: consent 時間: 2025-3-28 20:39 作者: 睨視 時間: 2025-3-29 01:02
A Decision Procedure for Regular Expression Equivalence in Type Theorygnize the same language. Our approach to this problem is inspired by Brzozowski’s algorithm using derivatives of regular expressions, with a new definition of finite sets. In this paper, we detail a complete formalization of Brzozowki’s derivatives, a new definition of finite sets along with its bas作者: Culpable 時間: 2025-3-29 06:04
A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesseso answer, but also a proof witness that can be independently rechecked. We present such a checker, written and fully certified in .. It is conceived in a modular way, in order to tame the proofs’ complexity and to be extendable. It can currently check witnesses from the SAT solver . and from the SMT作者: 哎呦 時間: 2025-3-29 10:05
Modular SMT Proofs for Fast Reflexive Checking Inside Coqapabilities like Coq. We advocate modular SMT proofs that separate boolean reasoning and theory reasoning; and structure the communication between theories using Nelson-Oppen combination scheme. We present the design and implementation of a Coq reflexive verifier that is modular and allows for fine-作者: 武器 時間: 2025-3-29 12:32
Tactics for Reasoning Modulo AC in Coqding blocks: first, an extensible reflexive decision procedure for equality modulo AC; second, an OCaml plug-in for pattern matching modulo AC. We handle associative only operations, neutral elements, uninterpreted function symbols, and user-defined equivalence relations. By relying on type-classes 作者: 革新 時間: 2025-3-29 17:11
Reconstruction of Z3’s Bit-Vector Proofs in HOL4 and Isabelle/HOLproofs for bit-vector theories in the theorem provers HOL4 and Isabelle/HOL. Our work shows that LCF-style proof reconstruction for the theory of fixed-size bit-vectors, although difficult because Z3’s proofs provide limited detail, is often possible. We thereby obtain high correctness assurances fo作者: Trabeculoplasty 時間: 2025-3-29 21:18
Teaching Experience: Logic and Formal Methods with Coqur goals for adding mechanized provers to the course, and illustrate how we have integrated the provers into our syllabus to meet those goals. We also document some of the teaching materials we have developed for the course to date, and what our experiences have been like.作者: 凌辱 時間: 2025-3-30 03:25
The Teaching Tool , A Proof-Checker for Gries and Schneider’s “Logical Approach to Discrete Math” good?”.We now report on the development of a proof-checker designed to answer exactly that question, while intentionally not helping to find the solutions in the first place. . provides detailed feedback to . -formatted calculational proofs, and thus helps students to develop confidence in their ow作者: Maximizer 時間: 2025-3-30 07:57 作者: 治愈 時間: 2025-3-30 09:28
Verification of ,ucial. We present a framework for verification of CAS-based lock-free algorithms, and prove a nontrivial lock-free algorithm . that is practically adopted in Java 6. The strength of our approach lies on that it relieves the dependence on auxiliary variables/commands, thus is relatively easier to con作者: Hormones 時間: 2025-3-30 12:53 作者: GEST 時間: 2025-3-30 20:20 作者: palliative-care 時間: 2025-3-30 21:52
https://doi.org/10.1007/978-94-011-0605-4We present in this paper the integration within the Coq proof assistant, of a method for automatic theorem proving in geometry. We use an approach based on the validation of a certificate. The certificate is generated by an implementation in Ocaml? of a simple version of Wu’s method.作者: characteristic 時間: 2025-3-31 04:39
Formalization of Wu’s Simple Method in CoqWe present in this paper the integration within the Coq proof assistant, of a method for automatic theorem proving in geometry. We use an approach based on the validation of a certificate. The certificate is generated by an implementation in Ocaml? of a simple version of Wu’s method.作者: 賠償 時間: 2025-3-31 05:29 作者: Obliterate 時間: 2025-3-31 12:26
Electrokinetics of the papermaking industry,w how to exploit dependent session types to express proof-carrying communication. We further introduce two modal operators into the type theory to provide detailed control about how much information is communicated: one based on traditional proof irrelevance and one integrating digital signatures.作者: Nucleate 時間: 2025-3-31 15:25 作者: 種子 時間: 2025-3-31 18:43
On Infinite Discontinuous Groups,ucial. We present a framework for verification of CAS-based lock-free algorithms, and prove a nontrivial lock-free algorithm . that is practically adopted in Java 6. The strength of our approach lies on that it relieves the dependence on auxiliary variables/commands, thus is relatively easier to conduct and comprehend, comparing to existing works.作者: Chivalrous 時間: 2025-4-1 01:15 作者: synovium 時間: 2025-4-1 04:02
Applications of paper chemistry,s and logics for concurrent processes [10,6,5]. The approach we are taking abstracts from syntax or particular models. Message passing and shared memory process interaction, and strong (interleaving) and weak (partial order) approaches to sequencing, are accomodated as different models of the same c作者: 僵硬 時間: 2025-4-1 06:38
Applications of paper chemistry,present formulas and models and define satisfiability, validity, and equivalence of formulas. The representation yields the classical equivalences and does not require axioms. Our main results are an algorithmic proof of a small model theorem and the computational decidability of satisfiability, val作者: 陶瓷 時間: 2025-4-1 13:39
Electrokinetics of the papermaking industry,w how to exploit dependent session types to express proof-carrying communication. We further introduce two modal operators into the type theory to provide detailed control about how much information is communicated: one based on traditional proof irrelevance and one integrating digital signatures.作者: Antioxidant 時間: 2025-4-1 15:08
Electrokinetics of the papermaking industry, certify properties about conditional specifications that are proved using automated proof techniques like those employed by the Spike prover, a rewrite-based implicit induction proof system. The certification methodology is based on a new representation of the implicit induction proofs for which th作者: constitute 時間: 2025-4-1 20:59
https://doi.org/10.1007/978-94-011-0605-4 the construction of “macro” level inference rules based on the “micro” inference rules which introduce single logical connectives. After presenting focused proof systems for first-order classical logics (one with and one without fixed points and equality) we illustrate several examples of proof cer作者: 構(gòu)想 時間: 2025-4-2 00:43
Applications of paper chemistry,hich interpret types as simplicial sets or topological spaces defined up to homotopy equivalence. The intuition based on the univalent semantics leads to new answers to some long standing questions of type theory providing in particular well-behaved type theoretic definitions of sets and set quotien作者: 充滿人 時間: 2025-4-2 05:37
Practical applications of paper chemistry,tional extension of the HOL object logic of the Isabelle theorem prover. Nominal Isabelle supports the definition of term languages of calculi with bindings, functions on the terms of these calculi and provides mechanisms that automatically rename binders. Functions defined in Nominal Isabelle can b
