Marcello M. Bonsangue

Details der Publikationsliste

Zeitraum

1994 - 2008

Anzahl

48

Co-Autoren

Classes, Object Connectivity, and Observability (2008)

Erika Ábrahám, Marcello M. Bonsangue, Martin Steffen

Abstract. We sketch the observational changes, from the viewpoint of a fully-abstract semantics, when one adds classes to a setting consisting only of objects, as in traditional object calculi. 1

2 (2007)

Marcello M. Bonsangue, Joost N. Kok, Gianluigi Zavattaro

Abstract. We discuss three software architectures for coordination. All architectures are based on agents. Each agent has a local dataspace that contains shared distributed replicated data. The three...

A (2007)

Marcello M. Bonsangue, Joost N. Kok, Maarten Boasson, Edwin De Jong

software architecture for distributed control systems and its transition system semantics

Abramsky Logic for Transition Systems (2007)

M. M. Bonsangue, J. N. Kok, Marcello M. Bonsangue, Joost N. Kok

Towards an infinitary logic of domains: Abramsky logic for transition

Object connectivity and full abstraction for a concurrent calculus of classes (2005)

Erika Ábrahám, Marcello M. Bonsangue, Martin Steffen

Abstract. The concurrent object calculus has been investigated as a core calculus for imperative, object-oriented languages with multithreading and heap-allocated objects. The combination of this...

Object connectivity and full abstraction for a concurrent calculus of classes (2005)

Erika Ábrahám, Marcello M. Bonsangue, Martin Steffen

Abstract. The concurrent object calculus has been investigated as a core calculus for imperative, object-oriented languages with multithreading and heap-allocated objects. The combination of this...

Object connectivity and full abstraction for a concurrent calculus of classes (2005)

Erika Ábrahám, Marcello M. Bonsangue, Martin Steffen

Abstract. The concurrent object calculus has been investigated as a core calculus for imperative, object-oriented languages with multithreading and heap-allocated objects. The combination of this...

Observability, connectivity, and replay in a sequential calculus of classes (2005)

Erika Ábrahám, Marcello M. Bonsangue, Andreas Grüner, Martin Steffen

Abstract. Object calculi have been investigated as semantical foundation for object-oriented languages. Often, they are object-based, whereas the mainstream of object-oriented languages is...

Observability, connectivity, and replay in a sequential calculus of classes (2005)

Erika Ábrahám, Marcello M. Bonsangue, Andreas Grüner, Martin Steffen

Abstract. Object calculi have been investigated as semantical foundation for object-oriented languages. Often, they are object-based, whereas the mainstream of object-oriented languages is...

Object connectivity and full abstraction for a concurrent calculus of classes (2005)

Erika Ábrahám, Marcello M. Bonsangue, Martin Steffen

Abstract. The concurrent object calculus has been investigated as a core calculus for imperative, object-oriented languages with multithreading and heap-allocated objects. The combination of this...

Reo: A channel-based coordination model for component composition (2004)

F. Arbab, M. M. Bonsangue, Farhad Arbab, ...

CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a theme-oriented structure and is grouped into four clusters. Listed below...

Comparing coordination models and architectures using embeddings, Science of Computer Programming 46 (2003)

M. M. Bonsangue, J. N. Kok, G. Zavattaro, Marcello M. Bonsangue, Joost N. Kok, Gianluigi Zavattaro

and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of

Comparing coordination models and architectures using embeddings, Science of Computer Programming 46 (2003)

Marcello M. Bonsangue, Joost N. Kok, Gianluigi Zavattaro

We refine the notion of embedding as formal tool to compare the relative expressive power of different languages, by taking into account also the intended architectures on which the languages are...

Comparing coordination models and architectures using embeddings, Science of Computer Programming 46 (2003)

M. M. Bonsangue, J. N. Kok, G. Zavattaro, Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, ...

and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of

Object Connectivity in a Concurrent Calculus of Classes — Extended Abstract — (2003)

Erika Ábrahám, Marcello M. Bonsangue

Abstract. The concurrent ν-calculus has been investigated as a core calculus for imperative, object-oriented languages with multithreading and heap-allocated objects. From an abstract point of view,...

A logical interface description language for components (2000)

F. Arbab, M. M. Bonsangue, Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, ...

and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of

ABSTRACT A Compositional Model for Con uent Dynamic Data-Flow Networks (2000)

