A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
On the Computational Power of Brane Calculi
[chapter]

2006
*
Lecture Notes in Computer Science
*

On

doi:10.1007/11880646_2
fatcat:5s3zk5oi3bazpcpeok6zk4e3hi
*the*other hand, we show*the*impossibility*to*define a "faithful" encoding of Random Access Machines in*the*Mate/Bud/Drip*calculus*,*by*providing a proof of*the*decidability of*the*existence of a divergent ... In [3] a basic*calculus**for*membranes interactions -called Phago/Exo/Pino -is proposed, whose primitives are inspired*by*endocytosis and exocytosis. ... Acknowledgement: We thank*the*anonymous referees*for*their comments. We are indebted*to*Fabien Tarissan*for*his careful comments and precious suggestions. ...##
###
Termination in Impure Concurrent Languages
[chapter]

2010
*
Lecture Notes in Computer Science
*

We illustrate

doi:10.1007/978-3-642-15375-4_23
fatcat:7c75hrnzkzaapiq74h6fjec23u
*the*method in*the*case of a π-*calculus*with both functional and imperative names, and show that, with respect*to*previous approaches*to**termination*, it allows us*to*extend considerably*the*...*The*method can also be applied*to**sequential*languages, e.g., λ-calculi with references. ... We wish*to*thank G. Boudol*for*fruitful discussions in*the*initial stages of this work. ...##
###
19th International Conference on Concurrency Theory

2010
*
Information and Computation
*

*The*conference version of this paper received

*the*best student paper award. Acciai and Boreale present two type systems

*for*

*the*

*pi*-

*calculus*in "Spatial and behavioral types in

*the*

*pi*-

*calculus*." ...

*By*restricting

*to*processes in which every reachable state can

*terminate*via a finite sequence of steps, we obtain

*the*classes normed BPA and normed BPP. ... These games capture fundamental problems in state-based system

*analysis*, such as model-checking of such systems with respect

*to*µ-

*calculus*properties. ...

##
###
A uniform type structure for secure information flow

2002
*
Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '02
*

After presenting a basic typed

doi:10.1145/503272.503281
dblp:conf/popl/HondaY02
fatcat:qc6tgia6jnfy3chtxxacjo2bzq
*calculus**for*secrecy, we demonstrate its usage*by*a sound embedding of*the*dependency core*calculus*(DCC) and*by**the*development of a novel type discipline*for*imperative ... This work reports our experience in using a linear/affine typed 7r-*calculus*tbr*the**analysis*and development of type systems of*programming*languages, focussing on secure information flow*analysis*. ... It suffices*to*use*the*simplest possible pointed observable. Let O3 d~f t_u.D.it.Js and g denote*termination**by**the*standard H-*reduction*. ...##
###
Needed reduction and spine strategies for the lambda calculus

1987
*
Information and Computation
*

A redex R in a lambda-term M is called needed if in every

doi:10.1016/0890-5401(87)90001-0
fatcat:xhhadfu25ncm3dxzvftfi6mnoa
*reduction*of M*to*normal form (some residual of) R is contracted. Among others*the*following results are proved: 1. ... R is needed in M iff R is contracted in*the*leftmost*reduction*path of M. 2. Let W: MO+ M, + Mz --t .._ reduce redexes R,: M, + M" " and have*the*property that Vi.3j> i.R, is needed in M,. ... Section 5 offers some concluding remarks on strictness*analysis*,*sequentiality*, and extensions of l-*calculus*. ...##
###
A π-calculus Process Semantics of Concurrent Idealised ALGOL
[chapter]

1999
*
Lecture Notes in Computer Science
*

We rst present an operational semantics

doi:10.1007/3-540-49019-1_21
fatcat:cqhjzoa5bzbyrnv5gegh4a3e44
*for*CIA, given*by*SOS rules and a contextual form of behavioural equivalence; then a -*calculus*semantics. ... This allows*for*applying*the*-*calculus*theory in proving behavioural properties of CIA phrases. ... This work was partly supported*by*Teilprojekt A3 SAM of SFB 342 \Werkzeuge und Methoden f ur die Nutzung paralleler Rechnerarchitekturen", and*by**the*PROCOPE project 9723064. ...##
###
Petri-net-based deadlock analysis of Process Algebra programs

1994
*
Science of Computer Programming
*

We propose

