797 search results - page 109 / 160 » Eliminating Proofs from Programs |
SOFSEM
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
CIE
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
LPNMR
2009
Springer
14 years 4 months ago
2009
Springer
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
IH
2005
Springer
14 years 3 months ago
2005
Springer
Software protection is an area of active research in which a variety of techniques have been developed to address the issue. Examples of such techniques are software watermarking, ...
UML
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Proponents of aspect orientation have successfully seeded the impression that aspects—like objects—are so fundamental a notion that they should pervade all phases and...