activity
20202025
most citedA Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals

2 citations · 8 across the 8 of their papers we have counts for

collaborators
Showing cs.LOShow all

7 papers · 1 filter

cs.LO2025

Encoding and Reasoning about Arrays in Constraint Logic Programming with Sets

Maximiliano Cristiá, Gianfranco Rossi

We encode arrays as functions which, in turn, are encoded as sets of ordered pairs. The set cardinality of each of these functions coincides with the length of the array it is repr…

cs.LO2022★ 2 cited

A Set-Theoretic Decision Procedure for Quantifier-Free, Decidable Languages Extended with Restricted Quantifiers

Maximiliano Cristiá, Gianfranco Rossi

Let be the language of first-order, decidable theory . Consider the language, , that extends $\mat…

cs.LO2022★ 1 cited

Combining Type Checking and Set Constraint Solving to Improve Automated Software Verification

Maximiliano Cristiá, Gianfranco Rossi

In this paper we show how prescritive type checking and constraint solving can be combined to increase automation during software verification. We do so by defining a type system a…

cs.LO2021★ 2 cited

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…

cs.LO2021★ 1 cited

: 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…

cs.LO2021

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…

cs.LO2021

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…