443 search results - page 35 / 89 » Relations in Concurrency |
LPAR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
CONCUR
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
SIGMOD
1997
ACM
14 years 1 months ago
1997
ACM
Data warehouses store materialized views over base data from external sources. Clients typically perform complex read-only queries on the views. The views are refreshed periodical...
FROCOS
2000
Springer
14 years 13 days ago
2000
Springer
This paper describes a high-level implementation of the concurrent constraint functional logic language Curry. The implementation, directed by the lazy pattern matching strategy of...
AIPS
2009
13 years 10 months ago
2009
We provide a theoretical analysis of planning via Petri net unfolding, a novel technique for synthesising parallel plans. Parallel plans are generally valued for their execution f...