Filters








1,082 Hits in 4.3 sec

Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof [chapter]

Luís Cruz-Filipe, Peter Schneider-Kamp
2015 Lecture Notes in Computer Science  
In recent work, we formalized the theory of optimal-size sorting networks with the goal of extracting a verified checker for the large-scale computer-generated proof that 25 comparisons are optimal when  ...  The checker uses an untrusted oracle based on these witnesses and is able to verify the smaller case of 8 inputs within a couple of days, but it did not scale to the full proof for 9 inputs.  ...  The authors were supported by the Danish Council for Independent Research, Natural Sciences. Computational resources were generously provided by the Danish Center for Scientific Computing.  ... 
doi:10.1007/978-3-319-20615-8_4 fatcat:4lxd4iptxveatlpk6igmjoafxm

Efficient Certified Resolution Proof Checking [chapter]

Luís Cruz-Filipe, Joao Marques-Silva, Peter Schneider-Kamp
2017 Lecture Notes in Computer Science  
We then formalize the theory underlying propositional proof checking in Coq, and extract a correct-by-construction proof checker for our format from the formalization.  ...  An empirical evaluation using 280 unsatisfiable instances from the 2015 and 2016 SAT competitions shows that this certified checker usually performs comparably to a state-of-the-art non-certified proof  ...  Heule for comments on an early draft of this paper.  ... 
doi:10.1007/978-3-662-54577-5_7 fatcat:ip2hfwhsobcmtcj5fsza3bhwfm

Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker [chapter]

Luís Cruz-Filipe, Peter Schneider-Kamp
2015 Lecture Notes in Computer Science  
From this formalization we extract a certified checker that successfully verifies computer-generated proofs of optimality on up to 8 inputs.  ...  Since the proof of the four color theorem in 1976, computer-generated proofs have become a reality in mathematics and computer science.  ...  The authors were supported by the Danish Council for Independent Research, Natural Sciences. Computational resources were generously provided by the Danish Center for Scientific Computing.  ... 
doi:10.1007/978-3-319-22102-1_10 fatcat:e7dmht2omndbvkabqv4rh67hpi

Industrial-Strength Formally Certified SAT Solving [article]

Ashish Darbari and Bernd Fischer and Joao Marques-Silva
2009 arXiv   pre-print
The core of the system is a certified checker for unsatisfiability claims that is formally designed and verified in Coq. We present its formal design and outline the correctness proofs.  ...  This paper presents an alternative approach where an untrusted, industrial-strength, SAT solver is plugged into a trusted, formally certified, SAT proof checker to provide industrial-strength certified  ...  Amjad for answering our questions on their work and also carrying out industrial benchmark evaluation on their checker. A. P. Landells helped out with server issues.  ... 
arXiv:0911.1678v2 fatcat:zwww274wfjez7mwx5l3j4jd3f4

Type-preserving compilation for large-scale optimizing object-oriented compilers

Juan Chen, Chris Hawblitzel, Frances Perry, Mike Emmi, Jeremy Condit, Derrick Coetzee, Polyvios Pratikaki
2008 Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation - PLDI '08  
This paper presents the implementation of type-preserving compilation in a complex, large-scale optimizing compiler.  ...  Compared to prior work, this implementation supports extensive optimizations, and it verifies a large portion of the interface between the compiler and the runtime system.  ...  Acknowledgments We would like to thank David Tarditi, Jim Larus, and Galen Hunt for their guidance and support of this work, David Tarditi and the Bartok team for their help with Bartok-related issues,  ... 
doi:10.1145/1375581.1375604 dblp:conf/pldi/ChenHPECCP08 fatcat:hqjt6hopvzel3luitzvm5wqye4

Type-preserving compilation for large-scale optimizing object-oriented compilers

Juan Chen, Chris Hawblitzel, Frances Perry, Mike Emmi, Jeremy Condit, Derrick Coetzee, Polyvios Pratikaki
2008 SIGPLAN notices  
This paper presents the implementation of type-preserving compilation in a complex, large-scale optimizing compiler.  ...  Compared to prior work, this implementation supports extensive optimizations, and it verifies a large portion of the interface between the compiler and the runtime system.  ...  Acknowledgments We would like to thank David Tarditi, Jim Larus, and Galen Hunt for their guidance and support of this work, David Tarditi and the Bartok team for their help with Bartok-related issues,  ... 
doi:10.1145/1379022.1375604 fatcat:ntqd45qjyfg4pgpvlwj4nhpeqy

Deductive Runtime Certification

Konstantine Arkoudas, Martin Rinard
2005 Electronical Notes in Theoretical Computer Science  
We have developed denotational proof languages (DPLs) as a uniform platform for certified computation.  ...  This paper introduces a notion of certified computation whereby an algorithm not only produces a result r for a given input x, but also proves that r is a correct result for x.  ...  Acknowledgments: We would like to thank Viktor Kuncak, Darko Marinov, and Olin Shivers for several helpful insights and suggestions.  ... 
doi:10.1016/j.entcs.2004.01.035 fatcat:wah4lgc6mnee7cy4wjs22lew5q

Computation Certification as a Service in the Cloud

