330 search results - page 41 / 66 » On Modular Termination Proofs of General Logic Programs |
AUTOMATICA
2007
13 years 8 months ago
2007
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
STOC
1999
ACM
14 years 6 days ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
POPL
2007
ACM
14 years 8 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
POPL
2010
ACM
13 years 8 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...