30 search results - page 5 / 6 » lpar 2005 |
LPAR
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...
LPAR
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
LPAR
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We present new careful semantics within Dung’s theory of argumentation. Under such careful semantics, two arguments cannot belong to the same extension whenever one of ...
LPAR
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We discuss a collection of mechanized formal proofs of symmetric key block encryption algorithms (AES, MARS, Twofish, RC6, Serpent, IDEA, and TEA), performed in an imple...
LPAR
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Earlier we introduced Constraint Lambda Calculi which integrate constraint solving with functional programming for the simple case where the constraint solver produces no...