Helmut Veith

From MaRDI portal
Person:234696

Available identifiers

zbMath Open veith.helmutDBLPv/HelmutVeithWikidataQ23707622 ScholiaQ23707622MaRDI QIDQ234696

List of research outcomes





PublicationDate of PublicationType
Pebble-intervals automata and \(\text{FO}^2\) with two orders2020-07-27Paper
https://portal.mardi4nfdi.de/entity/Q52270612019-08-05Paper
Introduction to model checking2018-07-20Paper
On the automated verification of web applications with embedded SQL2018-07-18Paper
Parameterized model checking of rendezvous systems2018-06-01Paper
Extending \(\mathcal{ALCQIO}\) with trees2018-04-23Paper
Local linearizability for concurrent container-type data structures2018-03-21Paper
On compiling Boolean circuits optimized for secure multi-party computation2018-02-14Paper
Complexity and resource bound analysis of imperative programs using difference constraints2017-08-15Paper
Monadic second order finite satisfiability and unbounded tree-width2017-07-19Paper
Datalog LITE2017-06-13Paper
Empirical software metrics for benchmarking of verification tools2017-05-15Paper
On the structure and complexity of rational sets of regular languages2017-02-21Paper
Languages represented by Boolean formulas2016-06-01Paper
Counterexample-guided abstraction refinement for symbolic model checking2015-11-12Paper
Closure properties and complexity of rational sets of regular languages2015-10-30Paper
On the distributivity of LTL specifications2015-09-17Paper
A logic-based framework for verifying consensus algorithms2015-01-13Paper
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic2014-10-14Paper
Parameterized model checking of rendezvous systems2014-09-15Paper
Information reuse for multi-goal reachability analyses2013-08-05Paper
An introduction to test specification in FQL2011-04-06Paper
Second order logic and the weak exponential hierarchies2010-06-17Paper
Counterexamples revisited: principles, algorithms, applications2010-03-23Paper
Theory and Applications of Satisfiability Testing2009-07-24Paper
Encoding Treewidth into SAT2009-07-07Paper
An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries2009-02-10Paper
Query-Driven Program Testing2009-02-10Paper
On the Notion of Vacuous Truth2008-05-15Paper
Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems2008-04-11Paper
State/Event Software Verification for Branching-Time Specifications2007-11-29Paper
Computer Science Logic2007-06-21Paper
Computer Science Logic2007-06-21Paper
Verification, Model Checking, and Abstract Interpretation2007-02-12Paper
The first order definability of graphs: Upper bounds for quantifier depth2007-01-09Paper
Formal Methods in Computer-Aided Design2006-10-20Paper
An Iterative Framework for Simulation Conformance2005-10-18Paper
Automata, Languages and Programming2005-08-24Paper
CONCUR 2004 - Concurrency Theory2005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q44278942003-09-14Paper
Complexity of t-tautologies2003-03-06Paper
On the complexity of data disjunctions.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q47872402003-01-09Paper
https://portal.mardi4nfdi.de/entity/Q27540812001-11-11Paper
Linear time Datalog and branching time logic2001-08-30Paper
https://portal.mardi4nfdi.de/entity/Q27211912001-07-01Paper
https://portal.mardi4nfdi.de/entity/Q45016772001-01-11Paper
https://portal.mardi4nfdi.de/entity/Q49449022000-09-05Paper
https://portal.mardi4nfdi.de/entity/Q49553522000-05-25Paper
https://portal.mardi4nfdi.de/entity/Q42638112000-03-29Paper
Interpolation in fuzzy logic2000-01-04Paper
Succinctness as a source of complexity in logical formalisms1999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42585781999-09-13Paper
https://portal.mardi4nfdi.de/entity/Q42181001999-03-02Paper
Succinct representation, leaf languages, and projection reductions1998-11-10Paper

Research outcomes over time

This page was built for person: Helmut Veith