Sciweavers

FSEN
2007
Springer
14 years 1 months ago
Relationships Meet Their Roles in Object Oriented Programming
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...
Matteo Baldoni, Guido Boella, Leendert van der Tor...
FSEN
2007
Springer
14 years 3 months ago
Design and Implementation of a Dynamic-Reconfigurable Architecture for Protocol Stack
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...
Mahdi Niamanesh, Sirwah Sabetghadam, Reza Yousefza...
FSEN
2007
Springer
14 years 3 months ago
Nuovo DRM Paradiso: Towards a Verified Fair DRM Scheme
We formally specify the recent DRM scheme of Nair et al. in the
Muhammad Torabi Dashti, Srijith Krishnan Nair, Hug...
FSEN
2007
Springer
14 years 3 months ago
Model Checking Temporal Metric Specifications with Trio2Promela
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...
Domenico Bianculli, Paola Spoletini, Angelo Morzen...
FSEN
2007
Springer
14 years 3 months ago
Test Selection Criteria for Quantifier-Free First-Order Specifications
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...
Marc Aiguier, Agnès Arnould, Pascale Le Gal...
FSEN
2007
Springer
14 years 5 months ago
Regulating Data Exchange in Service Oriented Applications
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...
Alessandro Lapadula, Rosario Pugliese, Francesco T...
FSEN
2007
Springer
14 years 5 months ago
Logical Bisimulations and Functional Languages
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...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
FSEN
2007
Springer
14 years 5 months ago
Action Abstraction in Timed Process Algebra
Michel A. Reniers, Muck van Weerdenburg
FSEN
2007
Springer
14 years 5 months ago
Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata
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...
Mahdi Niamanesh, Rasool Jalili
FSEN
2007
Springer
14 years 5 months ago
Hoare Logic for ARM Machine Code
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...
Magnus O. Myreen, Anthony C. J. Fox, Michael J. C....