Sciweavers

367 search results - page 4 / 74
» Relating Full Abstraction Results for Different Programming ...
Sort
View
ICFP
2003
ACM
15 years 9 months ago
A theory of aspects
This paper define the semantics of MinAML, an idealized aspect-oriented programming language, by giving a typedirected translation from its user-friendly external language to its ...
David Walker, Steve Zdancewic, Jay Ligatti
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
15 years 10 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
ESOP
2007
Springer
15 years 4 months ago
Interprocedurally Analysing Linear Inequality Relations
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
Helmut Seidl, Andrea Flexeder, Michael Petter
ICALP
2007
Springer
15 years 4 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
IMCSIT
2010
14 years 7 months ago
Quality Benchmarking Relational Databases and Lucene in the TREC4 Adhoc Task Environment
The present work covers a comparison of the text retrieval qualities of open source relational databases and Lucene, which is a full text search engine library, over English docume...
Ahmet Arslan, Ozgur Yilmazel