64 hasil
Menampilkan 1–20 · 0,41 detik · RSS
Journal of Formalized Reasoning
ISSN 1972-5787 · University of Bologna · 64 artikel di indeks
-
Artikel Jurnal Teks lengkap
C floating-point proofs layered with VST and Flocq
We demonstrate tools and methods for proofs about the correctness and numerical accuracy of C programs. The tools are foundational, in that they are connected to formal semantic specifications of the C operational semantics and of the IEEE 754 floating-point format. The tools are modular, in that…
-
Artikel Jurnal Teks lengkap
A Why3 proof of GMP algorithms
Large-integer arithmetic algorithms are used in contexts where both their performance and their correctness are critical, such as cryptographic software. The fastest algorithms are complex enough that formally verifying them is desirable but challenging. We have formally verified a comprehensive…
-
Artikel Jurnal Teks lengkap
Commutativity Theorems in Groups with Power-like Maps
There are several commutativity theorems in groups and rings which involve power maps f(x) = xn. The most famous example of this kind is Jacobson's theorem which asserts that any ring satisfying the identity xn = x is commutative. Such statements belong to first order logic with equality and hence…
-
Artikel Jurnal Teks lengkap
LF+ in Coq for "fast and loose" reasoning
We develop the metatheory and the implementation of LF+, and discuss several applications. LF+ capitalizes on research work, carried out by the authors over more than a decade, on Logical Frameworks. It builds on various conservative extensions of LF, which feature "lock"-type constructors, and on…
-
Artikel Jurnal Teks lengkap
Formalization Techniques for Asymptotic Reasoning in Classical Analysis
Formalizing analysis on a computer involves a lot of “epsilon-delta” reasoning, while informal reasoning may use some asymptotical hand-waving. Whether or not the arithmetic details are hidden using some abstraction like filters, a human user eventually has to break it down for the proof assistant…
-
Artikel Jurnal Teks lengkap
Dependent Types for Extensive Games
Extensive games are tools largely used in economics to describe decision processes of a community of agents. In this paper we propose a formal presentation based on the proof assistant COQ which focuses mostly on infinite extensive games and their characteristics. COQ proposes a feature called…
-
Artikel Jurnal Teks lengkap
A Decision Procedure for Univariate Polynomial Systems Based on Root Counting and Interval Subdivision
This paper presents a formally verified decision procedure for determinining the satisfiability of a system of univariate polynomial relations over the real line. The procedure combines a root counting function, based on Sturm’s theorem, with an interval subdivision algorithm. Given a system of…
-
Artikel Jurnal Teks lengkap
A Library for Algorithmic Game Theory in Ssreflect/Coq
We report on the formalization in Ssreflect/Coq of a number of concepts and results from algorithmic game theory, including potential games, smooth games, solution concepts such as Pure and Mixed Nash Equilibria, Coarse Correlated Equilibria, epsilon-approximate equilibria, and behavioral models of…
-
Artikel Jurnal Teks lengkap
Formal Proof of Banach-Tarski Paradox
Banach-Tarski Paradox states that a ball in 3D space is equidecomposable with twice itself, i.e. we can break a ball into a finite number of pieces, and with these pieces, build two balls having the same size as the initial ball. This strange result is actually a Theorem which was proven in 1924 by…
-
Artikel Jurnal Teks lengkap
Formalizing Restriction Categories
Restriction categories are an abstract axiomatic framework by Cockett and Lack for reasoning about (generalizations of the idea of) partiality of functions. In a restriction category, every map defines an endomap on its domain, the corresponding partial identity map. Restriction categories cover a…
-
Artikel Jurnal Teks lengkap
A Formally Proved, Complete Algorithm for Path Resolution with Symbolic Links
In the context of file systems like those of Unix, path resolution is the operation that given a character string denoting an access path, determines the target object (a file, a directory, etc.) designated by this path. This operation is not trivial because of the presence of symbolic links…
-
Artikel Jurnal Teks lengkap
Formalizing Scientifically Applicable Mathematics in a Definitional Framework
In [Arnon08, A framework for formalizing set theories based on the use of static set terms.] a new framework for formalizing mathematics was developed. The main new features of this framework are that it is based on the usual first-order set theoretical foundations of mathematics (in particular, it…
-
Artikel Jurnal Teks lengkap
Proof Auditing Formalised Mathematics
The first three formalisations of major mathematical proofs have heralded a new age in formalised mathematics, establishing that informal proofs at the limits of what can be understood by humans can be checked by machine. However, formalisation itself can be subject to error, and yet there is…
-
Artikel Jurnal Teks lengkap
Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC
The use of a functional language to implement proof strategies as proof tactics in interactive theorem provers, often provides short, concise and elegant implementations. Whilst being elegant, the use of higher order features and combinator languages often results in a very procedural view of a…
-
Artikel Jurnal Teks lengkap
Lawvere-Tierney sheafification in Homotopy Type Theory
Sheafification is a popular tool in topos theory which allows to extend the internal logic of a topos with new principles. One of its most famous applications is the possibility to transform a topos into a boolean topos using the dense topology, which corresponds in essence to Gödel’s double…
-
Artikel Jurnal Teks lengkap
QED Reloaded: Towards a Pluralistic Formal Library of Mathematical Knowledge
Proposed in 1994, the ``QED project'' was one of the seminally influential initiatives in automated reasoning: It envisioned the formalization of ``all of mathematics'' and the assembly of these formalizations in a single coherent database. Even though it never led to the concrete system, communal…
-
Artikel Jurnal Teks lengkap
Mathematical Text Processing in EA-style: a Sequent Aspect
The paper is devoted to the study of one of the aspects of the so-called Evidence Algorithm programme advanced by Academician V.M.~Glushkov and connected with the problem of automated theorem-proving search in the signature of first-order theories that can use different logics, such as classical…
-
Artikel Jurnal Teks lengkap
Preface: Twenty Years of the QED Manifesto
This special issue is dedicated to the 20th anniversary of the QEDManifesto and the related 1994 and 1995 QED Workshops.
-
Artikel Jurnal Teks lengkap
Theorema 2.0: Computer-Assisted Natural-Style Mathematics
The Theorema project aims at the development of a computer assistant for the working mathematician. Support should be given throughout all phases of mathematical activity, from introducing new mathematical concepts by definitions or axioms, through first (computational) experiments, the formulation…