1023 search results - page 127 / 205 » A Formal Method for Program Slicing |
116
click to vote
SAS
2009
Springer
15 years 8 months ago
2009
Springer
There are many programming situations where it would be convenient to conceal the meaning of code, or the meaning of certain variables. This can be achieved through program transfo...
113
click to vote
ESOP
2004
Springer
15 years 7 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
114
click to vote
SAS
2010
Springer
14 years 12 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
115
click to vote
TLDI
2003
ACM
15 years 6 months ago
2003
ACM
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected and nondeterministic interactions between threads. Previous work has addresse...
101
click to vote
FM
2006
Springer
15 years 5 months ago
2006
Springer
We propose a new look at one of the most fundamental types of behavioral interfaces: discrete time specifications of communication--directly related to the work of de Alfaro and H...