M. M. Bonsangue, Mathematisch Centrum (smc, The Dutch Foundation, Marcello M. Bonsangue

and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of

A coordination language for mobile components (2000)

F. Arbab, M. M. Bonsangue, Issn -x, Farhad Arbab, Marcello M. Bonsangue, ...

and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of

A logical interface description language for components (2000)

F. Arbab, M. M. Bonsangue, Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, ...

and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of

A Compositional Model for Confluent Dynamic Data-Flow Networks (2000)

Marcello M. Bonsangue

. We introduce a state-based language for programming dynamically changing networks which consist of processes that communicate asynchronously. For this language we introduce an operational semantics...

A coordination language for mobile components (2000)

F. Arbab, M. M. Bonsangue, Farhad Arbab, Marcello M. Bonsangue

and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of

Developing object-based distributed system (1999)

Marcello M. Bonsangue, Joost N. Kok, Kaisa Sere, Turku Centre, Computer Science

The OO-action systems formalism is a recent extension of action systems towards object-orientation. An OO-action system models an object-oriented system with active objects. In this paper we make the...

Comparing Coordination Models Based on Shared Distributed Replicated Data (1999)

Marcello Bonsangue And, Marcello M. Bonsangue, Joost N. Kok, Gianluigi Zavattaro

We present three models for a data-oriented coordination language and show several relationships between the models. We consider a distributed model and two centralized shared dataspace models, one...

Developing Object-based Distributed Systems (1999)

Marcello M. Bonsangue, Joost N. Kok, Kaisa Sere

: The OO-action systems formalism is a recent extension of action systems towards object-orientation. An OO-action system models an objectoriented system with active objects. In this paper we make...

Comparing Coordination Models Based on Shared Distributed Replicated Data (1999)

Marcello M. Bonsangue, Joost N. Kok, Gianluigi Zavattaro

We present three models for a data-oriented coordination language and show several relationships between the models. We consider a distributed model and two centralized shared dataspace models, one...

Developing Object-based Distributed Systems (1999)

Marcello M. Bonsangue, Joost N. Kok, Kaisa Sere, Turku Centre, Computer Science

The OO-action systems formalism is a recent extension of action systems towards object-orientation. An OO-action system models an object-oriented system with active objects. In this paper we make the...

An approach to objectorientation in action systems (1998)

Marcello M. Bonsangue, Joost N. Kok, Kaisa Sere, Turku Centre, Computer Science

We extend the action system formalism with a notion of objects that can be active and distributed. With this extension we can model class-based systems as action systems. Moreover, as the introduced...

An approach to objectorientation in action systems (1998)

Marcello M. Bonsangue, Joost N. Kok, Kaisa Sere, Turku Centre, Computer Science

We extend the action system formalism with a notion of objects that can be active and distributed. With this extension we can model class-based systems as action systems. Moreover, as the introduced...

Comparing Software Architectures for Coordination Languages (1998)

Marcello M. Bonsangue, Joost N. Kok, Gianluigi Zavattaro

. We discuss three software architectures for coordination. All architectures are based on agents. Each agent has a local dataspace that contains shared distributed replicated data. The three...

Comparing Software Architectures for Coordination Languages (1998)

Marcello M. Bonsangue, Joost N. Kok, Gianluigi Zavattaro

. We discuss three software architectures for coordination. All architectures are based on agents. Each agent has a local dataspace that contains shared distributed replicated data. The three...

A Software Architecture for Distributed Control Systems and Its Transition System Semantics (1998)

Marcello M. Bonsangue, Joost N. Kok, Maarten Boasson, Edwin De Jong

A software architecture for distributed control systems is presented that is based on a shared data space coordination model. The architecture, named SPLICE, is introduced in two steps. First we give...

Specifying Computations Using Hyper Transition Systems (1997)

Marcello M. Bonsangue, Joost N. Kok

We study hyper transition systems as a formalism to give semantics to specification languages like the specification language of Back's refinement calculus. These languages support both...

Infinitary Domain Logic for Finitary Transition Systems (1997)

Marcello M. Bonsangue, Joost N. Kok

. The Lindenbaum algebra generated by the Abramsky finitary logic is a distributive lattice dual to an SFP-domain obtained as a solution of a recursive domain equation. We extend Abramsky's...

Towards and infinitary logic of domains: Abramsky logic for transition systems (1995)

M. M. Bonsangue, J. N. Kok, Issn -x, Copyright Stichting, Mathematisch Centrum, Marcello M. Bonsangue, ...

and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of

Re-Interpreting the Modal (1995)

Calculus Marcello, Marcello M. Bonsangue, Marta Z. Kwiatkowska

We re-examine the modal ¯-calculus in the light of some classical theory of Boolean algebras and recent results on duality theory for a modal logic with fixed points. We propose interpreting...

Re-Interpreting the Modal µ-Calculus (1995)

Marcello M. Bonsangue, Marta Z. Kwiatkowska

We re-examine the modal ¯-calculus in the light of some classical theory of Boolean algebras and recent results on duality theory for a modal logic with fixed points. We propose interpreting...

The weakest precondition calculus: Recursion and duality (1994)

Marcello M. Bonsangue, Joost N. Kok

Smyth power domain; Egli-Milner power domain; recursion; denotational

Relating Multifunctions and Predicate Transformers through Closure Operators (1994)

Marcello M. Bonsangue, Joost N. Kok

Abstract. We study relations between predicate transformers and multifunctions in a topological setting based on closure operators. We give topological definitions of safety and liveness predicates...

Metric Predicate Transformers: Towards a Notion of Refinement for Concurrency (1994)

Marcello M. Bonsangue, Erik De Vink, Joost N. Kok

For two parallel languages with recursion a compositional weakest precondition semantics is given using two new metric resumption domains. The underlying domains are characterized by domain equations...

The Weakest Precondition Calculus: Recursion and Duality (1994)

Marcello M. Bonsangue, Joost N. Kok

. An extension of Dijkstra's guarded command language is studied, including unbounded demonic choice and a backtrack operator. We consider three orderings on this language: a refinement ordering...