Sciweavers

5634 search results - page 394 / 1127
» About Abstract Classes
Sort
View
FSE
1997
Springer
246views Cryptology» more  FSE 1997»
15 years 10 months ago
Fast Message Authentication Using Efficient Polynomial Evaluation
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
Valentine Afanassiev, Christian Gehrmann, Ben J. M...
157
Voted
ZUM
2000
Springer
15 years 10 months ago
Typechecking Z
Abstract. This paper presents some of our requirements for a Z typechecker: that the typechecker accept all well-typeable formulations, however contrived; that it gather informatio...
Ian Toyn, Samuel H. Valentine, Susan Stepney, Stev...
ICLP
1995
Springer
15 years 10 months ago
Variants of the Event Calculus
Abstract. The Event Calculus is a narrative based formalism for reasoning about actions and change originally proposed in logic programming form by Kowalski and Sergot. In this pap...
Fariba Sadri, Robert A. Kowalski
MPC
1995
Springer
93views Mathematics» more  MPC 1995»
15 years 10 months ago
Extracting Programs with Exceptions in an Impredicative Type System
Abstract. This paper is about exceptions handling using classical techniques of program extraction. We propose an impredicative formalization in the calculus of constructions and w...
Jean-François Monin
DEON
2008
Springer
15 years 8 months ago
Trust and Norms in the Context of Computer Security: A Logical Formalization
Abstract. In this paper we present a logical model of trust in which trust is conceived as an expectation of the truster about some properties of the trustee. A general typology of...
Emiliano Lorini, Robert Demolombe