Sciweavers

125 search results - page 14 / 25
» Bounded Model Checking of Compositional Processes
Sort
View
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
14 years 1 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
14 years 9 months ago
Simultaneous Equation Systems for Query Processing on Continuous-Time Data Streams
We introduce Pulse, a framework for processing continuous queries over models of continuous-time data, which can compactly and accurately represent many real-world activities and p...
Jennie Rogers, Olga Papaemmanouil, Ugur Çet...
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
14 years 7 months ago
Robust Query Processing through Progressive Optimization
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
Volker Markl, Vijayshankar Raman, David E. Simmen,...
LICS
2009
IEEE
14 years 2 months ago
Psi-calculi: Mobile Processes, Nominal Data, and Logic
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...
BPM
2005
Springer
101views Business» more  BPM 2005»
14 years 1 months ago
Service Retrieval Based on Behavioral Specifications and Quality Requirements
: The capability to easily find useful services becomes increasingly critical in several fields. In this paper we argue that, in many situations, the service discovery process shou...
Daniela Grigori, Verónika Peralta, Mokrane ...