Search
Search Results
-
A Simple and Efficient Framework of Proof Systems for NP
In this work, we propose a simple framework of constructing efficient non-interactive zero-knowledge proof (NIZK) systems for all...
-
A formal proof and simple explanation of the QuickXplain algorithm
In his seminal paper of 2004, Ulrich Junker proposed the QuickXplain algorithm, which provides a divide-and-conquer computation strategy to find...
-
A proof system of the CaIT calculus
The Internet of Things (IoT) can realize the interconnection of people, machines, and things anytime, anywhere. Most of the existing research mainly...
-
Proof Logging for the Circuit Constraint
Proof logging in constraint programming is an approach to certifying a conclusion reached by a solver. To allow for this, different propagators must...
-
Proof Systems
This chapter presents a proof system for Alonzo that is sound and complete with respect to the general semantics defined in Chap. 5...
-
A Simple Loopcheck for Intuitionistic K
In this paper, we present an algorithm for establishing decidability and finite model property of intuitionistic modal logic IK. These two results...
-
Admissible Ordering on Monomials is Well-Founded: A Constructive Proof
AbstractIn this paper, we consider a constructive proof of the termination of the normal form (NF) algorithm for multivariate polynomials, as well as...
-
SNACKs for Proof-of-Space Blockchains
SNACKs are succinct non-interactive arguments of chain knowledge. They allow for efficient and generic solutions to blockchain light-client...
-
A Matroid-Based Automatic Prover and Coq Proof Generator for Projective Incidence Geometry
We present an automatic theorem prover for projective incidence geometry. This prover does not consider coordinates. Instead, it follows a...
-
-
A Proof Procedure for Separation Logic with Inductive Definitions and Data
A proof procedure, in the spirit of the sequent calculus, is proposed to check the validity of entailments between Separation Logic formulas...
-
A Formalization and Proof Checker for Isabelle’s Metalogic
Isabelle is a generic theorem prover with a fragment of higher-order logic as a metalogic for defining object logics. Isabelle also provides proof...
-
Extremely Simple Fail-Stop ECDSA Signatures
Fail-stop signatures are digital signatures that allow a signer to prove that a specific forged signature is indeed a forgery. After such a proof is...
-
CHC Model Validation with Proof Guarantees
Formal verification tooling increasingly relies on logic solvers as automated reasoning engines. A point of commonality among these solvers is the...
-
POSMETER: proof-of-stake blockchain for enhanced smart meter data security
As smart home appliances have grown in popularity; a large amount of data has been created on smart meters pertaining to various consumers. Due to...
-
A Cyclic Proof System for Guarded Kleene Algebra with Tests
Guarded Kleene Algebra with Tests ( \(\texttt{GKAT}\)...
-
Automate where Automation Fails: Proof Strategies for Frama-C/WP
Modern deductive verification tools succeed in automatically proving the great majority of program annotations thanks in particular to constantly...
-
Spanning simple path inside a simple polygon
Given a set S of n colored points of m colors inside a simple polygon P , each point within the polygon has a specific color that is not necessarily...
-
Enabling Floating-Point Arithmetic in the Coq Proof Assistant
Floating-point arithmetic is a well-known and extremely efficient way of performing approximate computations over the real numbers. Although it...
-
Gym at Home - A Proof-of-Concept
The average life expectancy has increased in the last decades, but it is still necessary to promote a healthy and active aging. Although older people...