iDQ

News

  • 2014-06-20: v1.0 released.

Overview

iDQ is an instantiation-based DQBF (Dependency Quantified Boolean Formula) solver.

Downloads

[ idq-1.0.tar.gz ]

See the README and COPYING files for more detailed information on iDQ and its license.

Evaluation

Benchmarks, scripts, and log files that were used in A. Fröhlich, G. Kovásznai, A. Biere, H. Veith. iDQ: Instantiation-Based DQBF Solving. In Proc. Pragmatics of SAT 2014, aff. to SAT 2014, Wien, Austria, 2014.

[ DQBF benchmarks ]

[ QBF benchmarks ]

[ DQBF to DQDIMACS converter ]

[ Evaluation scripts and log files ]

Related Publications

License

iDQ is copyrighted 2014 by Andreas Fröhlich, Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria and Gergely Kovásznai, Formal Methods in Systems Engineering Group, Vienna University of Technology, Wien, Austria under the GNU General Public License Version 3 (GPLV3). You can find more information about GPLV3 in the file COPYING that comes with the sources.

People

Contact

Address:
Gergely Kovásznai
Technische Universität Wien
Institut für Informationssysteme 184/4
Favoritenstraße 9–11
1040 Wien
Austria

Room: HE 03 14 (how to get there)
Phone: +43 (1) 58801 – 740 034
Email: ta.etysrofnull@avok
Web: http://forsyte.at/~kovasznai/

Latest News

Helmut Veith Stipend 2017

Outstanding female students in the field of computer science who pursue (or plan to pursue) one of the master‘s programs in Computer Science at TU Wien taught in English are invited to apply for the Helmut Veith Stipend

Continue reading

Helmut Veith Stipend

The first recipient of the Helmut Veith Stipend for excellent female master’s students in computer science will be presented on March 14 at the following event: "More female students in computer science. Who cares?" Panel discussion with renowned scientists about diversity in STEM Studies March 14, 5:30pm, TU Wien The Helmut Veith Stipend is dedicated […]

Continue reading

WAIT 2016 in Vienna

The third WAIT workshop on induction is held between 17-18 November at the TU Wien. Details are available on the workshop page.

Continue reading

Two papers at POPL’17

Two papers co-authored by researchers from our group have been accepted for POPL’17: “Coming to Terms with Quantified Reasoning” by Simon Robillard, Andrei Voronkov, and Laura Kovacs; and “A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms” by Igor Konnov, Marijana Lazic, Helmut Veith, and Josef Widder

Continue reading

Full news archive