888 search results - page 88 / 178 » The Power of Temporal Proofs |
165
click to vote
POPL
2001
ACM
15 years 10 months ago
2001
ACM
We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, we manage to prove the log-concavity of the generalized Marcum Q-function Qν (a, b) with respect to its order ν on [1, ∞). The proof relies on a powerful math...
AB
2007
Springer
15 years 4 months ago
2007
Springer
Whenever a programmer writes a loop, or a mathematician does a proof by induction, an invariant is involved. The discovery and understanding of invariants often underlies problem s...
ASM
2005
ASM
15 years 3 months ago
2005
ASM
AsmL is a novel executable specification language based on the theory of State Machines (ASMs). It represents one of the most powerful practical engines to write and execute ASMs...
WAOA
2004
Springer
15 years 3 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...