Sciweavers

672 search results - page 118 / 135
» On the Expressive Power of the Loop Language
Sort
View
JFP
2006
78views more  JFP 2006»
15 years 1 months ago
Sound and complete models of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...
Matthias Blume, David A. McAllester
213
Voted
ML
2011
ACM
308views Machine Learning» more  ML 2011»
14 years 8 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
120
Voted
SAINT
2005
IEEE
15 years 7 months ago
Adaptive Semantic Support Provisioning in Mobile Internet Environments
The Mobile Internet scenario encourages the design and development of context-aware applications that provide results depending on context information, such as the relative positi...
Antonio Corradi, Rebecca Montanari, Alessandra Ton...
119
Voted
ICFP
2007
ACM
16 years 1 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
AOSD
2009
ACM
15 years 8 months ago
Dependent advice: a general approach to optimizing history-based aspects
Many aspects for runtime monitoring are history-based: they contain pieces of advice that execute conditionally, based on the observed execution history. History-based aspects are...
Eric Bodden, Feng Chen, Grigore Rosu