6274 search results - page 58 / 1255 » Proofs, Programs, Processes |
TCS
2011
13 years 5 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
FPLE
1995
14 years 1 months ago
1995
Computer science students need mathematical proof skills. At our University, these skills are being taught as part of various mathematics and computer science courses. To test the ...
DKE
2008
13 years 10 months ago
2008
In this work, we present the design and implementation of a system for proof explanation in the Semantic Web, based on defeasible reasoning. Trust is a vital feature for Semantic ...
PPDP
2007
Springer
14 years 4 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
ESOP
2005
Springer
14 years 3 months ago
2005
Springer
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...