Results 1 
5 of
5
Enhanced Operational Semantics
 ACM Computing Surveys
, 1996
"... designers, implementors, users) must understand it. They can be roughly divided in two main groups. The first group is particularly interested in the behavioural aspects of systems, i.e. in what they do, regardless of how. The other group is concerned with the quantitative aspects of systems, i.e. ..."
Abstract

Cited by 39 (16 self)
 Add to MetaCart
designers, implementors, users) must understand it. They can be roughly divided in two main groups. The first group is particularly interested in the behavioural aspects of systems, i.e. in what they do, regardless of how. The other group is concerned with the quantitative aspects of systems, i.e. how efficiently they perform. The considerations above call for a semantics as usable as possible, with an underlying theory accordingly simple. Operational semantics is such because it describes the essential features that any computing device has. Thus, also final users may grasp the meaning of a definition driven by their experience on their own machine. Moreover, it is sufficient to decorate transition systems with the relevant information to describe in detail complex systems. For example, one can enhance operational semantics to describe aspects of concurrent and distributed processes, that we discuss here more <F23.
A Calculus of Secure Mobile Computations
, 1998
"... The sealcalculus is a distributed process calculus in which locations and movement of computational entities are explicit. The calculus is targeted at secure distributed applications over large scale open networks such as the Internet. Security is addressed by the addition of a finegrain access con ..."
Abstract

Cited by 28 (6 self)
 Add to MetaCart
The sealcalculus is a distributed process calculus in which locations and movement of computational entities are explicit. The calculus is targeted at secure distributed applications over large scale open networks such as the Internet. Security is addressed by the addition of a finegrain access control mechanism. This paper motivates our design choices, presents the syntax and reduction semantics of the calculus, and demonstrates its expressiveness by examples focused on security and management of large distributed systems.
Stochastic PiCalculus With General Distributions
 in Proc. of the 4th Workshop on Process Algebras and Performance Modelling (PAPM '96), CLUT
, 1996
"... In this study we extend stochastic ßcalculus allowing general probabilistic distributions to occur in its prefixes. We show that no additional information is needed in the labels of transitions or in the states of systems to derive an enabling relation between transitions. Enabling is then used to ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this study we extend stochastic ßcalculus allowing general probabilistic distributions to occur in its prefixes. We show that no additional information is needed in the labels of transitions or in the states of systems to derive an enabling relation between transitions. Enabling is then used to compute the residual life times of parallel activities that are not immediately selected when enabled. The policy according to which residual life times are computed is the enabling memory introduced for stochastic Petri nets and also implemented in TIPP through the mechanism of start references. 1 Introduction Many researchers advocate the need of integrating behavioural and performance analysis since the early stages of design of complex systems. This problem is even presented as a challenge for the future of computer science in [11]. The widespread dissemination of distributed systems and the paradigm of mobile computing makes the above integration essential. In fact, a design error whic...
Constructing specific SOS semantics for concurrency via abstract interpretation (Extended Abstract)
"... Chiara Bodei 1 , Pierpaolo Degano, 1 Corrado Priami 2 1 Dipartimento di Informatica, Universit`a di Pisa Corso Italia 40, I56100 Pisa, Italy fchiara,deganog@di.unipi.it 2 Istituto Policattedra, Universit`a di Verona Ca' Vignal 2, Strada Le Grazie 1, I37134 Verona, Italy priami@sci.univr. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Chiara Bodei 1 , Pierpaolo Degano, 1 Corrado Priami 2 1 Dipartimento di Informatica, Universit`a di Pisa Corso Italia 40, I56100 Pisa, Italy fchiara,deganog@di.unipi.it 2 Istituto Policattedra, Universit`a di Verona Ca' Vignal 2, Strada Le Grazie 1, I37134 Verona, Italy priami@sci.univr.it Abstract. Most of the SOS semantics for concurrent systems can be derived by abstracting on the inference rules of a concrete transition system, namely the proved transition system. Besides the standard interleaving semantics we mechanically derive the causal transition system for CCS, whose definition is particularly difficult and paradigmatic. Its rules are shown to coincide with those presented in the literature. Also, the tree of its computations coincide with that obtained by abstracting the computations of the proved transition system. Keywords. Concurrency, abstract interpretation, SOS semantics, causality, noninterleaving descriptions. 1 Introduction We apply the theory of abst...
Logical and Operational Methods in the Analysis of Programs and Systems
"... Interpretation [25], Modalities in Analysis and Verification [30], and Enhanced Operational Semantics [35]. Each section below begins with a presentation of our view of the stateoftheart within the area, and ends with a brief explanation of how the papers in these proceedings enhance our knowledg ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Interpretation [25], Modalities in Analysis and Verification [30], and Enhanced Operational Semantics [35]. Each section below begins with a presentation of our view of the stateoftheart within the area, and ends with a brief explanation of how the papers in these proceedings enhance our knowledge of the area. Integration of Programming Paradigms Programming notions can be expressed in many di erent paradigms  imperative, objectoriented, concurrent, functional, logicprogramming, constraint, etc. It is widely agreed that each programming paradigm has its own merits and is particularly appropriate for expressing certain classes of computation, thus the choice of paradigm can greatly affect the ease of programming. Traditionally, when constructing large scale systems, in particular distributed systems, it is often necessary to use multiple programming styles with disparate programming models, and very often it is necessary to resolve conflicts by low level methods reverting to the lowest...