Markus Wedler

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Frank Seelisch

> Home > Persons > Markus Wedler

Publications

2011
[c25]
- view
  authority control:
- export record
  dblp key:
  - conf/date/PavlenkoWSKDSG11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/date/PavlenkoWSKDSG11
Evgeny Pavlenko, Markus Wedler, Dominik Stoffel, Wolfgang Kunz, Alexander Dreyer, Frank Seelisch, Gert-Martin Greuel:
STABLE: A new QF-BV SMT solver for hard verification problems combining Boolean reasoning with computer algebra. DATE 2011: 155-160
[c24]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/mbmv/PavlenkoWSKDSG11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mbmv/PavlenkoWSKDSG11
Evgeny Pavlenko, Markus Wedler, Dominik Stoffel, Wolfgang Kunz, Alexander Dreyer, Frank Seelisch, Gert-Martin Greuel:
STABLE: A new QF-BV SMT Solver for hard Verification Problems combining Boolean Reasoning with Computer Algebra. MBMV 2011: 51-60
2009
[i1]
- view
  - electronic edition @ dagstuhl.de (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/WedlerPDSSGK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/WedlerPDSSGK09
Markus Wedler, Evgeny Pavlenko, Alexander Dreyer, Frank Seelisch, Dominik Stoffel, Gert-Martin Greuel, Wolfgang Kunz:
Solving hard instances in QF-BV combining Boolean reasoning with computer algebra. Algorithms and Applications for Next Generation SAT Solvers 2009

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.