330 search results - page 14 / 66 » On Modular Termination Proofs of General Logic Programs |
135
click to vote
SAS
2004
Springer
15 years 9 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...
118
click to vote
AMAST
2004
Springer
15 years 7 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,...
130
click to vote
LPNMR
2007
Springer
15 years 10 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...
111
click to vote
LPNMR
2009
Springer
15 years 10 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...
128
Voted
PLILP
1992
Springer
15 years 8 months 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...