Sciweavers

FORTE
2003
14 years 27 days ago
Behavioural Contracts for a Sound Assembly of Components
Abstract. Component based design is a new methodology for the construction of distributed systems and applications. In this new setting, a system is built by the assembly of (pre)-...
Cyril Carrez, Alessandro Fantechi, Elie Najm
FORTE
2003
14 years 27 days ago
Progressive Solutions to a Parallel Automata Equation
In this paper, we consider the problem of deriving a component X of a system knowing the behavior of the whole system C and the other components A. The component X is derived by s...
Sergey Buffalov, Khaled El-Fakih, Nina Yevtushenko...
FORTE
2003
14 years 27 days ago
Generation of All Counter-Examples for Push-Down Systems
We present a new, on-the-fly algorithm that given a push-down model representing a sequential program with (recursive) procedure calls and an extended finite-state automaton repr...
Samik Basu, Diptikalyan Saha, Yow-Jian Lin, Scott ...
FORTE
2001
14 years 27 days ago
Patterns and Rules for Behavioural Subtyping
Abstract Subtyping relations for object-oriented formalisms describe relationships between super- and subclasses which satisfy the substitutability requirement imposed on types and...
Heike Wehrheim
FORTE
2001
14 years 27 days ago
Towards a Formal Framework for Interoperability Testing
César Viho, Sébastien Barbin, L&eacu...
FORTE
2001
14 years 27 days ago
Stepwise Design with Message Sequence Charts
Use cases are useful in various stages of the software process. They are very often described using text that has to be interpreted by system designers. This could lead to implemen...
Ferhat Khendek, Stephan Bourduas, Daniel Vincent
FORTE
2001
14 years 27 days ago
A Family of Resource-Bound Real-Time Process Algebras
The Algebra of Communicating Shared Resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the ...
Insup Lee, Jin-Young Choi, Hee-Hwan Kwak, Anna Phi...
FORTE
2001
14 years 27 days ago
A Symbolic Semantics and Bisimulation for Full LOTOS
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined; the semantics extends the (infinitely branching) standard semantics by giving meaning to da...
Muffy Calder, Carron Shankland
FORTE
2001
14 years 27 days ago
Implementing a Modal Logic over Data and Processes using XTL
The modal logic FULL is designed to capture strong bisimulation over early symbolic transition systems (STSs) for full LOTOS. It provides a compact way of expressing and verifying ...
Jeremy Bryans, Carron Shankland