Results 1 to 10 of about 2,824 (120)
The Higher-Order Prover Leo-II. [PDF]
J Autom Reason, 2015 Leo-II is an automated theorem prover for classical higher-order logic. The prover has pioneered cooperative higher-order-first-order proof automation, it has influenced the development of the TPTP THF infrastructure for higher-order logic, and it has ...
Benzmüller C +3 more
europepmc +6 more sources
Hoare-style Specifications as Correctness Conditions for Non-linearizable Concurrent Objects [PDF]
, 2016 Designing scalable concurrent objects, which can be efficiently used on multicore processors, often requires one to abandon standard specification techniques, such as linearizability, in favor of more relaxed consistency requirements.
Banerjee, Anindya +3 more
core +2 more sources
Dynamic IFC Theorems for Free!
, 2020 We show that noninterference and transparency, the key soundness theorems for dynamic IFC libraries, can be obtained "for free", as direct consequences of the more general parametricity theorem of type abstraction.
Algehed, Maximilian +2 more
core +1 more source
Robust Computer Algebra, Theorem Proving, and Oracle AI [PDF]
, 2017 In the context of superintelligent AI systems, the term "oracle" has two meanings. One refers to modular systems queried for domain-specific tasks. Another usage, referring to a class of systems which may be useful for addressing the value alignment and ...
Hay, Nick J., Sarma, Gopal P.
core +3 more sources
Lincx: A Linear Logical Framework with First-class Contexts [PDF]
, 2017 Linear logic provides an elegant framework for modelling stateful, imperative and con- current systems by viewing a context of assumptions as a set of resources.
Linn Georges, Aina +3 more
core +1 more source
Concurrent Data Structures Linked in Time [PDF]
, 2017 Arguments about correctness of a concurrent data structure are typically carried out by using the notion of linearizability and specifying the linearization points of the data structure's procedures.
Banerjee, Anindya +3 more
core +3 more sources
, 2010 The goal of this lecture is to show how modern theorem provers---in this case, the Coq proof assistant---can be used to mechanize the specification of programming languages and their semantics, and to reason over individual programs and over generic ...
Leroy, Xavier
core +4 more sources
A Machine-Checked Formalization of the Generic Model and the Random Oracle Model [PDF]
, 2004 Most approaches to the formal analyses of cryptographic protocols make the perfect cryptography assumption, i.e. the hypothese that there is no way to obtain knowledge about the plaintext pertaining to a ciphertext without knowing the key.
A. Fiat +25 more
core +6 more sources
Coinductive Formal Reasoning in Exact Real Arithmetic [PDF]
, 2008 In this article we present a method for formally proving the correctness of the lazy algorithms for computing homographic and quadratic transformations -- of which field operations are special cases-- on a representation of real numbers by coinductive ...
Martín Escardó, Milad Niqui
core +1 more source
Mechanizing Principia Logico-Metaphysica in Functional Type Theory
, 2019 Principia Logico-Metaphysica contains a foundational logical theory for metaphysics, mathematics, and the sciences. It includes a canonical development of Abstract Object Theory [AOT], a metaphysical theory (inspired by ideas of Ernst Mally, formalized ...
Benzmüller, Christoph +2 more
core +1 more source