203 search results - page 15 / 41 » Iterated Logic Program Updates |
TPHOL
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract. Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which co...
175
click to vote
ECOOP
2009
Springer
15 years 11 months ago
2009
Springer
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...
PE
2010
Springer
14 years 9 months ago
2010
Springer
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
ACSC
2004
IEEE
15 years 2 months ago
2004
IEEE
Table 1 shows the payoff to player one. The same matrix also holds for player two. Player one can gain the maximum 5 points (T = 5) by defection if player two cooperates. However,...
ICTAC
2010
Springer
14 years 8 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...