443 search results - page 35 / 89 » Relations in Concurrency |
172
click to vote
LPAR
2005
Springer
16 years 4 days 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...
161
click to vote
CONCUR
2000
Springer
15 years 11 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...
187
click to vote
SIGMOD
1997
ACM
15 years 11 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...
221
click to vote
FROCOS
2000
Springer
15 years 10 months 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...
166
click to vote
AIPS
2009
15 years 7 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...