4257 search results - page 8 / 852 » The Logical Modularity of Programs |
LOPSTR
2007
Springer
14 years 3 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
TOPLAS
2002
13 years 8 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...
SAS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...
TASE
2008
IEEE
13 years 8 months ago
2008
IEEE
The safety of pointer programs is an important issue in high-assurance software design, and their verification remains a major challenge. Pointer Logic has been proposed to verify...
ICLP
2003
Springer
14 years 2 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...