Sciweavers

1121 search results - page 221 / 225
» Building Formal Requirements Models for Reliable Software
Sort
View
FSTTCS
2003
Springer
15 years 2 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
ECOOP
2000
Springer
15 years 1 months ago
Copying and Comparing: Problems and Solutions
In object oriented programming, it is sometimes necessary to copy objects and to compare them for equality or inequality. We discuss some of the issues involved in copying and comp...
Peter Grogono, Markku Sakkinen
SIGADA
2001
Springer
15 years 1 months ago
Electronic maneuvering board and dead reckoning tracer decision aid for the officer of the deck
Statement and AbstractProblem Statement and AbstractProblem Statement and AbstractProblem Statement and Abstract The U.S. Navy currently bases the majority of our contact managemen...
Kenneth L. Ehresman, Joey L. Frantzen
PLDI
2003
ACM
15 years 2 months ago
Bug isolation via remote program sampling
We propose a low-overhead sampling infrastructure for gathering information from the executions experienced by a program’s user community. Several example applications illustrat...
Ben Liblit, Alexander Aiken, Alice X. Zheng, Micha...
SIGGRAPH
1992
ACM
15 years 1 months ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder