Sciweavers

989 search results - page 9 / 198
» Pebbling and Proofs of Work
Sort
View
FM
1997
Springer
174views Formal Methods» more  FM 1997»
14 years 1 months ago
A Proof Obligation Generator for VDM-SL
In this paper an extension of the IFAD VDM-SL Toolbox with a proof obligation generator is described. Static type checking in VDM is undecidable in general and therefore the type c...
Bernhard K. Aichernig, Peter Gorm Larsen
ISSE
2010
13 years 3 months ago
Coloured Petri net refinement specification and correctness proof with Coq
In this work, we address the formalisation of symmetric nets, a subclass of coloured Petri nets, refinement in COQ. We first provide a formalisation of the net models, and of thei...
Christine Choppy, Micaela Mayero, Laure Petrucci
CADE
2008
Springer
14 years 9 months ago
Proving Bounds on Real-Valued Functions with Computations
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
Guillaume Melquiond
CRYPTO
2011
Springer
180views Cryptology» more  CRYPTO 2011»
12 years 8 months ago
Leakage-Resilient Zero Knowledge
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
Sanjam Garg, Abhishek Jain 0002, Amit Sahai
DIAGRAMS
2004
Springer
14 years 2 months ago
Generating Readable Proofs: A Heuristic Approach to Theorem Proving With Spider Diagrams
An important aim of diagrammatic reasoning is to make it easier for people to create and understand logical arguments. We have worked on spider diagrams, which visually express log...
Jean Flower, Judith Masthoff, Gem Stapleton