Sciweavers

529 search results - page 86 / 106
» Simple Random Logic Programs
Sort
View
ASPLOS
2000
ACM
14 years 2 months ago
Frequent Value Locality and Value-Centric Data Cache Design
By studying the behavior of programs in the SPECint95 suite we observed that six out of eight programs exhibit a new kind of value locality, the frequent value locality, according...
Youtao Zhang, Jun Yang 0002, Rajiv Gupta
FOSSACS
2009
Springer
14 years 4 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
CSL
2007
Springer
14 years 4 months ago
Incorporating Tables into Proofs
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
Dale Miller, Vivek Nigam
HICSS
2005
IEEE
117views Biometrics» more  HICSS 2005»
14 years 3 months ago
MobCon: A Generative Middleware Framework for Java Mobile Applications
While dedicated technologies such as e.g., Sun’s J2ME MIDP offer a simple programming model for mobile applications, appropriate support for modularizing the implementation of t...
Vasian Cepa, Mira Mezini
ENTCS
2002
143views more  ENTCS 2002»
13 years 9 months ago
Collecting Statistics over Runtime Executions
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
Bernd Finkbeiner, Sriram Sankaranarayanan, Henny S...