401 search results - page 13 / 81 » Types for describing coordinated data structures |
POPL
2007
ACM
14 years 8 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
RV
2010
Springer
13 years 6 months ago
2010
Springer
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the p...
ENTCS
2007
13 years 7 months ago
2007
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
Abstract. We describe and empirically evaluate machine learning methods for the prediction of zinc binding sites from protein sequences. We start by observing that a data set consi...