6274 search results - page 615 / 1255 » Proofs, Programs, Processes |
214
click to vote
EUROPAR
1998
Springer
15 years 11 months ago
1998
Springer
This paper illustrates the use of a post-mortem call-graph profiling tool in the analysis of an SQL query processing application written using BSPIib [4]. Unlike other parallel pro...
175
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
This paper studies a logical framework for automated negotiation between two agents. We suppose an agent who has a knowledge base represented by a logic program. Then, we introduc...
203
click to vote
ALGOSENSORS
2006
Springer
15 years 11 months ago
2006
Springer
Programming Wireless Networks of Embedded Systems (WNES) is notoriously difficult and tedious. To simplify WNES programming, we propose Declarative Resource Naming (DRN) to progra...
183
click to vote
AGP
1995
IEEE
15 years 10 months ago
1995
IEEE
The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
290
click to vote
FPCA
1995
15 years 10 months ago
1995
Fold and unfold are general purpose functionals for processing and constructing lists. By using the categorical approach of modelling recursive datatypes as fixed points of funct...