407 search results - page 67 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
ICALP
2010
Springer
14 years 13 days ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
SAS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
SIGSOFT
2006
ACM
14 years 8 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
ATAL
2009
Springer
14 years 8 days ago
2009
Springer
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
TOPLAS
2002
13 years 7 months ago
2002
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...