Sciweavers

1830 search results - page 120 / 366
» Functional Programs as Linked Data
Sort
View
175
Voted
ESOP
2000
Springer
15 years 7 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
AFP
2004
Springer
105views Formal Methods» more  AFP 2004»
15 years 8 months ago
Epigram: Practical Programming with Dependent Types
Abstraction and application, tupling and projection: these provide the ‘software engineering’ superstructure for programs, and our familiar type systems ensure that these opera...
Conor McBride
128
Voted
LOPSTR
2001
Springer
15 years 7 months ago
On Deforesting Parameters of Accumulating Maps
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
Kazuhiko Kakehi, Robert Glück, Yoshihiko Futa...
144
Voted
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
16 years 3 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
IFIP
2005
Springer
15 years 8 months ago
Global Internet Routing Forensics: Validation of BGP Paths Using ICMP Traceback
Nearly all network applications rely on the global Internet routing infrastructure to compute routes and deliver packets. Unfortunately, false Internet routes can be maliciously in...
Eunjong Kim, Daniel Massey, Indrajit Ray