5 citations · 13 across the 7 of their papers we have counts for
6 papers · 1 filter
An Automatically Verified Prototype of a Landing Gear System
Maximiliano Cristiá, Gianfranco Rossi
In this paper we show how (read `setlog'), a Constraint Logic Programming (CLP) language based on set theory, can be used as an automated verifier for B specifications. I…
A Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals
Maximiliano Cristiá, Gianfranco Rossi
In this paper we extend a decision procedure for the Boolean algebra of finite sets with cardinality constraints () to a decision procedure for $\m…
: Set Formulas as Programs
Maximiliano Cristiá, Gianfranco Rossi
is a programming language at the intersection of Constraint Logic Programming, set programming and declarative programming. But is also a satisfiability solver…
: Applications to Software Specification, Prototyping and Verification
Maximiliano Cristiá, Gianfranco Rossi
This document shows how Z specifications can be translated into and, later, on how can be used to run simulations and automated proofs. This can help users of o…
Integrating Cardinality Constraints into Constraint Logic Programming with Sets
Maximiliano Cristiá, Gianfranco Rossi
Formal reasoning about finite sets and cardinality is an important tool for many applications, including software verification, where very often one needs to reason about the size…
Proof Automation in the Theory of Finite Sets and Finite Set Relation Algebra
Maximiliano Cristiá, Ricardo D. Katz, Gianfranco Rossi
{log} ('setlog') is a satisfiability solver for formulas of the theory of finite sets and finite set relation algebra (FSTRA). As such, it can be used as an automated theorem prove…