The following pages link to Bernd Becker (Q402124):
Displaying 50 items.
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- Incremental preprocessing methods for use in BMC (Q453488) (← links)
- Thread-parallel integrated test pattern generator utilizing satisfiability analysis (Q987743) (← links)
- An easily testable optimal-time VLSI-multiplier (Q1082330) (← links)
- A logic-topological calculus for the construction of integrated circuits. I (Q1088971) (← links)
- Layouts with wires of balanced length (Q1091358) (← links)
- A logic-topological calculus for the construction of integrated circuits. II. (Q1096590) (← links)
- How robust is the n-cube? (Q1104728) (← links)
- Computations over finite monoids and their test complexity (Q1178692) (← links)
- On WLCDs and the complexity of word-level decision diagrams --- A lower bound for division (Q1600657) (← links)
- Dynamic polynomial watchdog encoding for solving weighted MaxSAT (Q1656559) (← links)
- From DQBF to QBF by dependency elimination (Q1680263) (← links)
- On the relation between BDDs and FDDs (Q1908345) (← links)
- Skolem functions for DQBF (Q1990517) (← links)
- On preprocessing for weighted MaxSAT (Q2234104) (← links)
- Cost vs. time in stochastic games and Markov automata (Q2403526) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- Dependency Schemes for DQBF (Q2818034) (← links)
- Accurate Computation of Sensitizable Paths Using Answer Set Programming (Q2851235) (← links)
- Bounded Model Checking with Parametric Data Structures (Q2864380) (← links)
- Minimal Critical Subsystems for Discrete-Time Markov Models (Q2894278) (← links)
- PHAETON: A SAT-Based Framework for Timing-Aware Path Sensitization (Q2985445) (← links)
- On the Optimal Layout of Planar Graphs with Fixed Boundary (Q3027032) (← links)
- Parallel SAT Solving in Bounded Model Checking (Q3069995) (← links)
- On the testability of iterative logic arrays (Q3122556) (← links)
- Craig Interpolation in the Presence of Non-linear Constraints (Q3172854) (← links)
- Hierarchical Counterexamples for Discrete-Time Markov Chains (Q3172933) (← links)
- (Q3200996) (← links)
- (Q3204432) (← links)
- Laissez-Faire Caching for Parallel #SAT Solving (Q3453209) (← links)
- Preprocessing for DQBF (Q3453223) (← links)
- Incremental Encoding and Solving of Cardinality Constraints (Q3457805) (← links)
- Sigref – A Symbolic Bisimulation Tool Box (Q3522930) (← links)
- (Q3528912) (← links)
- Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking (Q3600486) (← links)
- Technische Informatik (Q3619792) (← links)
- (Q3639754) (← links)
- (Q3684050) (← links)
- (Q3743252) (← links)
- (Q3792636) (← links)
- (Q3827942) (← links)
- (Q3960132) (← links)
- (Q4215790) (← links)
- Testing with decision diagrams (Q4225359) (← links)
- (Q4422288) (← links)
- (Q4448597) (← links)
- (Q4472315) (← links)
- (Q4544352) (← links)
- Verification of partial designs using incremental QBF (Q4589096) (← links)
- Integrating Algebraic and SAT Solvers (Q4628487) (← links)
