We present a tool PEALT that supports the understanding and validation of mechanisms that numerically aggregate trust evidence of potentially heterogenous sources. Such mechanisms are expressed in the policy composition language Peal and subjected to vacuity checking, sensitivity analysis of thresholds, and policy refinement. Verification code is generated by either compiling away numerical references prior to constraint solving or by delegating numerical reasoning to Z3, the common back-end constraint solver of PEALT. The former gives compact diagnostics but restricts value ranges and may be space intensive. The latter generates compact verification code, but gives verbose diagnostics, and may struggle with multiplicative reasoning. We experimentally compare code generation and verification running times of these methods on randomly generated analyses and on a non-random benchmark modeling majority voting. Our findings suggest both methods have complementary value and may scale up well for the analysis of most realistic case studies. © 2014 Springer-Verlag.
CITATION STYLE
Huth, M., & Kuo, J. H. P. (2014). PEALT: An automated reasoning tool for numerical aggregation of trust evidence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8413 LNCS, pp. 109–123). Springer Verlag. https://doi.org/10.1007/978-3-642-54862-8_8
Mendeley helps you to discover research relevant for your work.