A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Filters
Small Proof Witnesses for LF
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
We instrument a higher-order logic programming search procedure to generate and check small proof witnesses for the Twelf system, an implementation of the logical framework LF. ...
Our experimental results demonstrate that many of the restrictions in previous work can be overcome and generating and checking small witnesses within Twelf provides valuable addition to its general safety ...
In this paper, we describe the design of generating and checking of small proof witnesses for the full logical framework LF. ...
doi:10.1007/11562931_29
fatcat:mwr7ifjns5c6timdcebrcfmdye
Small Proof Witnesses for LF
2018
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We instrument a higher-order logic programming search procedure to generate and check small proof witnesses for the Twelf system, an implementation of the logical framework LF. ...
Our experimental results demonstrate that many of the restrictions in previous work can be overcome and generating and checking small witnesses within Twelf provides valuable addition to its general safety ...
In this paper, we describe the design of generating and checking of small proof witnesses for the full logical framework LF. ...
doi:10.1184/r1/6609560
fatcat:ctgarv3k3vepxgby5hbymbgdte
Foundational proof checkers with small witnesses
2003
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming - PPDP '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Proof checkers for proof-carrying code (and similar) systems can suffer from two problems: huge proof witnesses and untrustworthy proof rules. ...
We show the theory, design, and implementation of a proof-checker that permits small proof witnesses and machine-checkable proofs of the soundness of the system. ...
Small proof witnesses Necula has a series of results on reducing proof size. He represents logics, theorems, and proofs in the notation of the Edinburgh Logical Framework (LF) [8] . ...
doi:10.1145/888251.888276
dblp:conf/ppdp/WuAS03
fatcat:by4aj4yjlvg5tg34g3ssccwawy
Attribute-based signatures without pairings via the fiat-shamir paradigm
2014
Proceedings of the 2nd ACM workshop on ASIA public-key cryptography - ASIAPKC '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Our boolean proof system is a generalization of the well-known OR-proof system; that is, it can treat any boolean formula instead of a single ORgate. ...
Then, by combining our boolean proof system with a credential bundle scheme of the Fiat-Shamir signature, we obtain a generic attribute-based identification (ABID) scheme of proof of knowledge. ...
Concerning the third author, this work is partially supported by Grants-in-Aid for Scientific Research; Research Project Number:25540004. ...
doi:10.1145/2600694.2600696
dblp:conf/ccs/AnadaAS14
fatcat:o5byvgeinjbjzpfrxj637uns6e
DELAUNAY REFINEMENT ALGORITHMS FOR ESTIMATING LOCAL FEATURE SIZE IN 2D AND 3D
2011
International journal of computational geometry and applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present Delaunay refinement algorithms for estimating local feature on the 0-skeleton of a 2D piecewise linear complex (2D) and on the 1-skeleton of a 3D PLC. ...
These algorithms are designed to eliminate the need for a local feature size oracle in quality mesh generation of domains containing acute input angles. ...
A small fs 1 does in practice lead to more refinement than simply a small lfs as was suggested by the constants in the proof. ...
doi:10.1142/s0218195911003780
fatcat:lrorbfnsijb2zjx35w3duu4jqq
Filter-Laver Measurability
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Proof. Suppose A i ∈ D F + for i < ω. Let ϕ i witness this for each i, and define ϕ by setting ϕ(σ) := i<|σ| ϕ i (σ). We claim that ϕ witnesses that A = i<ω A i ∈ D F + . Pick x ∈ A. ...
Proof. In either case, we have a continuous f : ω ω → 2 ω such that f -preimages of meager sets are I LF -small, as above. Let A ∈ Γ and σ ∈ 2 <ω arbitrary. ...
arXiv:1612.04170v1
fatcat:t4pqg3xqcrb5phzwtjegslnezy
Estimates for normal meromorphic functions
1971
Annales Academiae Scientiarum Fennicae Series A I Mathematica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
For l"f(r)l < t, we apply Theorem 4 to tlf@. If we change the proof slightly 'w-e do not have to assume that the trvice-punctured plane has a covering surface of hyperbolic type. ...
Proof. If follows from (Ll) that (llzl')lf'(z)l<2u whenover lf@)l < I . Hence we can apply the lemma wit}r, M : 2u . We immediately obtain (5.3) . ...
have d,*(z) : lw(z)l for small lz -zol . ...
doi:10.5186/aasfm.1971.476
fatcat:m2a4hc47dvev7cybx55cjfn4qy
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our proof differs from [10] and is perhaps more intuitive. • We give an online algorithm for maximum delay-factor that is O(1/ 2 )-competitive with (1 + )speed for unit-sized pages and with (2 + )-speed ...
Our proof differs from that of Chang et al.; it does not explicitly use the unit-size assumption and this is what enables the generalization to different page sizes. ...
Let R i be the maximum wait ratio for any job in J i witnessed by LF. ...
doi:10.1007/978-3-642-04128-0_40
fatcat:qi7frqcgxjegdkmvhhgkznzc7a
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
[article]
2009
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Our proof differs from [10] and is perhaps more intuitive. - We give an online algorithm for maximum delay-factor that is O(1/eps^2)-competitive with (1+\eps)-speed for unit-sized pages and with (2+\eps ...
)-speed for different sized pages. ...
Let R i be the maximum wait ratio for any job in J i witnessed by LF. ...
arXiv:0906.2048v1
fatcat:uaqn3kcmznfyhdmvi6pkp7bzii
Manifold reconstruction using tangential Delaunay complexes
2010
Proceedings of the 2010 annual symposium on Computational geometry - SoCG '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To the best of our knowledge, this is the first certified algorithm for manifold reconstruction whose complexity depends linearly on the ambient dimension. ...
We also prove that for a dense enough sample the output of our algorithm is ambient isotopic to the manifold and a close geometric approximation of the manifold. ...
The authors also greatfully acknowledge the work of the reviewers and thank them for their detailed comments that helped to improve the manuscript. ...
doi:10.1145/1810959.1811013
dblp:conf/compgeom/BoissonnatG10
fatcat:7nm3lk477nff7nwkk5tufimx2q
A topological characterization of LF-spaces
2012
Topology and its Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We present a topological characterization of LF-spaces and detect small box-products that are (locally) homeomorphic to LF-spaces. ...
Acknowledgements The authors would like to express their thanks to Katsuro Sakai and to the referees (who noticed a gap in the original version of the paper) for valuable suggestions and remarks. ...
Assume that for infinitely many numbers n ∈ ω the space X n is lz-pointed. Then the small box-product n∈ω X n is homeomorphic to (an open subset of) the small box-product n∈ω E n . Proof. ...
doi:10.1016/j.topol.2012.01.011
fatcat:5rjveckapncxpm72twurpqp2le
Quantified Propositional Logspace Reasoning
[article]
2008
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
This is done by giving a logarithmic-space algorithm that witnesses GL^* proofs. ...
In this paper, we develop a quantified propositional proof systems that corresponds to logarithmic-space reasoning. ...
The idea behind the proof is to give an LF L function that witnesses the quantifiers in the proof. ...
arXiv:0801.4105v1
fatcat:oacvpcgg4zerjin4ows4wupvu4
On low for speed oracles
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Inspired by lowness notions from computability theory, Allender introduced the concept of "low for speed" oracles. ...
An oracle A is low for speed if relativizing to A has essentially no effect on computational complexity, meaning that if a decidable language can be decided in time f(n) with access to oracle A, then it ...
This is not the case: we show that LFS is -unconditionally -a nullset. Theorem 4.1. The set LFS has measure 0. Indeed, no Schnorr random is low for speed. Proof. ...
arXiv:1712.09710v1
fatcat:4e2d6otksbhbhcgr6ce2jca64m
Small Witnesses for Abstract Interpretation-Based Proofs
[chapter]
2007
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
interpretation-based proof carrying code uses post-fixpoints of abstract interpretations to witness that a program respects a safety policy. ...
For distributive analyses, we show that a smallest witness exist and we give an iterative algorithm for computing it. ...
To optimise the size of these proofs, Necula and Lee proposed LF i a compressed proof format for LF terms [NL98] . ...
doi:10.1007/978-3-540-71316-6_19
fatcat:rcc3acotdzavzmlyg3hn3lt64u
Towards a Logical Framework with Intersection and Union Types
2017
Proceedings of the Workshop on Logical Frameworks and Meta-Languages: Theory and Practice - LFMTP '17
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We present an ongoing implementation of a dependent-type theory (∆-framework) based on the Edinburgh Logical Framework LF, extended with Proof-functional logical connectives such as intersection, union ...
Once validated in vitro, the proof-functional type theory could be successfully plugged into existing truth-functional proof-systems. ...
to the anonymous referees for the useful comments, and to Dave Ritchie for a careful reading of the document. ...
doi:10.1145/3130261.3130262
fatcat:2zcb3akvljg77lrpr4gcdellfi
« Previous
Showing results 1 — 15 out of 9,796 results