118 search results - page 11 / 24 » A Simple Proof of Miller-Yu Theorem |
109
click to vote
CADE
1990
Springer
15 years 3 months ago
1990
Springer
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
SIGSOFT
2003
ACM
16 years 13 days 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 ...
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 3 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...
ICML
2009
IEEE
16 years 15 days 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...