Sciweavers

942 search results - page 44 / 189
» Process Algebraic Non-product-forms
Sort
View
FSTTCS
2010
Springer
14 years 7 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
TDM
2004
203views Database» more  TDM 2004»
14 years 11 months ago
Relational Algebra: Mother Tongue - XQuery: Fluent
This work may be seen as a further proof of the versatility of the relational database model. Here, we add XQuery to the catalog of languages which RDBMSs are able to "speak&...
Torsten Grust, Jens Teubner
PVM
1997
Springer
15 years 1 months ago
Performance of CAP-Specified Linear Algebra Algorithms
The traditional approach to the parallelization of linear algebra algorithms such as matrix multiplication and LU factorization calls for static allocation of matrix blocks to proc...
Marc Mazzariol, Benoit A. Gennart, Vincent Messerl...
CSUR
1999
137views more  CSUR 1999»
14 years 9 months ago
Algebraic Methods for Specification and Formal Development of Programs
with functions over those sets. This level of abstraction is commensurate with the view that the correctness of the input/output behaviour of a program takes precedence over all it...
Donald Sannella, Andrzej Tarlecki
VLDB
1994
ACM
128views Database» more  VLDB 1994»
15 years 1 months ago
An Algebraic Approach to Rule Analysis in Expert Database Systems
Expert database systems extend the functionality of conventional database systems by providing a facility for creating and automatically executing Condition-Action rules. While Con...
Elena Baralis, Jennifer Widom