148 search results - page 4 / 30 » Formally Analyzing Expected Time Complexity of Algorithms Us... |
DATE
2008
IEEE
14 years 2 months ago
2008
IEEE
Property checking is a promising approach to prove the correctness of today’s complex designs. However, in practice this requires the formulation of formal properties which is a...
FMCO
2007
Springer
14 years 1 months ago
2007
Springer
This paper describes the architecture of costa, an abstract interpretation based cost and termination analyzer for Java bytecode. The system receives as input a bytecode program, (...
FORMATS
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
CCS
2005
ACM
14 years 1 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...