S. M. Khan, K. W. Hamlen
2013 2013 13th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing  
Untrusted computations are instrumented with a checkpointing mechanism that yields a proof of computation integrity as the computation progresses.  ...  This proof can be validated by a trusted cloud to ensure that the computation was carried out faithfully.  ...  Computation Integrity Proof Generation and Validation CloudCover approaches the problem of proof generation through checkpointing, as illustrated in Fig. 2 .  ... 
doi:10.1109/ccgrid.2013.75 dblp:conf/ccgrid/KhanH13 fatcat:a4o2zhrgpvbttj7hfcf22u5zci

Recent advances in interactive and automated analysis

Radu Mateescu
2017 International Journal on Software Tools for Technology Transfer (STTT)  
Computers and distributed software applications are becoming nowadays ubiquitous, and therefore their safety and reliability have increasingly important societal impact.  ...  Despite the relevant scientific results and well-established tools obtained in recent years, there is a constant need of enhancing the analysis capabilities in order to handle increasingly complex systems  ...  Acknowledgments We are grateful to all authors for their contributions, as well as to the reviewers of TACAS'16 and of this special issue for their careful and constructive examination of the manuscripts  ... 
doi:10.1007/s10009-017-0477-y fatcat:ouhrg3llyfcjxkogcchu64ggyy

Proof-Carrying Code. Design and Implementation [chapter]

George C. Necula
2002 Proof and System-Reliability  
Proof-Carrying Code (PCC) is a general mechanism for verifying that a code fragment can be executed safely on a host system.  ...  We consider two possible representations for the proofs carried with the code, one using Logical Frameworks and the other using hints for guiding a non-deterministic proof reconstructor.  ...  Acknowledgments I would like to thank Peter Lee for his guidance for developing the original Proof-Carrying Code system and Shree Rahul for the help with the collection of the experimental data presented  ... 
doi:10.1007/978-94-010-0413-8_8 fatcat:ixycakdqwbezrhalazuhqbpqnm

Determinism in the Certification of UNSAT Proofs

Tomer Libal, Xaviera Steele
2017 Electronic Proceedings in Theoretical Computer Science  
In this paper, we experiment with this approach and conclude that by placing some restrictions on the formats, one can mostly eliminate the need for search and in principle, can certify proofs of arbitrary  ...  Our approach is different because it is based on an extremely simplified certifier. This certifier enjoys a very high level of trust but is very inefficient.  ...  We would like to thank the anonymous reviewers for the many constructive remarks.  ... 
doi:10.4204/eptcs.262.6 fatcat:mlhqjnwpx5h7rjfrpnrfng4ef4

Automated techniques for provably safe mobile code

Christopher Colby, Karl Crary, Robert Harper, Peter Lee, Frank Pfenning
2003 Theoretical Computer Science  
Concrete realizations of this framework are proof-carrying code, where the evidence for safety is a formal proof generated by a certifying compiler, and typed assembly language, where the evidence for  ...  We present a general framework for provably safe mobile code. It relies on a formal deÿnition of a safety policy and explicit evidence for compliance with this policy which is attached to a binary.  ...  A veriÿcation-condition generator is then used to extract a veriÿcation condition, and a certifying theorem prover generates the proof which is attached to the target code.  ... 
doi:10.1016/s0304-3975(01)00201-8 fatcat:gs6i47buajc6jgmwy6b24qa6da

Certifying deadlock-freedom for BIP models

Jan Olaf Blech, Michaël Périn
2009 Proceedings of th 12th International Workshop on Software and Compilers for Embedded Systems - SCOPES '09  
The proof of deadlock-freedom fundamentally relies on the computation of invariant properties of the considered BIP model which is carried out by D-Finder and serves as basis for certificate generation  ...  These certificates comprise a proof of deadlock-freedom of the BIP model which can be checked by an independent checker. We use the Coq theorem prover as certificate checker.  ...  Acknowledgements Many thanks to Saddek Bensalem, Marius Bozga, Thanh-Hung Nguyen, and Joseph Sifakis for helpful discussions.  ... 
doi:10.1145/1543820.1543832 fatcat:shh356vvwvgt5e5lauchjdcqhu

The source is the proof

Vivek Haldar, Christian H. Stork, Michael Franz
2002 Proceedings of the 2002 workshop on New security paradigms - NSPW '02  
We challenge the apparent consensus for using bytecode verification and techniques related to proof-carrying code for mobile code security.  ...  We propose an alternative to these two techniques that transports programs at a much higher level of abstraction.  ...  One advantage of PCC is that it has a very small trusted computing base (TCB) -the proof checker. One generic checker can check a large number of properties.  ... 
doi:10.1145/844111.844114 fatcat:xxccnuxqzjfa5jqhot5hn3yhoy

The source is the proof

Vivek Haldar, Christian H. Stork, Michael Franz
2002 Proceedings of the 2002 workshop on New security paradigms - NSPW '02  
We challenge the apparent consensus for using bytecode verification and techniques related to proof-carrying code for mobile code security.  ...  We propose an alternative to these two techniques that transports programs at a much higher level of abstraction.  ...  One advantage of PCC is that it has a very small trusted computing base (TCB) -the proof checker. One generic checker can check a large number of properties.  ... 
doi:10.1145/844102.844114 dblp:conf/nspw/HaldarSF02 fatcat:rgezjvbx6ra6jo7xakao5x6dfi
« Previous Showing results 1 — 15 out of 1,082 results