Sciweavers

1410 search results - page 78 / 282
» Proving theorems by reuse
Sort
View
FMCAD
2008
Springer
13 years 11 months ago
Mechanized Information Flow Analysis through Inductive Assertions
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...
Warren A. Hunt Jr., Robert Bellarmine Krug, Sandip...
FOGA
1998
13 years 11 months ago
Schemata as Building Blocks: Does Size Matter?
We analyze the schema theorem and the building block hypothesis using a recently derived, exact schemata evolution equation. We derive a new schema theorem based on the concept of...
Christopher R. Stephens, Henri Waelbroeck, R. Agui...
APAL
2006
62views more  APAL 2006»
13 years 10 months ago
Fundamental notions of analysis in subsystems of second-order arithmetic
We develop fundamental aspects of the theory of metric, Hilbert, and Banach spaces in the context of subsystems of second-order arithmetic. In particular, we explore issues having...
Jeremy Avigad, Ksenija Simic
BSL
2004
49views more  BSL 2004»
13 years 10 months ago
Predicative fragments of Frege Arithmetic
Frege Arithmetic (FA) is the second-order theory whose sole non-logical axiom is Hume's Principle, which says that the number of Fs is identical to the number of Gs if and on...
Øystein Linnebo
MLQ
2010
148views more  MLQ 2010»
13 years 8 months ago
Abelian groups and quadratic residues in weak arithmetic
We investigate the provability of some properties of abelian groups and quadratic residues in variants of bounded arithmetic. Specifically, we show that the structure theorem for...
Emil Jerábek