PiDuce: a process calculus with native XML datatypes

Authors:
Allen L. Brown;Cosimo Laneve;L. Gregory Meredith
Affiliations:
Microsoft Corporation, Redmond, Washington;Department of Computer Science, University of Bologna, Italy;Harvard Medical School, Boston, USA and Djinnisys Corporation, Seattle
Venue:
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
Year:
2005

Citing 11
Cited 14

Subtyping recursive types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Regular expression types for XML

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Orchestrating Transactions in Join Calculus

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
XDuce: A statically typed XML processing language

ACM Transactions on Internet Technology (TOIT)
CDuce: an XML-centric general-purpose language

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Microsoft BizTalk Server 2004 Developer's Guide

Microsoft BizTalk Server 2004 Developer's Guide
BoPi " A Distributed Machine for Experimenting Web Services Technologies

ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
Semantic Subtyping for the p-Calculus

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Active XML: peer-to-peer data and web services integration

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XPi: a typed process calculus for XML messaging

FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Foundations of web transactions

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Synchrony vs Asynchrony in Communication Primitives

Electronic Notes in Theoretical Computer Science (ENTCS)
Linear forwarders

Information and Computation
XPi: A typed process calculus for XML messaging

Science of Computer Programming
Comparing communication primitives via their relative expressive power

Information and Computation
A typed calculus for querying distributed XML documents

TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Formal analysis of BPMN via a translation into COWS

COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Protocol compatibility notations for service integration testing

Proceedings of the International Workshop on Quality Assurance for Service-Based Applications
Smooth orchestrators

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
On the relative expressive power of asynchronous communication primitives

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
JSCL: a middleware for service coordination

FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
SCC: a service centered calculus

WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
Encoding CDuce in the Cπ-calculus

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A basic contract language for web services

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Strong Normalization in the π-calculus with Intersection and Union Types

Fundamenta Informaticae - Intersection Types and Related Systems ITRS

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop the static and dynamic semantics of PiDuce, a process calculus with XML values, schemas, and pattern matching. PiDuce values include channel names, therefore the structure of values may not reveal anything about their schemas. This is problematic in the pattern matching algorithm because it requires to verify whether a schema of a channel is a subschema of a pattern. Such a verification has exponential cost, in general. In order to reduce the computational complexity of the pattern matching, channel schemas are constrained to occur in tail positions of sequences and to be labelled-determined.