research
∙
08/12/2022
Relational Action Bases: Formalization, Effective Safety Verification, and Invariants (Extended Version)
Modeling and verification of dynamic systems operating over a relational...
share
research
∙
04/25/2022
General Interpolation and Strong Amalgamation for Contiguous Arrays
Interpolation is an essential tool in software verification, where first...
research
∙
10/14/2020
Interpolation and Amalgamation for Arrays with MaxDiff (Extended Version)
In this paper, the theory of McCarthy's extensional arrays enriched with...
research
∙
06/11/2020
Petri Nets with Parameterised Data: Modelling and Verification (Extended Version)
During the last decade, various approaches have been put forward to inte...
research
∙
02/22/2020
Compactly Representing Uniform Interpolants for EUF using (conditional) DAGS
The concept of a uniform interpolant for a quantifier-free formula from ...
research
∙
11/18/2019
Combined Covers and Beth Definability
In ESOP 2008, Gulwani and Musuvathi introduced a notion of cover and exp...
research
∙
06/01/2019
Formal Modeling and SMT-Based Parameterized Verification of Data-Aware BPMN (Extended Version)
We propose DAB -- a data-aware extension of BPMN where the process opera...
research
∙
06/01/2019
Formal Modeling and SMT-Based Parameterized Verification of Data-Aware BPMN
We propose DAB -- a data-aware extension of BPMN where the process opera...
research
∙
05/30/2019
Formal Modeling and SMT-Based Parameterized Verification of Multi-Case Data-Aware BPMN
We propose DAB -- a data-aware extension of the BPMN de-facto standard w...
research
∙
01/04/2019
Free Heyting Algebra Endomorphisms: Ruitenburg's Theorem and Beyond
Ruitenburg's Theorem says that every endomorphism f of a finitely genera...
research
∙
06/29/2018
Verification of Data-Aware Processes via Array-Based Systems (Extended Version)
We study verification over a general model of data-aware processes, to a...
research
∙
06/25/2018
Quantifier Elimination for Database Driven Verification
Running verification tasks in database driven systems requires solving q...
research
∙
04/17/2018
Ruitenburg's Theorem via Duality and Bounded Bisimulations
For a given intuitionistic propositional formula A and a propositional v...
research
∙
03/05/2018
Fixed-point elimination in the Intuitionistic Propositional Calculus (extended version)
It is a consequence of existing literature that least and greatest fixed...
research
∙
12/05/2017
