• Publications
  • Influence
A survey on model versioning approaches
TLDR
This paper provides a feature‐based characterization of version control systems (VCSs), providing an overview about the state‐of‐the‐art of versioning systems dedicated to modeling artifacts. Expand
  • 192
  • 19
Blocked Clause Elimination for QBF
TLDR
We present novel preprocessing methods for QBF based on blocked clause elimination (BCE), a technique successfully applied in SAT. Expand
  • 108
  • 12
  • PDF
Clause Elimination for SAT and QSAT
TLDR
The famous archetypical NP-complete problem of Boolean satisfiability (SAT) is the problem of determining whether a given propositional logic formula has a solution. Expand
  • 54
  • 8
  • PDF
Comparing Different Prenexing Strategies for Quantified Boolean Formulas
TLDR
The majority of the currently available solvers for quantified Boolean formulas (QBFs) process input formulas only in prenex conjunctive normal form. Expand
  • 48
  • 7
  • PDF
Matching Metamodels with Semantic Systems - An Experience Report
TLDR
We propose the application of ontology and schema matching techniques for automatically exploring semantic correspondences between metamodels, which are currently the modeling language definitions of choice. Expand
  • 55
  • 6
  • PDF
An Introduction to Model Versioning
TLDR
In this tutorial, we give an introduction to the foundations of model versioning, the underlying technologies for processing models and their evolution, as well as the state of the art inmodel versioning. Expand
  • 70
  • 6
  • PDF
A posteriori operation detection in evolving software models
TLDR
Highlights ► Detection of applications of composite operations in evolving software models. Expand
  • 47
  • 6
  • PDF
SAT-Based Synthesis Methods for Safety Specs
TLDR
We propose several new methods to synthesize finite-state systems from safety specifications using decision procedures for the satisfiability of quantified and unquantified Boolean formulas SAT-, QBF- and EPR-solvers. Expand
  • 67
  • 4
  • PDF
A Unified Proof System for QBF Preprocessing
TLDR
In this paper, we introduce a unified proof system based on three simple and elegant quantified resolution asymmetric tautology (QRAT) rules and provide a proof checker for QRAT proofs. Expand
  • 37
  • 4
  • PDF
The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games
TLDR
The QBFGallery 2014 was a competitive evaluation for QBF solvers organized in the context of the FLoC 2014 Olympic Games. Expand
  • 18
  • 4
  • PDF