A calculus of mobile processes, II
Information and Computation
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Integrating Behavioural and Performance Analysis with Topology Information
HICSS '96 Proceedings of the 29th Hawaii International Conference on System Sciences Volume 1: Software Technology and Architecture
Constraint Processing
Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)
Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)
Quantitative static analysis of distributed systems
Journal of Functional Programming
SHReQ: Coordinating Application Level QoS
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Measuring the confinement of probabilistic systems
Theoretical Computer Science - Theoretical foundations of security analysis and design II
A Denotational Approach to the Static Analysis of Cryptographic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
A static analysis of PKI-based systems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
A Denotational Semantics for the π-Calculus
IW-FM'01 Proceedings of the 5th Irish conference on Formal Methods
Q-Automata: Modelling the Resource Usage of Concurrent Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Long-Run Cost Analysis by Approximation of Linear Operators over Dioids
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Long-run cost analysis by approximation of linear operators over dioids
Mathematical Structures in Computer Science
Measuring the speed of information leakage in mobile processes
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
| Hi-index | 0.00 |
We present in this paper, semi-@p, an extension of the @p-calculus that allows processes to query quantitative values of different actions and decide based on those values, whether an action is feasible or not. Our measure of quantity is based on the general notion of semirings. Furthermore, we develop a syntax-directed static analysis for the new language, which captures the properties of name substitution and semiring value retrieval. Such properties allow us to solve quantitative constraints controlling synchronisations in the analysed systems. We provide an example of a cost analysis of communications in a simple adaptive routing algorithm.