FSEN
2007
Springer
13 years 6 months ago
2007
Springer
In this paper we study how roles can be added to patterns modelling relationships in Object Oriented programming. Relationships can be introduced in programming languages either by...
FSEN
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. Future communication and computation devices require mechanisms for on-the-fly reconfiguration in their protocol stack to operate in different situations and networks. Th...
FSEN
2007
Springer
13 years 8 months ago
2007
Springer
We formally specify the recent DRM scheme of Nair et al. in the
FSEN
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. We present Trio2Promela, a tool for model checking TRIO specifications by means of Spin. TRIO is a linear-time temporal logic with both future and past operators and a qu...
FSEN
2007
Springer
13 years 8 months ago
2007
Springer
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulae. Test cases are modeled as ground formulae and any spe...
FSEN
2007
Springer
13 years 10 months ago
2007
Springer
We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining dat...
FSEN
2007
Springer
13 years 10 months ago
2007
Springer
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be the proof of congruence and, related to this, enhancements of the bisimul...
FSEN
2007
Springer
13 years 10 months ago
2007
Springer
FSEN
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. A communication protocol consists of a sequence of messages used by peer entities to communicate. Each entity in a network is equipped by at least one protocol stack. Due...
FSEN
2007
Springer
13 years 10 months ago
2007
Springer
This paper shows how a machine-code Hoare logic is used to lift reasoning from the tedious operational model of a machine lana manageable level of abstraction without making simpli...