330 search results - page 14 / 66 » On Modular Termination Proofs of General Logic Programs |
SAS
2004
Springer
14 years 1 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...
AMAST
2004
Springer
13 years 11 months ago
2004
Springer
This paper presents a new rule for reasoning about method calls in object-oriented programs. It is an adaptation of Hoare's rule of adaptation to the object-oriented paradigm,...
LPNMR
2007
Springer
14 years 2 months ago
2007
Springer
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages...
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input fro...
PLILP
1992
Springer
14 years 1 days ago
1992
Springer
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...