88 search results - page 15 / 18 » The Dependency Triple Framework for Termination of Logic Pro... |
PLPV
2010
ACM
14 years 4 months ago
2010
ACM
This paper presents a resource typing framework for the Guru d-programming language, in which abstractions for various kinds of program resources can be defined. Implemented exam...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
WLP
1997
Springer
13 years 11 months ago
1997
Springer
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
TOOLS
2000
IEEE
13 years 12 months ago
2000
IEEE
It is common to imbed business rules within the code of distributed object systems. When business practices and/or policies change, as they often do, it is difficult if not imposs...