797 search results - page 35 / 160 » Eliminating Proofs from Programs |
109
Voted
CORR
2010
Springer
15 years 26 days ago
2010
Springer
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
101
Voted
AAAI
1990
15 years 1 months ago
1990
An equational approach to the synthesis of functional and logic programs is taken. Typically, a target program contains equations that are only true in the standard model of the g...
91
Voted
VMCAI
2009
Springer
15 years 7 months ago
2009
Springer
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...
ENTCS
2007
15 years 21 days ago
2007
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
97
Voted
ISCAPDCS
2004
15 years 2 months ago
2004
We present a scheme to protect mobile code from malicious hosts. We propose a transformation scheme that changes the semantics of a program using pseudorandom I/O scrambling, cond...