Sciweavers

3736 search results - page 300 / 748
» Generative Programming
Sort
View
250
Voted
POPL
2007
ACM
16 years 4 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
157
Voted
CADE
2007
Springer
16 years 4 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
WCFLP
2005
ACM
15 years 9 months ago
Translating curry to haskell system demo
There exist several implementations of the functional logic language Curry: a transformation to Prolog and implementations of machines for C and Java. We show that there are many ...
Bernd Braßel, Frank Huch
SP
2003
IEEE
107views Security Privacy» more  SP 2003»
15 years 9 months ago
Anomaly Detection Using Call Stack Information
The call stack of a program execution can be a very good information source for intrusion detection. There is no prior work on dynamically extracting information from call stack a...
Henry Hanping Feng, Oleg M. Kolesnikov, Prahlad Fo...
ENTCS
2006
109views more  ENTCS 2006»
15 years 4 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone