Sciweavers

5550 search results - page 40 / 1110
» Different Approaches to Proof Systems
Sort
View
CL
2000
Springer
15 years 10 months ago
Logic Program Synthesis in a Higher-Order Setting
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...
David Lacey, Julian Richardson, Alan Smaill
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
15 years 10 months ago
Indistinguishability Amplification
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner
AISC
2008
Springer
15 years 8 months ago
Automating Side Conditions in Formalized Partial Functions
Abstract. Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions...
Cezary Kaliszyk
SEMWIKI
2008
134views Data Mining» more  SEMWIKI 2008»
15 years 7 months ago
A Real Semantic Web for Mathematics Deserves a Real Semantics
Abstract. Mathematical documents, and their instrumentation by computers, have rich structure at the layers of presentation, metadata and semantics, as objects in a system for form...
Cezary Kaliszyk, Pierre Corbineau, Freek Wiedijk, ...
FMSD
2006
103views more  FMSD 2006»
15 years 6 months ago
Cones and foci: A mechanical framework for protocol verification
We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between ...
Wan Fokkink, Jun Pang, Jaco van de Pol