作者: fatty-streak 時(shí)間: 2025-3-21 21:29
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/i/image/470577.jpg作者: 策略 時(shí)間: 2025-3-22 03:43 作者: SLUMP 時(shí)間: 2025-3-22 06:39 作者: 鄙視讀作 時(shí)間: 2025-3-22 12:20
How to Get More Out of Your Oracles,advocating a separation of concerns between formalizing the underlying theory and optimizing the algorithm implemented in the checker, based on the observation that such optimizations can benefit significantly from adequately adapting the oracle.作者: 來(lái)自于 時(shí)間: 2025-3-22 15:55 作者: arcane 時(shí)間: 2025-3-22 19:33
https://doi.org/10.1007/978-3-319-66107-0Artificial intelligence; Automated reasoning; Computer software selection and evaluation; Formal method作者: exigent 時(shí)間: 2025-3-23 01:13
0302-9743 Proving, ITP 2017, held in Brasilia, Brazil, in September 2017...The 28 full papers, 2 rough diamond papers, and 3 invited talk papers presented were carefully reviewed and selected from 65 submissions. The topics range from theoretical foundations to implementation aspects and applications in progr作者: 大包裹 時(shí)間: 2025-3-23 03:41 作者: Munificent 時(shí)間: 2025-3-23 09:34 作者: esculent 時(shí)間: 2025-3-23 10:25 作者: Diatribe 時(shí)間: 2025-3-23 15:30 作者: Wordlist 時(shí)間: 2025-3-23 19:51
Formalization of the Lindemann-Weierstrass Theorem,ve forms of the fundamental theorem of symmetric polynomials. This formalization uses mainly the Mathcomp library for the part relying on algebra, and the Coquelicot library and the Coq standard library of real numbers for the calculus part.作者: cruise 時(shí)間: 2025-3-24 02:09
CompCertS: A Memory-Aware Verified C Compiler Using Pointer as Integer Semantics,s available..The whole proof of . is a significant proof-effort and we highlight the crux of the novel proofs of 12 passes of the back-end and a challenging proof of an essential optimising pass of the front-end.作者: Sciatica 時(shí)間: 2025-3-24 03:52
Formal Verification of a Floating-Point Expansion Renormalization Algorithm, operation. It is a critical step needed to ensure that the resulted expansion has the same property as the input one, and is more “compressed”. The formal proof uncovered several gaps in the pen-and-paper proof and gives the algorithm a very high level of guarantee.作者: 輕打 時(shí)間: 2025-3-24 06:31
FoCaLiZe and Dedukti to the Rescue for Proof Interoperability,, we rely on the structuring features offered by FoCaLiZe, in particular parameterized modules and inheritance to build a formal library of transfer theorems called MathTransfer. We finally illustrate this methodology on the Sieve of Eratosthenes, which we prove correct using HOL and Coq in combination.作者: condone 時(shí)間: 2025-3-24 13:00
Conference proceedings 2017, in September 2017...The 28 full papers, 2 rough diamond papers, and 3 invited talk papers presented were carefully reviewed and selected from 65 submissions. The topics range from theoretical foundations to implementation aspects and applications in program verification, security and formalization作者: cognizant 時(shí)間: 2025-3-24 17:47 作者: RAG 時(shí)間: 2025-3-24 22:33
Automating Formalization by Statistical and Semantic Parsing of Mathematics,We show that our learning method allows efficient use of large amount of contextual information, which in turn significantly boosts the precision of the statistical parsing and also makes it more efficient. This leads to a large improvement of our first results in parsing theorems from the Flyspeck corpus.作者: lacrimal-gland 時(shí)間: 2025-3-25 02:19 作者: Brocas-Area 時(shí)間: 2025-3-25 03:50
A Formal Proof of the Expressiveness of Deep Learning,e HOL type system. To support the formalization, we developed reusable libraries of formalized mathematics, including results about the matrix rank, the Borel measure, and multivariate polynomials as well as a library for tensor analysis.作者: 粗糙濫制 時(shí)間: 2025-3-25 10:44 作者: gentle 時(shí)間: 2025-3-25 15:30
Weak Call-by-Value Lambda Calculus as a Model of Computation in Coq, only if it is enumerable. Most of the results require a step-indexed self-interpreter. All results are verified formally and constructively, which is the challenge of the project. The verification techniques we use for procedures will apply to call-by-value functional programming languages formalised in Coq in general.作者: Exclaim 時(shí)間: 2025-3-25 19:22
Efficient, Verified Checking of Propositional Proofs,reasingly efficient, verified checkers using the ACL2 theorem proving system, and we discuss lessons from this effort. This work is already being used in industry and is slated for use in the next SAT competition.作者: 僵硬 時(shí)間: 2025-3-25 22:44 作者: condescend 時(shí)間: 2025-3-26 03:08 作者: 騎師 時(shí)間: 2025-3-26 08:07 作者: NOT 時(shí)間: 2025-3-26 08:36
Cezary Kaliszyk,Josef Urban,Ji?í Vysko?ilechnologien.Includes supplementary material: .Der effiziente Einsatz der Informationstechnik (IT) im Facility Management (FM) stellt eine gro?e Herausforderung für Unternehmen und ?ffentliche Einrichtungen dar. Das Handbuch zeigt erstmals alle Aspekte, die bei der erfolgreichen Einführung eines Comp作者: irreducible 時(shí)間: 2025-3-26 14:39 作者: fulmination 時(shí)間: 2025-3-26 17:12 作者: 我沒(méi)有命令 時(shí)間: 2025-3-26 22:02
Sophie Bernardrate technology into their everyday professional practice..As research yields results that show the solid and growing potential of technology for language education, Computer Assisted Language Learning has become a rather common subject in teacher training programmes worldwide. Based on the author’s作者: 撫育 時(shí)間: 2025-3-27 04:48
Frédéric Besson,Sandrine Blazy,Pierre Wilkerchers will need a handbook on this subject.The book is usefBook is a practical resource for teacher trainers who are about to deal with the challenging and exciting task of preparing language teachers to integrate technology into their everyday professional practice..As research yields results that作者: collateral 時(shí)間: 2025-3-27 07:16 作者: 異端 時(shí)間: 2025-3-27 11:11
David Butler,David Aspinall,Adrià Gascónrchers will need a handbook on this subject.The book is usefBook is a practical resource for teacher trainers who are about to deal with the challenging and exciting task of preparing language teachers to integrate technology into their everyday professional practice..As research yields results that作者: defray 時(shí)間: 2025-3-27 15:24
Rapha?l Cauderlier,Catherine Duboisrate technology into their everyday professional practice..As research yields results that show the solid and growing potential of technology for language education, Computer Assisted Language Learning has become a rather common subject in teacher training programmes worldwide. Based on the author’s作者: 漸變 時(shí)間: 2025-3-27 18:54
Cyril Cohen,Damien Rouhlingrchers will need a handbook on this subject.The book is usefBook is a practical resource for teacher trainers who are about to deal with the challenging and exciting task of preparing language teachers to integrate technology into their everyday professional practice..As research yields results that作者: 異端 時(shí)間: 2025-3-27 22:06 作者: laxative 時(shí)間: 2025-3-28 02:49 作者: malign 時(shí)間: 2025-3-28 06:19 作者: Cupidity 時(shí)間: 2025-3-28 13:17
Nathan Fulton,Stefan Mitsch,Rose Bohrer,André Platzered until now in order to allow the learner to master and put into practice grammar, basic vocabulary and frequent communicative rules. Within this area Computer- Assisted Language Learning (CALL) has become an indispensable partner, often leading the game. Beyond these borders, however, methodology 作者: Locale 時(shí)間: 2025-3-28 17:32 作者: 子女 時(shí)間: 2025-3-28 21:40
Lorenzo Gheri,Andrei Popescuing, and other IFIP members. Within the Technical Committee 5 of the International Federation of Information Processing (lFIP) the aim of this Working Group is the advancement of computers and their application to the field of discrete part manufacturing. Capabilities will be expanded in the general作者: garrulous 時(shí)間: 2025-3-29 02:02
Frédéric Gilbertther IFIP members. Within the Technical Committee 5 of the International Federation of Information Processing (lFIP) the aim of this Working Group is the advancement of computers and their application to the field of discrete part manufacturing. Capabilities will be expanded in the general areas of 作者: 不可接觸 時(shí)間: 2025-3-29 05:58 作者: 愛(ài)花花兒憤怒 時(shí)間: 2025-3-29 09:37
Zhé Hóu,David Sanán,Alwen Tiu,Yang Liuhaftlich eminent wichtige und sich rapide entwickelnde Gebiet der rechnerunterstützten Systeme in der Fertigung zeigte einen gro?en Bedarf für ein solches Handbuch. Durch dieses Buch soll einerseits dem Experten ein Leitfaden und Nachschlagewerk in die Hand gegeben und andererseits das Management be作者: heart-murmur 時(shí)間: 2025-3-29 12:37
Automated Theory Exploration for Interactive Theorem Proving:,er I will present the theory exploration system Hipster, which automatically discovers and proves lemmas about a given set of datatypes and functions in Isabelle/HOL. The development of Hipster was originally motivated by attempts to provide a higher level of automation for proofs by induction. Auto作者: muster 時(shí)間: 2025-3-29 17:22
Automating Formalization by Statistical and Semantic Parsing of Mathematics,of mathematical expressions. We introduce the overall motivation and ideas behind this project, and then propose a context-based parsing approach that combines efficient statistical learning of deep parse trees with their semantic pruning by type checking and large-theory automated theorem proving. 作者: 白楊 時(shí)間: 2025-3-29 22:47
A Formalization of Convex Polyhedra Based on the Simplex Method,d, together with the proof of its correctness and termination. This allows us to define the basic predicates over polyhedra in an effective way (i.e.?as programs), and relate them with the corresponding usual logical counterparts. To this end, we make an extensive use of the Boolean reflection metho作者: 得罪人 時(shí)間: 2025-3-30 02:39
A Formal Proof of the Expressiveness of Deep Learning,cs, and more. Recently, Cohen et al. provided theoretical evidence for the superiority of deep learning over shallow learning. We formalized their mathematical proof using Isabelle/HOL. The Isabelle development simplifies and generalizes the original proof, while working around the limitations of th作者: Haphazard 時(shí)間: 2025-3-30 04:16
Formalization of the Lindemann-Weierstrass Theorem,em establishes a link between the linear independence of a set of algebraic numbers and the algebraic independence of the exponentials of these numbers. As we follow Baker’s proof, we discuss the difficulties of its formalization and explain how we resolved them in Coq. Most of these difficulties re作者: LEERY 時(shí)間: 2025-3-30 11:29 作者: follicular-unit 時(shí)間: 2025-3-30 12:37 作者: Lasting 時(shí)間: 2025-3-30 17:40
How to Simulate It in Isabelle: Towards Formal Proof for Secure Multi-Party Computation,ecent breakthroughs are bringing MPC into practice, solving fundamental challenges for secure distributed computation. Just as with classic protocols for encryption and key exchange, precise guarantees are needed for MPC designs and implementations; any flaw will give attackers a chance to break pri作者: 欄桿 時(shí)間: 2025-3-30 21:49
FoCaLiZe and Dedukti to the Rescue for Proof Interoperability, in ad hoc pointwise translations, e.g. between HOL Light and Isabelle in the Flyspeck project or uses of more or less complete certificates. We propose in this paper a methodology to combine proofs coming from different theorem provers. This methodology relies on the Dedukti logical framework as a 作者: INCH 時(shí)間: 2025-3-31 04:03
,A Formal Proof in , of LaSalle’s Invariance Principle,he asymptotic stability of the solutions to a nonlinear system of differential equations and several extensions of this principle have been designed to fit different particular kinds of system. In this paper we present a formalization, in the . proof assistant, of a slightly improved version of the 作者: BLUSH 時(shí)間: 2025-3-31 07:10 作者: condone 時(shí)間: 2025-3-31 11:11
Certifying Standard and Stratified Datalog Inference Engines in SSReflect,nd of its extension with stratified negation. The library contains a formalization of the model theoretical and fixpoint semantics of the languages, implemented through bottom-up and, respectively, through stratified evaluation procedures. We provide corresponding soundness, termination, completenes作者: 鉗子 時(shí)間: 2025-3-31 15:04
Weak Call-by-Value Lambda Calculus as a Model of Computation in Coq,e and as a model of computation. We show key results including (1) semantic properties of procedures are undecidable, (2) the class of total procedures is not recognisable, (3) a class is decidable if it is recognisable, corecognisable, and logically decidable, and (4) a class is recognisable if and作者: 死貓他燒焦 時(shí)間: 2025-3-31 19:32
,Bellerophon: Tactical Theorem Proving for?Hybrid Systems, motion. Verification is undecidable for hybrid systems and challenging for many models and properties of practical interest. Thus, human interaction and insight are essential for verification. Interactive theorem provers seek to increase user productivity by allowing them to focus on those insights作者: fender 時(shí)間: 2025-4-1 00:07
,A Formalized General Theory of Syntax with?Bindings,malization efforts. Terms are defined for an arbitrary number of constructors of varying numbers of inputs, quotiented to alpha-equivalence and sorted according to a binding signature. The theory includes a rich collection of properties of the standard operators on terms, such as substitution and fr作者: HAIRY 時(shí)間: 2025-4-1 04:13
Proof Certificates in PVS,mentation of PVS to record detailed proofs step by step during the proof search process. At the current stage of this work, proofs can be built for any PVS theory. However, some reasoning steps rely on unverified assumptions. For a restricted fragment of PVS, the proofs are exported to the universal作者: 紅潤(rùn) 時(shí)間: 2025-4-1 09:01
Efficient, Verified Checking of Propositional Proofs,vers emit proofs that can be checked with reasonable efficiency. However, these checkers are not trivial and can have bugs as well. We propose to check proofs using a formally verified program that adds little overhead to the overall process of proof validation. We have implemented a sequence of inc作者: progestin 時(shí)間: 2025-4-1 10:32
