1818 search results - page 252 / 364 » Granularity-Adaptive Proof Presentation |
110
Voted
CRYPTO
2003
Springer
15 years 8 months ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
127
Voted
FM
2003
Springer
15 years 8 months ago
2003
Springer
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...
134
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
143
click to vote
SAS
2009
Springer
16 years 4 months ago
2009
Springer
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
134
Voted
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...