scholarly journals Static and dynamic typing for the termination of mobile processes

Author(s):  
Romain Demangeon ◽  
Daniel Hirschkoff ◽  
Davide Sangiorgi
2015 ◽  
Vol 50 (9) ◽  
pp. 289-301 ◽  
Author(s):  
Pablo Buiras ◽  
Dimitrios Vytiniotis ◽  
Alejandro Russo

2007 ◽  
Vol 2 (1) ◽  
Author(s):  
Christian P. Kunze ◽  
Sonja Zaplata ◽  
Winfried Lamersdorf

1991 ◽  
Vol 20 (362) ◽  
Author(s):  
Jens Palsberg ◽  
Michael I. Schwartzbach

<p>This paper summarizes three discussions conducted at the ECOOP'91 W5 Workshop on ''Types, Inheritance, and Assignments'' Tuesday July 16, 1991 in Geneva, Switzerland, organized by the authors.</p><p> </p><p>The three discussions were entitled ''Classes versus Types'', ''Static versus Dynamic Typing'', and ''Type Inference''. All these topics were assumed to be volatile and controversial; indeed, a broad range of diverging opinions were represented. However, much superficial disagreement seemed to be rooted in confusions about terminology. When such issues were resolved, there appeared a consensus about basic definitions and the - often incompatible - choices that one is at liberty to make. This clarification, which we hope to have described below, was the most important achievement of the workshop.</p>


2018 ◽  
Vol 25 (6) ◽  
pp. 589-606
Author(s):  
Marat M. Abbas ◽  
Vladimir A. Zakharov

Mathematical models of distributed computations, based on the calculus of mobile processes (π-calculus) are widely used for checking the information security properties of cryptographic protocols. Since π-calculus is Turing-complete, this problem is undecidable in general case. Therefore, the study is carried out only for some special classes of π-calculus processes with restricted computational capabilities, for example, for non-recursive processes, in which all runs have a bounded length, for processes with a bounded number of parallel components, etc. However, even in these cases, the proposed checking procedures are time consuming. We assume that this is due to the very nature of the π -calculus processes. The goal of this paper is to show that even for the weakest model of passive adversary and for relatively simple protocols that use only the basic π-calculus operations, the task of checking the information security properties of these protocols is co-NP-complete.


2011 ◽  
pp. 1625-1632
Author(s):  
Volker Derballa ◽  
Key Pousttchi

IT support for knowledge management (KM) is a widely discussed issue. Whereas an overemphasis on technology is often criticized, the general consensus is that a well-balanced combination of technical and social approaches can be a rewarding departure (Alavi & Leidner, 1999). The usage of knowledge management systems (KMSs) (i.e., information systems including for example data warehouse techniques and artificial intelligence tools) is seen as a factor that can beneficially support different KM processes (Frank, 2001; Wiig, 1995). Due to the fact that an increasingly large proportion of work is not conducted in the context of stationary workplaces anymore, it becomes necessary to make KMSs available to those mobile workers (Rao, 2002; Sherman, 1999). Considering the different technological infrastructure in the stationary, as well as the mobile context, a KMS that so far is only available at a stationary workplace cannot simply become mobile without any changes. Further, the aspect of mobility implies specific design requirements for KMS. Taking together the rapid developments in the field of technology, allowing more and more mobile processes to be potentially supported through mobile KMS, as well as the current social and occupational developments, resulting in more mobile workplaces and business processes (Gruhn & Book, 2003), the relevance of mobile KM can be expected to increase in the future.


Author(s):  
Guy L. Steele ◽  
Xiaowei Shen ◽  
Josep Torrellas ◽  
Mark Tuckerman ◽  
Eric J. Bohm ◽  
...  
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document