1023 search results - page 59 / 205 » A Formal Method for Program Slicing |
ESOP
2012
Springer
12 years 4 months ago
2012
Springer
A lock placement describes, for each heap location, which lock guards the location, and under what circumstances. We formalize methods for reasoning about lock placements, making p...
SAS
2007
Springer
14 years 2 months ago
2007
Springer
Concurrent programs are difficult to verify because the proof must consider the interactions between the threads. Fine-grained concurrency and heap allocated data structures exacer...
ZUM
1998
Springer
14 years 27 days ago
1998
Springer
We contrast using a notation extension with using a combination of notations. Specifically, we compare the use of an extended dialect of Z [10] with a combination of Z and predicat...
FMCO
2006
Springer
14 years 11 days ago
2006
Springer
In this paper we shall survey and discuss in detail the work on the relative expressiveness of recursion and replication in various process calculi. Namely, CCS, the -calculus, the...
FMICS
2010
Springer
13 years 9 months ago
2010
Springer
Bitwise instructions, loops and indirect data access pose difficult challenges to the verification of microcontroller programs. In particular, it is necessary to show that an indir...