1485 search results - page 43 / 297 » Whole Program Paths |
ICS
2011
Tsinghua U.
13 years 1 months ago
2011
Tsinghua U.
Applications must scale well to make efficient use of even medium-scale parallel systems. Because scaling problems are often difficult to diagnose, there is a critical need for sc...
ACTA
2010
13 years 10 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
IAT
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper, we tackle learning in distributed systems and the fact that learning does not necessarily involve the participation of agents directly in the inductive process itse...
ECAI
2006
Springer
13 years 12 months ago
2006
Springer
We use a lexicographical preference order on the problem space to combine solution synthesis with conflict learning. Given two preferred solutions of two subproblems, we can either...
LOPSTR
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...