%0 Conference Proceedings
%T Probabilistic Analysis of the Quality Calculus
%+ Department of Applied Mathematics and Computer Science [Lyngby] (DTU Compute)
%A Nielson, Hanne, Riis
%A Nielson, Flemming
%Z Part 8: Session 7: Distribution and Concurrency
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 15th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOOODS) / 33th International Conference on Formal Techniques for Networked and Distributed Systems (FORTE)
%C Florence, Italy
%Y Dirk Beyer
%Y Michele Boreale
%I Springer
%3 Formal Techniques for Distributed Systems
%V LNCS-7892
%P 258-272
%8 2013-06-03
%D 2013
%R 10.1007/978-3-642-38592-6_18
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X We consider a fragment of the Quality Calculus, previously introduced for defensive programming of software components such that it becomes natural to plan for default behaviour in case the ideal behaviour fails due to unreliable communication.This paper develops a probabilistically based trust analysis supporting the Quality Calculus. It uses information about the probabilities that expected input will be absent in order to determine the trustworthiness of the data used for controlling the distributed system; the main challenge is to take accord of the stochastic dependency between some of the inputs. This takes the form of a relational static analysis dealing with quantitative information.
%G English
%2 https://inria.hal.science/hal-01515243/document
%2 https://inria.hal.science/hal-01515243/file/978-3-642-38592-6_18_Chapter.pdf
%L hal-01515243
%U https://inria.hal.science/hal-01515243
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-DISCOTEC
%~ IFIP-LNCS-7892