This article presents Pardinus, an extension of the popular Kodkod relational model finder
with linear temporal logic (including past operators), to simplify the analysis of dynamic …

This paper concerns the scalability challenges of symbolic abstraction: given a formula ϕ in
a logic L and an abstract domain A, find a most precise element in the abstract domain that …

Alloy is a textual modeling language for structures and behaviors of software designs. One
of the reasons for Alloy to become a popular light-weight formal method is its support for …

Formal analysis is an invaluable tool for software engineers, yet state-of-the-art formal
analysis techniques suffer from well-known limitations in terms of scalability. In particular …

Writing declarative models has numerous benefits, ranging from automated reasoning and
correction of design-level properties before systems are built, to automated testing and …

Writing declarative models has numerous benefits, ranging from automated reasoning and
correction of design-level properties before systems are built, to automated testing and …

Propositional model enumeration, or All-SAT, is the task to record all models of a
propositional formula. It is a key task in software and hardware verification, system …

Finite model finders give users the ability to specify properties of a system in mathematical
logic and then automatically find concrete examples, called solutions, that satisfy the …

Expressing system specifications using Computation Tree Logic (CTL) formulas, formalising
programs using Kripke structures, and then model checking the system is an established …

Software models help improve the reliability of software systems: models can convey
requirements, and can analyze design and implementation properties. A key strength of …