163 search results - page 24 / 33 » Computationally Convincing Proofs of Knowledge |
PLDI
2003
ACM
14 years 26 days ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
ENTCS
2008
13 years 7 months ago
2008
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
KR
2000
Springer
13 years 11 months ago
2000
Springer
Though overriding as a single and default mode of inheritance is adequate for most knowledge bases, a large class of applications naturally requires several inheritance modes and ...
SEMWIKI
2008
13 years 9 months ago
2008
Abstract. Semantic wikis have been successfully applied to many problems in knowledge management and collaborative authoring. They are particularly appropriate for scientific and m...
ICTAC
2009
Springer
13 years 5 months ago
2009
Springer
Testing from first-order specifications has mainly been studied for flat specifications, that are specifications of a single software module. However, the specifications of large s...