Analysis of XACML policies with SMT

F Turkmen, J Den Hartog, S Ranise… - … 2015, Held as Part of the …, 2015 - Springer
Abstract The eXtensible Access Control Markup Language (XACML) is an extensible and
flexible XML language for the specification of access control policies. However, the richness …

Ready, set, verify! applying hs-to-coq to real-world Haskell code (experience report)

J Breitner, A Spector-Zabusky, Y Li… - Proceedings of the …, 2018 - dl.acm.org
Good tools can bring mechanical verification to programs written in mainstream functional
languages. We use hs-to-coq to translate significant portions of Haskell's containers library …

Formal analysis of XACML policies using SMT

F Turkmen, J den Hartog, S Ranise, N Zannone - Computers & Security, 2017 - Elsevier
Abstract The eXtensible Access Control Markup Language (XACML) has attracted
significant attention from both industry and academia, and has become the de facto standard …

SMT solvers for Rodin

D Déharbe, P Fontaine, Y Guyot, L Voisin - … Machines, Alloy, B, VDM, and Z, 2012 - Springer
Formal development in Event-B generally requires the validation of a large number of proof
obligations. Some automatic tools exist to automatically discharge a significant part of them …

A new decision procedure for finite sets and cardinality constraints in SMT

K Bansal, A Reynolds, C Barrett, C Tinelli - International Joint Conference …, 2016 - Springer
We consider the problem of deciding the theory of finite sets with cardinality constraints
using a satisfiability modulo theories solver. Sets are a common high-level data structure …

SMT Solvers for Validation of B and Event-B models

S Krings, M Leuschel - … Methods: 12th International Conference, IFM 2016 …, 2016 - Springer
We present an integration of the constraint solving kernel of the ProB model checker with the
SMT solver Z3. We apply the combined solver to B and Event-B predicates, featuring higher …

Solving quantifier-free first-order constraints over finite sets and binary relations

M Cristiá, G Rossi - Journal of Automated Reasoning, 2020 - Springer
In this paper we present a solver for a first-order logic language where sets and binary
relations can be freely and naturally combined. The language can express, at least, any full …

Evaluation of string constraint solvers in the context of symbolic execution

S Kausler, E Sherman - Proceedings of the 29th ACM/IEEE international …, 2014 - dl.acm.org
Symbolic execution tools query constraint solvers for tasks such as determining the
feasibility of program paths. Therefore, the effectiveness of such tools depends on their …

[HTML][HTML] Integrating SMT solvers in Rodin

D Déharbe, P Fontaine, Y Guyot, L Voisin - Science of Computer …, 2014 - Elsevier
Formal development in Event-B generally requires the validation of a large number of proof
obligations. Some tools automatically discharge a significant part of them, thus augmenting …

[HTML][HTML] Designing a verifying compiler: Lessons learned from developing whiley

DJ Pearce, L Groves - Science of Computer Programming, 2015 - Elsevier
An ongoing challenge for computer science is the development of a tool which automatically
verifies programs meet their specifications, and are free from runtime errors such as divide …