97 search results - page 18 / 20 » Reasoning about Partially Observed Actions |
ESOP
2010
Springer
14 years 4 months ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
FOSSACS
2001
Springer
13 years 12 months ago
2001
Springer
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...
AGP
1996
IEEE
13 years 11 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
ICAI
2003
13 years 8 months ago
2003
– Existing team training software often requires that trainees be organized as physical teams and the members of the same team be trained at the same time. To demonstrate that te...
JUCS
2006
13 years 7 months ago
2006
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...