The following pages link to Klaus Schneider (Q1334902):
Displaying 25 items.
- Accelerating tableaux proofs using compact representations (Q1334905) (← links)
- Verification of reactive systems. Formal methods and algorithms. (Q1395897) (← links)
- Structuring and automating hardware proofs in a higher-order theorem- proving environment (Q1801500) (← links)
- Bounded model checking of infinite state systems (Q2369883) (← links)
- Automatic synthesis of optimal-size concentrators by answer set programming (Q2401945) (← links)
- (Q2729956) (← links)
- An Asymptotically Correct Finite Path Semantics for LTL (Q2891462) (← links)
- From synchronous programs to symbolic representations of hybrid systems (Q2985863) (← links)
- Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy (Q2996152) (← links)
- Dependency-Driven Distribution of Synchronous Programs (Q3163938) (← links)
- Constructive Polychronous Systems (Q3455857) (← links)
- (Q3528917) (← links)
- (Q3528929) (← links)
- Formal Reasoning About Causality Analysis (Q3543654) (← links)
- Property Driven Three-Valued Model Checking on Hybrid Automata (Q3638286) (← links)
- (Q4484348) (← links)
- (Q4494397) (← links)
- (Q4547951) (← links)
- Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP (Q4559805) (← links)
- (Q4945211) (← links)
- Approximated Reachability on Hybrid Automata: Falsification meets Certification (Q4982085) (← links)
- The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks (Q5087836) (← links)
- (Q5151002) (← links)
- From LTL to Symbolically Represented Deterministic Automata (Q5452723) (← links)
- Theorem Proving in Higher Order Logics (Q5477666) (← links)
