作者: 故意釣到白楊 時(shí)間: 2025-3-21 20:47
Verified Synthesis of Knowledge-Based Programs in Finite Synchronous EnvironmentsKBPs to executable automata with a proof of correctness in Isabelle/HOL. We develop the algorithm top-down, using Isabelle’s locale mechanism to structure these proofs, and show that two classic examples can be synthesised using Isabelle’s code generator.作者: cogitate 時(shí)間: 2025-3-22 03:54
https://doi.org/10.1007/978-3-642-22863-6ACL2; Coq; HOL; Isabelle; formal methods; program semantics; proof assistants作者: MAG 時(shí)間: 2025-3-22 04:38
978-3-642-22862-9Springer-Verlag GmbH Berlin Heidelberg 2011作者: NAUT 時(shí)間: 2025-3-22 10:35
Interactive Theorem Proving978-3-642-22863-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Vldl379 時(shí)間: 2025-3-22 15:51
Advances in the Formalization of the Odd Order TheoremWe present some of the proof techniques and library designs we used to formalize a large part of the proof of the Odd Order theorem.作者: cancer 時(shí)間: 2025-3-22 19:29 作者: 蕨類(lèi) 時(shí)間: 2025-3-23 01:14
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/i/image/470571.jpg作者: dowagers-hump 時(shí)間: 2025-3-23 02:51 作者: Abduct 時(shí)間: 2025-3-23 07:08
Formalization of Entropy Measures in HOLe some of its properties using the HOL theorem prover. This infrastructure is then used to formalize information theoretic fundamentals like Shannon entropy and relative entropy. We discuss potential applications of the proposed formalization for the analysis of data compression and security protocols.作者: Banister 時(shí)間: 2025-3-23 13:05
Verifying Object-Oriented Programs with Higher-Order Separation Logic in Coqgrams that (1) depend on some unknown code satisfying a specification or that (2) return objects conforming to a certain specification. All of our results have been formally verified in the interactive theorem prover Coq.作者: FLIC 時(shí)間: 2025-3-23 14:06
Relational Decompositionosition is applicable across heterogeneous pairs of transition systems. We apply our approach to justify variants of Benton’s Relational Hoare Logic (RHL) for a language with objects, and present novel rules for relating loops that fail to proceed in lockstep. We also outline applications to noninterference and separation logic.作者: 防水 時(shí)間: 2025-3-23 18:03
Proving Valid Quantified Boolean Formulas in HOL Light’s outputs based on the LCF approach. An error in Squolem was discovered thanks to the integration. Experiments show that the feasibility of the integration is very sensitive to implementation of HOL Light and used inferences. This resulted in improvements in HOL Light’s inference system.作者: monogamy 時(shí)間: 2025-3-24 00:07
0302-9743 m rewriting, theorem proving, computability theory, translations from one formalism to another, and cooperation between tools. Several verification case studies were presented, with applications to computational geometry, unification, real analysis, etc.978-3-642-22862-9978-3-642-22863-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 賞錢(qián) 時(shí)間: 2025-3-24 04:00 作者: NAIVE 時(shí)間: 2025-3-24 08:06
Towards Robustness Analysis Using PVSties under consideration here. In this paper, we briefly explain the shortcomings of ACL2 relatively to our problem, and we investigate the application of PVS, thus enabling to improve our simple and multiple faults models and the associated verification methodology.作者: exorbitant 時(shí)間: 2025-3-24 10:45 作者: 干旱 時(shí)間: 2025-3-24 18:22
Three Chapters of Measure Theory in Isabelle/HOL Fubini’s theorem. We define the Lebesgue measure using the gauge integral available in Isabelle’s multivariate analysis. Finally, we relate both integrals and equate the integral on Euclidean spaces with iterated integrals. This work covers most of the first three chapters of Bauer’s measure theory textbook.作者: 催眠 時(shí)間: 2025-3-24 20:28 作者: 安定 時(shí)間: 2025-3-25 00:06
Animating the Formalised Semantics of a Java-Like Languageuch as the reflexive transitive closure and Russell’s definite description operator. From our experience, we distill simple guidelines on how to develop future formalisations with executability in mind.作者: 可憎 時(shí)間: 2025-3-25 04:18 作者: ALOFT 時(shí)間: 2025-3-25 11:04
Logical Formalisation and Analysis of the Mifare Classic Card in PVS LFSR, the filter function and (parts of) the authentication protocol, thus serving as precise documentation of the card’s ingredients and their properties. Additionally, the mathematics is described that makes two key-retrieval attacks from?[6] work.作者: inchoate 時(shí)間: 2025-3-25 13:47 作者: aqueduct 時(shí)間: 2025-3-25 18:24
Validating QBF Validity in HOL4rmance data shows that LCF-style checking of validity certificates is often (but not always) feasible even for large QBF instances. Additionally, our work provides high correctness assurances for Squolem’s claims of validity and uncovered a soundness bug in a previous version of its certificate validator QBV.作者: 寬宏大量 時(shí)間: 2025-3-25 20:50
Conference proceedings 2011ed are counterexample generation, verification, validation, term rewriting, theorem proving, computability theory, translations from one formalism to another, and cooperation between tools. Several verification case studies were presented, with applications to computational geometry, unification, real analysis, etc.作者: atopic 時(shí)間: 2025-3-26 02:39 作者: 我正派 時(shí)間: 2025-3-26 04:36 作者: 裝飾 時(shí)間: 2025-3-26 12:29 作者: minimal 時(shí)間: 2025-3-26 15:21
Alexander Krauss,Christian Sternagel,René Thiemann,Carsten Fuhs,Jürgen Giesls einem aktuellen Bereich der CAD-Anwendungen. Zunehmende Komplexit?t der angebotenen Systeme, ein gr??erer Verbreitungsgrad und das Bedürfnis verschiedenartiger Partner, ihre Daten und Arbeiten auszutauschen, erzeugen vielf?ltige Probleme. Die Auswahl der Beitr?ge zeigt, da? Benutzer, Hersteller, A作者: Picks-Disease 時(shí)間: 2025-3-26 19:36 作者: 刺耳 時(shí)間: 2025-3-26 22:32
Ond?ej Kun?ars einem aktuellen Bereich der CAD-Anwendungen. Zunehmende Komplexit?t der angebotenen Systeme, ein gr??erer Verbreitungsgrad und das Bedürfnis verschiedenartiger Partner, ihre Daten und Arbeiten auszutauschen, erzeugen vielf?ltige Probleme. Die Auswahl der Beitr?ge zeigt, da? Benutzer, Hersteller, A作者: hidebound 時(shí)間: 2025-3-27 03:03 作者: 愉快么 時(shí)間: 2025-3-27 08:10 作者: magnate 時(shí)間: 2025-3-27 10:59
Challenges in Verifying Communication Fabricsmine some challenges and open problems in functional verification communication fabrics and in their quality of service analysis and optimization. We will also review some progress that has been done in liveness verification of communication fabrics.作者: Infinitesimal 時(shí)間: 2025-3-27 15:11
Verifying Object-Oriented Programs with Higher-Order Separation Logic in Coqvelop novel specification and proof patterns for reasoning in higher-order separation logic with nested triples about programs that use interfaces and interface inheritance. In particular, we show how to use the higher-order features of the Coq formalisation to specify and reason modularly about pro作者: 離開(kāi)真充足 時(shí)間: 2025-3-27 19:02
Relational Decompositionogram logics for one-execution properties. Generalizing the approach of self-composition, we develop a notion of interpolants that decompose along the phrase structure, and relate these interpolants to unary and relational predicate transformers. In contrast to previous formalisms, relational decomp作者: Capitulate 時(shí)間: 2025-3-28 01:12
Structural Analysis of Narratives with the Coq Proof Assistantnstrating the suitability of Intuitionistic Linear Logic as a conceptual model. More specifically, we describe a method for modelling narrative resources and actions, together with constraints on the story endings in the form of an ILL sequent. We describe how well-formed narratives can be interpret作者: onlooker 時(shí)間: 2025-3-28 04:10
Towards Robustness Analysis Using PVS We consider solutions oriented towards theorem-proving techniques as an alternative to classical fault-injection techniques, for analyzing the consequences of errors caused by transient faults. A preliminary study was conducted to evaluate the advantages of a highly automated tool like ACL2 in that作者: 芭蕾舞女演員 時(shí)間: 2025-3-28 09:31
Verified Synthesis of Knowledge-Based Programs in Finite Synchronous EnvironmentsKBPs to executable automata with a proof of correctness in Isabelle/HOL. We develop the algorithm top-down, using Isabelle’s locale mechanism to structure these proofs, and show that two classic examples can be synthesised using Isabelle’s code generator.作者: Encephalitis 時(shí)間: 2025-3-28 10:39 作者: effrontery 時(shí)間: 2025-3-28 18:14 作者: alcohol-abuse 時(shí)間: 2025-3-28 20:38
Three Chapters of Measure Theory in Isabelle/HOL this restriction by introducing the extended real numbers. We define the Borel .-algebra for an arbitrary type forming a topological space. Then, we introduce measure spaces with extended real numbers as measure values. After defining the Lebesgue integral and verifying its linearity and monotone c作者: MITE 時(shí)間: 2025-3-29 00:01
Termination of Isabelle Functions via Termination of Rewritingand invoking an external termination prover. Our link to the external prover includes full proof reconstruction, where all necessary properties are derived inside Isabelle/HOL without oracles. Apart from the certification of the imported proof, the main challenge is the formal reduction of the proof作者: Watemelon 時(shí)間: 2025-3-29 05:00
Validating QBF Validity in HOL4 of these certificates in the HOL4 theorem prover. This enables HOL4 users to benefit from Squolem’s automation for valid QBF problems. Detailed performance data shows that LCF-style checking of validity certificates is often (but not always) feasible even for large QBF instances. Additionally, our 作者: 剝皮 時(shí)間: 2025-3-29 09:33
Proving Valid Quantified Boolean Formulas in HOL Lightrates certificates of validity which are based on witness functions. The certificates are checked in HOL Light by constructing proofs based on these certificates. The presented approach allows HOL Light users to prove larger valid QBF problems than before and provides correctness checking of Squolem作者: NAV 時(shí)間: 2025-3-29 14:23
Applying ACL2 to the Formalization of Algebraic Topology: Simplicial Polynomialsre exists a homotopy equivalence between the chain complex of a simplicial set, and a smaller chain complex for the same simplicial set, called the normalized chain complex. The interest of this work stems from three sources. First, the normalization theorem is the basis for some design decisions in作者: invulnerable 時(shí)間: 2025-3-29 18:11
Animating the Formalised Semantics of a Java-Like Languagese techniques to the large . formalisation. It models a substantial subset of multithreaded Java source and bytecode in Isabelle/HOL and focuses on proofs and modularity whereas code generation was of little concern in its design. Employing Isabelle’s code generation facilities, we obtain a verified作者: 背信 時(shí)間: 2025-3-29 23:16 作者: 手銬 時(shí)間: 2025-3-30 02:10
On the Generation of Positivstellensatz Witnesses in Degenerate Casesolutions, to finding polynomials that are sums of squares of polynomials and satisfy some linear equality .. This produces a . for the desired property, from which it is reasonably easy to obtain a formal proof of the property suitable for a proof assistant such as Coq..The problem of finding a witn作者: Reclaim 時(shí)間: 2025-3-30 04:24
Michael Kishinevsky,Alexander Gotmanov,Yuriy Viktorov作者: Innovative 時(shí)間: 2025-3-30 08:36 作者: 出沒(méi) 時(shí)間: 2025-3-30 12:29
Anne-Gwenn Bosser,Pierre Courtieu,Julien Forest,Marc Cavazza作者: Lament 時(shí)間: 2025-3-30 20:21 作者: GLUE 時(shí)間: 2025-3-30 23:13 作者: 打火石 時(shí)間: 2025-3-31 04:35 作者: Hiatal-Hernia 時(shí)間: 2025-3-31 05:27 作者: HATCH 時(shí)間: 2025-3-31 09:51
Johannes H?lzl,Armin Helleruelle abh?ngt. Das Hilfsmittel ?elektronische Datenverarbeitung“ hat auf Grund seiner Eigengesetzlichkeit und Virtuosit?t eine Fülle von methodischen ?nderungen im Bereich der Denk- und Verhaltensweisen ergeben, deren Vorteile sich erst mit der immer st?rker werdenden Integration dieses Hilfsmittels作者: 自作多情 時(shí)間: 2025-3-31 15:29
Alexander Krauss,Christian Sternagel,René Thiemann,Carsten Fuhs,Jürgen Giesl Nutzung von CAD in Maschinenbau, Bauwesen und Architektur: W?hrend im Maschinenbau die Einführung und Nutzung von CAD fast zum allt?glichen Gesch?ft geworden ist, stehen Bauwesen und Architektur noch an der Einführungsschwelle. Die Probleme dort sind besonders gro?, da die marktg?ngigen Systeme aus作者: Confirm 時(shí)間: 2025-3-31 19:28
Ramana Kumar,Tjark Weberuelle abh?ngt. Das Hilfsmittel ?elektronische Datenverarbeitung“ hat auf Grund seiner Eigengesetzlichkeit und Virtuosit?t eine Fülle von methodischen ?nderungen im Bereich der Denk- und Verhaltensweisen ergeben, deren Vorteile sich erst mit der immer st?rker werdenden Integration dieses Hilfsmittels作者: 漫步 時(shí)間: 2025-4-1 00:23 作者: 祖?zhèn)髫?cái)產(chǎn) 時(shí)間: 2025-4-1 05:11 作者: 左右連貫 時(shí)間: 2025-4-1 08:48
Why Feynman Diagrams Are Worth 10,000 Formulae: A Representational Epistemological Analysisdynamics (QED), and are generalisable to other quantum field theories. They are a paradigmatic example of how diagrams enable understanding and problem solving in complex knowledge domains. This paper examines why they are so effective from a cognitive perspective by adopting a . approach that shows作者: Brocas-Area 時(shí)間: 2025-4-1 12:48
https://doi.org/10.1057/9781137437907blood; girls; Host; Japan; Japanese; Mobile; object; police; sky作者: 滲透 時(shí)間: 2025-4-1 14:32
neering fields over the next decade. Bioengineers and biotechnologists have enormous potential to meet employment needs ranging from traditional careers in science and engineering through a host of alternative career pathways. ..This book provides a roadmap to the broad and varied career development
