330 search results - page 32 / 66 » On Modular Termination Proofs of General Logic Programs |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
NMR
2004
Springer
15 years 3 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
191
Voted
POPL
2006
ACM
15 years 10 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
197
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
DAC
2007
ACM
15 years 10 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...