118 search results - page 11 / 24 » A simple proof of Bazzi's theorem |
SIGSOFT
2003
ACM
16 years 1 months ago
2003
ACM
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
107
click to vote
CADE
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
CSL
2004
Springer
15 years 4 months ago
2004
Springer
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...
87
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We present tight surrogate regret bounds for the class of proper (i.e., Fisher consistent) losses. The bounds generalise the margin-based bounds due to Bartlett et al. (2006). The...
121
click to vote
TPHOL
1997
IEEE
15 years 4 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...