Sciweavers

19798 search results - page 3932 / 3960
» Is Structural Subtyping Useful
Sort
View
MA
2010
Springer
153views Communications» more  MA 2010»
13 years 6 months ago
Testing quasi-independence for truncation data
Quasi-independence is a common assumption for analyzing truncated data. To verify this condition, we consider a class of weighted log-rank type statistics that include existing te...
Takeshi Emura, Weijing Wang
PPDP
2010
Springer
13 years 6 months ago
Type inference in intuitionistic linear logic
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
Patrick Baillot, Martin Hofmann
PVLDB
2010
110views more  PVLDB 2010»
13 years 6 months ago
Read-Once Functions and Query Evaluation in Probabilistic Databases
Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, q...
Prithviraj Sen, Amol Deshpande, Lise Getoor
RV
2010
Springer
177views Hardware» more  RV 2010»
13 years 6 months ago
Runtime Instrumentation for Precise Flow-Sensitive Type Analysis
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...
Etienne Kneuss, Philippe Suter, Viktor Kuncak
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 6 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
« Prev « First page 3932 / 3960 Last » Next »