## Proceedings of the 1st Workshop on Quantitative Analysis of Software (QA'09) (2009)

### BibTeX

@MISC{Gulwani09proceedingsof,

author = {Sumit Gulwani and Sanjit A. Seshia},

title = {Proceedings of the 1st Workshop on Quantitative Analysis of Software (QA'09)},

year = {2009}

}

### OpenURL

### Abstract

personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission. Acknowledgement For each of the three contributed refereed papers included in these

### Citations

332 | Differential privacy
- Dwork
- 2006
(Show Context)
Citation Context ...elements. For instance we can use the affinity distance to also measure the distance between open convex polyhedra. Markov and Marinchev [7] define a semi-distance for Horn clauses. Eiter and Mannila =-=[3]-=- propose several distance measures for finite sets of points. Our affinity distance works also when the sets are infinite. Monniaux [9] applies abstract interpretation-based techniques to bound the wo... |

53 | F.B.: Belief in information flow
- Clarkson, Myers, et al.
(Show Context)
Citation Context ...istic. From these distributions, many measures of information flow (privacy loss) used in other works can be easily calculated including mutual information [1] and the change in distribution accuracy =-=[2]-=-. First, we present an formal model of programs that produce statistics from a list of survey responses. Second, we formalize the problem and discuss a related problem that is more practical in many s... |

43 | A static analysis for quantifying information flow in a simple imperative language
- Clark, Hunt, et al.
(Show Context)
Citation Context ...on between our approach and theirs. Distances and metric spaces have been object of wide investigation in other fields of computer science as machine learning or computer graphics. De Raedt and Ramon =-=[1]-=- propose to derive a distance from a partial order. They assume the existence of a weight function for the elements of the partial order, which is not clear how it works in the abstract interpretation... |

15 |
A simulation-based proof technique for dynamic information flow
- McCamant, Ernst
- 2007
(Show Context)
Citation Context ...ed as output despite the fact that it would be hidden amongst other samples. McCamant and Ernst provide a dynamic analysis for quantitative information flow using the mutual information formalization =-=[6]-=-. Their analysis provides an upper bound on the flow of information of a singlepath of execution in a program. Their analysis converts a path of execution into a flow network. They then find the max ... |

14 |
Statistical Disclosure Limitation Beyond the Margins
- Slavkovic
- 2004
(Show Context)
Citation Context ...een NN and TNN is zero, meaning that no gain of information is obtained in the example when refining the NN just with types. The refinement with explicit disjunction (also known as trace partitioning =-=[8]-=-) produces an improvement of the 66%. The refinement of DNN with types improves the result by a further 57%. Overall using disjunction and types one obtains a result which is 85% more precise than the... |

10 | Estimating entropy rates with Bayesian confidence intervals
- Kennel, Shlens, et al.
- 2005
(Show Context)
Citation Context ...ation of (iff-identity), and to require that each element has distance 0 from itself, but allowing a zero-distance also for some distinct elements (Def. 1 with (if-identity) is called a pseudo-metric =-=[5]-=-): d(x, y) = 0 ⇐ x = y (if-identity) The rationale behind is that: (i) a distance function gives a quantitative evaluation on how far are two elements in a domain; and (ii) in some cases we want the f... |

6 |
D.: Influence: A quantitative approach for data integrity
- Newsome, Song
- 2008
(Show Context)
Citation Context ...tion setting, where abstract elements may approximate infinite elements. For instance we can use the affinity distance to also measure the distance between open convex polyhedra. Markov and Marinchev =-=[7]-=- define a semi-distance for Horn clauses. Eiter and Mannila [3] propose several distance measures for finite sets of points. Our affinity distance works also when the sets are infinite. Monniaux [9] a... |