Bernhard Beckert

From MaRDI portal
Person:229746

Available identifiers

zbMath Open beckert.bernhardMaRDI QIDQ229746

List of research outcomes





PublicationDate of PublicationType
Deduction by combining semantic tableaux and integer programming2024-06-21Paper
\textsf{lean}\textit{EA}: a lean evolving algebra compiler2024-06-21Paper
Using Relational Verification for Program Slicing2024-03-14Paper
Generalized test tables: a domain-specific specification language for automated production systems2023-07-28Paper
Using dependence graphs to assist verification and testing of information-flow properties2023-05-05Paper
Computing Exact Loop Bounds for Bounded Program Verification2022-11-04Paper
https://portal.mardi4nfdi.de/entity/Q50163802021-12-13Paper
A completion-based method for mixed universal and rigid E-unification2020-01-21Paper
LeanT A P: Lean tableau-based theorem proving2020-01-21Paper
Free variable tableaux for propositional modal logics2019-01-15Paper
The tableau-based theorem prover 3 T A P Version 4.02019-01-15Paper
Incremental theory reasoning methods for semantic tableaux2019-01-10Paper
Proving JDK's dual pivot quicksort correct2018-12-07Paper
Information Flow in Object-Oriented Software2015-11-30Paper
A dynamic logic for deductive verification of multi-threaded programs2014-11-11Paper
Dynamic Logic with Trace Semantics2013-06-14Paper
Analysing Vote Counting Algorithms via Logic2013-06-14Paper
Integrated Formal Methods2009-05-07Paper
Dynamic Logic with Non-rigid Functions2009-03-12Paper
Second-Order Principles in Specification Languages for Object-Oriented Programs2008-05-27Paper
KeY: A Formal Method for Object-Oriented Systems2007-11-28Paper
White-Box Testing by Combining Deduction-Based Specification Extraction and Black-Box Testing2007-10-31Paper
Refinement and retrenchment for programming language data types2006-10-25Paper
https://portal.mardi4nfdi.de/entity/Q30219032005-06-21Paper
https://portal.mardi4nfdi.de/entity/Q47383372004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q30438002004-08-06Paper
Depth-first proof search without backtracking for free-variable clausal tableaux2003-08-25Paper
https://portal.mardi4nfdi.de/entity/Q44178362003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q45363142002-11-25Paper
Free-variable tableaux for propositional modal logics2002-09-03Paper
https://portal.mardi4nfdi.de/entity/Q45396452002-07-10Paper
https://portal.mardi4nfdi.de/entity/Q27717392002-02-18Paper
Equality and other theories2001-11-14Paper
https://portal.mardi4nfdi.de/entity/Q45247822001-07-29Paper
The SAT problem of signed CNF formulas2001-07-05Paper
https://portal.mardi4nfdi.de/entity/Q45247892001-07-03Paper
https://portal.mardi4nfdi.de/entity/Q45207692001-02-27Paper
https://portal.mardi4nfdi.de/entity/Q45247692001-01-15Paper
Simplification of many-valued logic formulas using anti-links1999-03-02Paper
https://portal.mardi4nfdi.de/entity/Q38388061998-10-08Paper
https://portal.mardi4nfdi.de/entity/Q38388041998-08-13Paper
Logic programming as a basis for lean automated deduction1997-11-10Paper
Fast subsumption checks using anti-links1997-09-07Paper
Semantic tableaux with equality1997-04-21Paper
lean\(T^ AP\): Lean tableau-based deduction1996-05-28Paper
https://portal.mardi4nfdi.de/entity/Q42825961994-08-28Paper

Research outcomes over time

This page was built for person: Bernhard Beckert