1 citations · 1 across the 2 of their papers we have counts for
8 papers
: 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…
An Automatically Verified Prototype of the Tokeneer ID Station Specification
Maximiliano Cristiá, Gianfranco Rossi
The Tokeneer project was an initiative set forth by the National Security Agency (NSA, USA) to be used as a demonstration that developing highly secure systems can be made by apply…
Declarative Programming with Intensional Sets in Java Using JSetL
Maximiliano Cristiá, Andrea Fois, Gianfranco Rossi
Intensional sets are sets given by a property rather than by enumerating their elements. In previous work, we have proposed a decision procedure for a first-order logic language wh…