doi:10.1016/0167-6423(94)00011-5
fatcat:npixu2bimzdgxlvsg45jm5qwmi
*for*a subset of a specific Process Algebra (Milner's*Calculus*of Communicating Systems or CCS), a deadlock detection algorithm which is based on Petri net*reduction*techniques. ... Recent research has been conducted on representing Process Algebra*programs**by*safe Petri nets. ... Acknowledgments We would like*to*thank*the*anonymous referees*for*many insightful comments and suggestions which have significantly improved*the*quality of*the*paper. We would also like*to*thank E.R. ...##
###
Termination in Higher-Order Concurrent Calculi
[chapter]

2010
*
Lecture Notes in Computer Science
*

We propose a type system

doi:10.1007/978-3-642-11623-0_4
fatcat:a62agyyvi5crlcj3zqqg4bifw4
*for**termination*that borrows ideas from*termination*in Rewriting Systems (and following*the*approach*to**termination*in*the*π-*calculus*in [3]). ... We study*termination*of*programs*in concurrent higher-order languages. A higher-order concurrent*calculus*combines features of*the*λ-*calculus*and of*the*message-passing concurrent calculi. ... this should be*the*case*for**the*type system of Section 4. As in [2] ,*reduction**to**the*3SAT problem should allow us*to*show that*the*type inference problem is NP-complete in this case. ...##
###
Refining multiset transformers

1998
*
Theoretical Computer Science
*

*The*

*calculus*thus obtained is applied in

*the*development of a generic "pipelining" transformation, which enables certain

*sequential*compositions

*to*be refined into parallel compositions. ... In this paper, we study a notion of refinement

*for*

*programs*involving parallel and

*sequential*composition operators. and derive a number of

*programming*laws. ... Acknowledgements

*The*authors were partially funded

*by*ESPRIT project 9102 (Coordination). ...

##
###
Analyzing recursive programs using a fixed-point calculus

2009
*
SIGPLAN notices
*

We show that recursive

doi:10.1145/1543135.1542500
fatcat:pxvmoqd23ngnfdbozjhuoqx6ui
*programs*where variables range over finite domains can be effectively and efficiently analyzed*by*describing*the**analysis*algorithm using a formula in a fixed-point*calculus*. ... We exhibit two classes of algorithms of symbolic (BDD-based) algorithms written using this framework-one*for*checking*for*errors in*sequential*recursive Boolean*programs*, and*the*other*to*check*for*errors ... us with*TERMINATOR*benchmarks, and Ella Bounimova and Tom Ball*for*their technical support on*the*tool BEBOP. ...##
###
Analyzing recursive programs using a fixed-point calculus

2009
*
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation - PLDI '09
*

We show that recursive

doi:10.1145/1542476.1542500
dblp:conf/pldi/TorreMP09
fatcat:b7a2tnqcdrdltloiaqzwaebiei
*programs*where variables range over finite domains can be effectively and efficiently analyzed*by*describing*the**analysis*algorithm using a formula in a fixed-point*calculus*. ... We exhibit two classes of algorithms of symbolic (BDD-based) algorithms written using this framework-one*for*checking*for*errors in*sequential*recursive Boolean*programs*, and*the*other*to*check*for*errors ... us with*TERMINATOR*benchmarks, and Ella Bounimova and Tom Ball*for*their technical support on*the*tool BEBOP. ...##
###
Theories of programming: Top-Down and Bottomup and Neeting in the Middle
[chapter]

1999
*
Lecture Notes in Computer Science
*

As an example language, we choose a subset of

doi:10.1007/3-540-48092-7_1
fatcat:7az3p34k45dwrm2cuegrupw7u4
*the**pi*-*calculus*at about*the*level of CCS. ... This aspect of reality is very simply encoded in*the**calculus**by*adding a single new*reduction*step. ...##
###
Theories of Programming: Top-Down and Bottom-Up and Meeting in the Middle
[chapter]

1999
*
Lecture Notes in Computer Science
*

As an example language, we choose a subset of

doi:10.1007/3-540-48119-2_1
fatcat:d3ia6xumcrhw5h75hmpw52lqqu
*the**pi*-*calculus*at about*the*level of CCS. ... This aspect of reality is very simply encoded in*the**calculus**by*adding a single new*reduction*step. ...##
###
A Core Model for Choreographic Programming
[chapter]

2017
*
Lecture Notes in Computer Science
*

Choreographic

doi:10.1007/978-3-319-57666-4_3
fatcat:evaksyhgijhelhmrdp65r6gjnq
*Programming*is a*programming*paradigm*for*building concurrent*programs*that are deadlock-free*by*construction, as a result of*programming*communications declaratively and then synthesising ... We discuss*the*design of CC and argue that it constitutes a canonical model*for*choreographic*programming*. ... DFF-4005-00304 from*the*Danish Council*for*Independent Research. ...##
###
CRYPTOGRAPHIC PROTOCOLS SPECIFICATION AND VERIFICATION TOOLS - A SURVEY

2017
*
ICTACT Journal on Communication Technology
*

Cryptographic protocols cannot guarantee

doi:10.21917/ijct.2017.0226
fatcat:cjtshuv25rbvjggalyzy7xtdkq
*the*secure operations*by*merely using state-of-*the*-art cryptographic mechanisms. Validation of such protocols is done*by*using formal methods. ... Various specialized tools have been developed*for*this purpose and are being used*to*validate real life cryptographic protocols. ... protocols process*calculus*(extension of*pi**calculus*) is used Limitation: solving algorithm sometimes does not*terminate*Scyther It has GUI Verifies bounded and unbounded number of runs ...
« Previous

*Showing results 1 — 15 out of 1,564 results*