330 search results - page 25 / 66 » On Modular Termination Proofs of General Logic Programs |
LOPSTR
1998
Springer
15 years 1 months ago
1998
Springer
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
149
click to vote
SLOGICA
2011
14 years 4 months ago
2011
The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attentio...
BIRTHDAY
2009
Springer
15 years 1 months ago
2009
Springer
An extended specification for aspects, and a new verification method based on model checking are used to establish the correctness of strongly-invasive aspects, independently of a...
EMSOFT
2005
Springer
15 years 3 months ago
2005
Springer
This paper is about the modular compilation and distribution of a sub-class of Simulink programs [9] across networks using bounded FIFO queues. The problem is first addressed mat...
ITP
2010
15 years 1 months ago
2010
CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the code-based paradigm, in which the statement ...