A set solver for finite set relation algebra

DOI10.1007/978-3-030-02149-8_20MaRDI QIDQ1617837zbMATH OpenOpenAlexFDO

Authors Maximiliano Cristiá, Gianfranco Rossi

Publication date 8 November 2018

Full work available at URL https://doi.org/10.1007/978-3-030-02149-8_20

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Solving quantifier-free first-order constraints over finite sets and binary relations
• scientific article; zbMATH DE number 7552282
• Relational constraint solving in SMT
• {log}: A language for programming in logic with finite sets
• Publication:4944864

Cited in

(12)

• Automated proof of Bell-LaPadula security properties
• An automatically verified prototype of the Tokeneer ID station specification
• Solving quantifier-free first-order constraints over finite sets and binary relations
• Relational constraint solving in SMT
• Automated reasoning with restricted intensional sets
• scientific article; zbMATH DE number 3874661 (Why is no real title available?)
• scientific article; zbMATH DE number 1863393 (Why is no real title available?)
• scientific article; zbMATH DE number 1420800 (Why is no real title available?)
• scientific article; zbMATH DE number 7552282 (Why is no real title available?)
• An automatically verified prototype of the Android permissions system
• A Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals
• Integrating cardinality constraints into constraint logic programming with sets

Describes a project that uses

Uses Software

• Coq
• Alloy
• Isabelle/HOL
• Alt-Ergo
• Prover9
• Z/EVES
• RelView
• z3
• ProB
• Why3
• TPTP
• Mace4
• CVC4

This page was built for publication: A set solver for finite set relation algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1617837)