Resource Usage Analysis for the Pi-Calculus

Kobayashi, Naoki; Suenaga, Kohei; Wischik, Lucian

doi:10.2168/lmcs-2(3:4)2006

Cited by 25 publications

(21 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Type systems, possibly based on behavioural types (see e.g. [12,16,17]), could permit to express and enforce policies of interest for (web) services for, e.g., disciplining resources usage, constraining the sequences of messages accepted by services, ensuring service interoperability and compositionality, guaranteeing absence of deadlock in service composition, checking that interaction obeys a given protocol.…”

Section: Discussionmentioning

confidence: 99%

A Calculus for Orchestration of Web Services

Lapadula

Pugliese

Tiezzi

2007

Programming Languages and Systems

159

158

View full text Add to dashboard Cite

Abstract. We introduce COWS (Calculus for Orchestration of Web Services), a new foundational language for SOC whose design has been influenced by WS-BPEL, the de facto standard language for orchestration of web services. COWS combines in an original way a number of ingredients borrowed from wellknown process calculi, e.g. asynchronous communication, polyadic synchronization, pattern matching, protection, delimited receiving and killing activities, while resulting di«erent from any of them. Several examples illustrates COWS peculiarities and show its expressiveness both for modelling imperative and orchestration constructs, e.g. web services, flow graphs, fault and compensation handlers, and for encoding other process and orchestration languages.

show abstract

Section: Discussionmentioning

confidence: 99%

A Calculus for Orchestration of Web Services

Lapadula

Pugliese

Tiezzi

2007

Programming Languages and Systems

159

158

View full text Add to dashboard Cite

show abstract

“…Kobayashi, Suenaga and Wischik develop a technique that is very close to the one in this paper [16]. In particular, they extend pi-calculus with primitives for creating and using resources and verify whether a program conforms with resource usage declarations (that may be also automatically inferred).…”

Section: Related Workmentioning

confidence: 99%

Towards the Typing of Resource Deployment

Giachino

Laneve

2014

Leveraging Applications of Formal Methods, Verification and Validation. Specialized Techniques and Applications

View full text Add to dashboard Cite

Abstract. In cloud computing, resources as files, databases, applications, and virtual machines may either scale or move from one machine to another in response to load increases and decreases (resource deployment). We study a type-based technique for analysing the deployments of resources in cloud computing. In particular, we design a type system for a concurrent object-oriented language with dynamic resource creations and movements. The type of a program is behavioural, namely it expresses the resource deployments over periods of (logical) time. Our technique admits the inference of types and may underlie the optimisation of the costs and consumption of resources.

show abstract

“…Some work on static analysis of concurrent systems expressed in pi-calculus is also relevant, in the sense that it addresses the question (among others) of whether attempted uses of a resource are consistent with its state. Kobayashi et al have developed a generic framework [33] including a verification tool [34] in which to define type systems for analyzing various behavioural properties including sequences of resource uses [35]. In some of this work, types are themselves abstract processes, and therefore in some situations resemble our session types.…”

Section: Related Workmentioning

confidence: 99%

Modular session types for distributed object-oriented programming

et al. 2010

View full text Add to dashboard Cite

Session types allow communication protocols to be specified typetheoretically so that protocol implementations can be verified by static type-checking. We extend previous work on session types for distributed object-oriented languages in three ways. (1) We attach a session type to a class definition, to specify the possible sequences of method calls. (2) We allow a session type (protocol) implementation to be modularized, i.e. partitioned into separatelycallable methods. (3) We treat session-typed communication channels as objects, integrating their session types with the session types of classes. The result is an elegant unification of communication channels and their session types, distributed object-oriented programming, and a form of typestates supporting non-uniform objects, i.e. objects that dynamically change the set of available methods. We define syntax, operational semantics, a sound type system, and a correct and complete type checking algorithm for a small distributed class-based object-oriented language. Static typing guarantees that both sequences of messages on channels, and sequences of method calls on objects, conform to type-theoretic specifications, thus ensuring type-safety. The language includes expected features of session types, such as delegation, and expected features of object-oriented programming, such as encapsulation of local state. We also describe a prototype implementation as an extension of Java.

show abstract

Resource Usage Analysis for the Pi-Calculus

Cited by 25 publications

References 31 publications

A Calculus for Orchestration of Web Services

A Calculus for Orchestration of Web Services

Towards the Typing of Resource Deployment

Modular session types for distributed object-oriented programming

Contact Info

Product

Resources

About