We present an executable formalization of the language Promela, the description language for models of the model checker SPIN. This formalization is part of the work for a completely verified model checker (CAVA), but also serves as a useful (and executable!) description of the semantics of the language itself, something that is currently missing. The formalization uses three steps: It takes an...

Intuitively, a collision resistant function (CRF) f is a function for which it is hard to find two inputs s.t. their images collide: If x 6= x′, then w.h.p. f(x) 6= f(x′). It is easy to see that any one-to-one function satisfies this requirement. However, we are interested in functions that are many-to-one, specifically, functions that map long inputs to short inputs, i.e., |f(x)| < |x|. One im...

We have finished a constructive formalization in the theorem prover Coq of the Fundamental Theorem of Calculus, which states that differentiation and integration are inverse processes. In this formalization, we have closely followed Bishop’s work ([4]). In this paper, we describe the formalization in some detail, focusing on how some of Bishop’s original proofs had to be refined, adapted or red...

How tough is a given question-answering problem? Answers to this question differ greatly among different researchers and groups. To begin rectifying this, we start by giving a quick, simple, propaedeutic formalization of a question-answering problem class. This formalization is just a starting point and should let us answer, at least roughly, this question: What is the relative toughness of two...

A formalization of Transmission Effectiveness in Wireless Networks is proposed, taking in account both multi-rate and power-control capabilities. Furthermore, these are the only assumptions made on the hardware. Formalization remains abstract from any particular hardware, MAC, routing protocol used. It is possible to use our formalization as a metric or efficiency measurements. Keywords— Effect...

A modular formalization of the branching time temporal logic CTL∗ is presented. Our formalization subsumes prior formalizations of propositional linear temporal logic (PTL) and computation tree logic (CTL). Moreover, the modularity allows to instantiate our formalization for different formal security models. Validity of axioms and soundness of inference rules in axiomatizations of PTL, UB, CTL,...

In Computer Science, conceptual modelling and formalization are the basis for developing automated systems, "intelligent" or not. It is often taken for granted that formalization is possible and desirable. In the Language/Action perspective, this assumption has been challenged. The Language/Action perspective promotes "communicative action", in the sense of Habermas, as the building block of in...

The Event-based Aspect-Oriented Programming model (EAOP) makes it possible to define pointcuts in terms of sequences of events emitted by the base program. The current formalization of the model relies on a monolithic entity, the monitor, which observes the execution of the base program and executes the actions associated to the matching pointcut. This model is not intrinsically sequential but ...

Commitments provide a basis for understanding interactions in multiagent systems. Successful interoperation relies upon the interacting parties being aligned with respect to their commitments. However, alignment is nontrivial in a distributed system where agents communicate asynchronously and make different observations. We propose a formalization for commitments that ensures alignment despite ...