Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
Abstract interpretation and application to logic programs
Journal of Logic Programming
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Concurrent constraint programming: towards probabilistic abstract interpretation
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principles of Program Analysis
Principles of Program Analysis
Stochastic Petri Nets: An Introduction to the Theory
ACM SIGMETRICS Performance Evaluation Review - Special issue on Stochastic Petri Nets
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Journal of Computer Security - Special issue on WITS'02
Continuous-Time Probabilistic KLAIM
Electronic Notes in Theoretical Computer Science (ENTCS)
Assessing security threats of looping constructs
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
Electronic Notes in Theoretical Computer Science (ENTCS)
An Interval-based Abstraction for Quantifying Information Flow
Electronic Notes in Theoretical Computer Science (ENTCS)
A Semiring-based Quantitative Analysis of Mobile Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Risk assessment of security threats for looping constructs
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
Abstract interpretation for worst and average case analysis
Program analysis and compilation, theory and practice
A distributed and probabilistic concurrent constraint programming language
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Probabilistic linda-based coordination languages
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Hi-index | 0.00 |
We introduce a quantitative approach to the analysis of distributed systems which relies on a linear operator based network semantics. A typical problem in a distributed setting is how information propagates through a network, and a typical qualitative analysis is concerned with establishing whether some information will eventually be transmitted from one node to another node in the network. The quantitative approach we present allows us to obtain additional information such as an estimation of the probability that some data is transmitted within a given interval of time. We formalise situations like this using a probabilistic version of a process calculus which is the core of KLAIM, a language for distributed and mobile computing based on interactions through distributed tuple spaces. The analysis we present exploits techniques based on Probabilistic Abstract Interpretation and is characterised by compositional aspects which greatly simplify the inspection of the nodes interaction and the detection of the information propagation through a computer network.