888 search results - page 57 / 178 » The Power of Temporal Proofs |
TPHOL
2008
IEEE
15 years 4 months ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...
DAC
2007
ACM
15 years 10 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
112
click to vote
PAIRING
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
CADE
2010
Springer
14 years 11 months ago
2010
Springer
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...