Sciweavers

122 search results - page 16 / 25
» Computing Properties of Numerical Imperative Programs by Sym...
Sort
View
ICALP
2005
Springer
16 years 15 days ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
CP
2003
Springer
16 years 6 days ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
FOSSACS
2004
Springer
16 years 11 days ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
SC
2003
ACM
16 years 7 days ago
SCALLOP: A Highly Scalable Parallel Poisson Solver in Three Dimensions
SCALLOP is a highly scalable solver and library for elliptic partial differential equations on regular block-structured domains. SCALLOP avoids high communication overheads algor...
Gregory T. Balls, Scott B. Baden, Phillip Colella
IWQOS
2004
Springer
16 years 10 days ago
Service availability: a new approach to characterize IP backbone topologies
— Traditional SLAs, defined by average delay or packet loss, often camouflage the instantaneous performance perceived by end-users. We define a set of metrics for service avai...
Ram Keralapura, Chen-Nee Chuah, Gianluca Iannaccon...