3342 search results - page 487 / 669 » Automating Abstract Interpretation |
LACL
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Kanazawa has shown that k-valued classical categorial grammars have the property of finite elasticity [1], which is a sufficient condition for learnability. He has also ...
84
Voted
LPAR
2005
Springer
15 years 6 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
15 years 6 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...
87
Voted
LPAR
2005
Springer
15 years 6 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...
100
Voted
LPAR
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We describe an environment that allows the users of the Theorema system to flexibly control aspects of computer-supported proof development. The environment supports the...