119 search results - page 24 / 24 » Assertion Application in Theorem Proving and Proof Planning |
CC
2008
Springer
13 years 5 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
MICAI
2000
Springer
13 years 8 months ago
2000
Springer
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
JFP
2000
13 years 4 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
SMC
2007
IEEE
13 years 11 months ago
2007
IEEE
—Digitization of production factors, including the knowledge for knowledge workers and consumers, opens almost infinite potential to connect persons, systems, processes, enterpri...