215 search results - page 8 / 43 » State-Transition Computation Models and Program Correctness ... |
LOPSTR
1994
Springer
13 years 11 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
GI
2009
Springer
14 years 1 days ago
2009
Springer
: Model-checking is a way of testing the correctness of concurrent programs. To do so, a model of the program is proven to match properties and constraints specified by the progra...
EUROPAR
2010
Springer
13 years 5 months ago
2010
Springer
Star Superscalar is a task-based programming model. The programmer starts with an ordinary C program, and adds pragmas to mark functions as tasks, identifying their inputs and outp...
TCS
2010
13 years 5 months ago
2010
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Wei...
ESOP
2001
Springer
13 years 12 months ago
2001
Springer
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...