Sciweavers

506 search results - page 29 / 102
» Proving Properties about Lists Using Containers
Sort
View
ICFP
2003
ACM
15 years 9 months ago
An effective theory of type refinements
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
Yitzhak Mandelbaum, David Walker, Robert Harper
IJNSEC
2008
92views more  IJNSEC 2008»
14 years 9 months ago
Re-visiting the One-Time Pad
In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system (One-Time Pad or OTP). It has generally been believed that the perfectly random and uncompressible O...
Nithin Nagaraj, Vivek Vaidya, Prabhakar G. Vaidya
BMCBI
2004
120views more  BMCBI 2004»
14 years 9 months ago
pdb-care (PDB CArbohydrate REsidue check): a program to support annotation of complex carbohydrate structures in PDB files
Background: Carbohydrates are involved in a variety of fundamental biological processes and pathological situations. They therefore have a large pharmaceutical and diagnostic pote...
Thomas Lütteke, Claus-Wilhelm von der Lieth
ICRA
2002
IEEE
144views Robotics» more  ICRA 2002»
15 years 2 months ago
Sensing Nanonewton Level Forces by Visually Tracking Structural Deformations
When assembling MEMS devices or manipulating biological cells it is often beneficial to have information about the force that is being applied to these objects. This force informa...
Michael A. Greminger, Ge Yang, Bradley J. Nelson
POPL
2008
ACM
15 years 10 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan