Buscar
Mostrando ítems 1-10 de 445
Efficient non-interactive zero-knowledge Proofs
(Universidad de Chile, 2017)
Non-Interactive Zero-Knowledge (NIZK) proofs, are proofs that yield nothing beyond their validity. As opposed to the interactive variant, NIZK proofs consist of only one message and are more suited for high-latency scenarios ...
Redundancy in distributed proofs
(Springer, 2020)
Distributed proofs are mechanisms that enable the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g., having a specific diameter), or on ...
Proving compiler correctness using step-indexed logical relations
(2016)
In this paper we prove the correctness of a compiler for a call-by-name language using step-indexed logical relations and biorthogonality. The source language is an extension of the simply typed lambda-calculus with ...
Proving concurrent constraint programming correct, revisited
(Elsevier, 2015)
Probative reasoning based on indicationsRazonamiento probatorio a partir de indicios
(Pontificia Universidad Católica del Perú, 2018)
Reasoning about Partial Correctness Assertions in Isabelle/HOL
(Instituto de Informática - Universidade Federal do Rio Grande do Sul, 2020)
A Mechanized Proof of a Textbook Type Unification Algorithm
(Instituto de Informática - Universidade Federal do Rio Grande do Sul, 2020)
Internal program extraction in the calculus of inductive constructions
(UR. FI – INCO., 2002)
Based on the Calculus of Constructions extended with inductive definitions we present a Theory of Specifications with rules for simultaneously constructing programs and their correctness proofs. The theory contains types ...
An corrigendum on the paper: Solving the job-shop scheduling problem optimally by dynamic programming
(Pergamon-Elsevier Science Ltd, 2017-02)
In [1] an algorithm is proposed for solving the job-shop scheduling problem optimally using a dynamic programming strategy. This is, according to our knowledge, the first exact algorithm for the Job Shop problem which is ...
Towards secure distributed computations
(UR. FI – INCO., 2009)
In this paper, we present an infrastructure for securing distributed computations between hosts, using a novel technique called Proof Carrying Results. This technique is based on Necula's proof carrying code. Basically, ...