Sciweavers

963 search results - page 61 / 193
» $M$-Solid Varieties of Languages
Sort
View
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 11 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
BIRTHDAY
2009
Springer
14 years 3 months ago
Web Service Composition via the Customization of Golog Programs with User Preferences
Abstract. We claim that user preferences are a key component of effective Web service composition, and one that has largely been ignored. In this paper we propose a means of speci...
Shirin Sohrabi, Nataliya Prokoshyna, Sheila A. McI...
ASPLOS
2009
ACM
14 years 9 months ago
Early experience with a commercial hardware transactional memory implementation
We report on our experience with the hardware transactional memory (HTM) feature of two pre-production revisions of a new commercial multicore processor. Our experience includes a...
David Dice, Yossi Lev, Mark Moir, Daniel Nussbaum
POPL
2001
ACM
14 years 9 months ago
A generic type system for the Pi-calculus
We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...
Atsushi Igarashi, Naoki Kobayashi
ICSE
2007
IEEE-ACM
14 years 9 months ago
Kato: A Program Slicing Tool for Declarative Specifications
This paper presents Kato, a tool that implements a novel class of optimizations that are inspired by program slicing for imperative languages but are applicable to analyzable decl...
Engin Uzuncaova, Sarfraz Khurshid