3228 search results - page 451 / 646 » Computationally Sound Proofs |
139
Voted
CSFW
1998
IEEE
15 years 7 months ago
1998
IEEE
In previous work [16], we give a type system that guarantees that well-typed multithreaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, ho...
131
Voted
PPDP
2000
Springer
15 years 7 months ago
2000
Springer
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
158
Voted
COMPGEOM
1995
ACM
15 years 7 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
135
click to vote
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...
135
Voted
WSC
2007
15 years 5 months ago
2007
The problem of finding the binomial population with the highest success probability is considered when the number of binomial populations is large. A new rigorous indifference zo...