| Publication | Date of Publication | Type |
|---|
| Automating most parts of hardware proofs in HOL | 2024-04-29 | Paper |
The half cleaner lemma: constructing efficient interconnection networks from sorting networks
Parallel Processing Letters | 2022-07-04 | Paper |
| scientific article; zbMATH DE number 7311251 (Why is no real title available?) | 2021-02-16 | Paper |
Optimal scheduling for exposed datapath architectures with buffered processing units by ASP
Theory and Practice of Logic Programming | 2018-12-04 | Paper |
| Automatic synthesis of optimal-size concentrators by answer set programming | 2017-09-05 | Paper |
From synchronous programs to symbolic representations of hybrid systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control | 2017-05-10 | Paper |
Constructive polychronous systems
Logical Foundations of Computer Science | 2015-12-11 | Paper |
Approximated reachability on hybrid automata: falsification meets certification
Electronic Notes in Theoretical Computer Science | 2015-03-23 | Paper |
An Asymptotically Correct Finite Path Semantics for LTL
Logic for Programming, Artificial Intelligence, and Reasoning | 2012-06-15 | Paper |
Improving automata generation for linear temporal logic by considering the automaton hierarchy
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
Dependency-driven distribution of synchronous programs
Distributed, Parallel and Biologically Inspired Systems | 2010-10-27 | Paper |
Property Driven Three-Valued Model Checking on Hybrid Automata
Logic, Language, Information and Computation | 2009-07-02 | Paper |
Formal Reasoning About Causality Analysis
Lecture Notes in Computer Science | 2008-12-04 | Paper |
| Hardware acceleration for model checking | 2008-10-17 | Paper |
| Generating deterministic \(\omega\)-automata for most LTL formulas by the breakpoint construction | 2008-10-17 | Paper |
From LTL to Symbolically Represented Deterministic Automata
Lecture Notes in Computer Science | 2008-04-04 | Paper |
Bounded model checking of infinite state systems
Formal Methods in System Design | 2007-06-21 | Paper |
Theorem Proving in Higher Order Logics
Lecture Notes in Computer Science | 2006-07-06 | Paper |
Verification of reactive systems. Formal methods and algorithms.
Texts in Theoretical Computer Science. An EATCS Series | 2003-07-02 | Paper |
| scientific article; zbMATH DE number 1927430 (Why is no real title available?) | 2003-06-12 | Paper |
| scientific article; zbMATH DE number 1786639 (Why is no real title available?) | 2002-10-20 | Paper |
| scientific article; zbMATH DE number 1630127 (Why is no real title available?) | 2001-10-23 | Paper |
| scientific article; zbMATH DE number 1424021 (Why is no real title available?) | 2000-09-05 | Paper |
| scientific article; zbMATH DE number 1487868 (Why is no real title available?) | 2000-08-10 | Paper |
Accelerating tableaux proofs using compact representations
Formal Methods in System Design | 1994-09-26 | Paper |
Structuring and automating hardware proofs in a higher-order theorem- proving environment
Formal Methods in System Design | 1994-01-09 | Paper |
