Travelled to:1 × Canada
1 × Estonia
1 × Hungary
1 × India
1 × Norway
1 × The Netherlands
2 × Italy
3 × United Kingdom
6 × Germany
7 × USA
8 × France
Collaborated with:C.Scholl R.Drechsler T.Schubert R.Wimmer M.Sauer M.D.T.Lewis I.Polian E.Ábrahám S.Reimer B.Braitling A.Hett R.Krieger S.M.Reddy M.Theobald N.Jansen J.Katoen C.Miller F.Klaedtke M.Herbstritt D.Erb K.Scheibler P.Marin K.Gitina A.Riefert M.S.Reorda J.Burchard L.M.F.Fioriti H.Hatefi H.Hermanns A.Czutro S.Ruppertz M.Keim R.Hahn C.Dehnert A.Kumar I.Pomeranz F.Pigorsch S.Kupferschmid P.Engelke J.Schlöffel C.Dax J.Eisinger M.Steffen R.Cantoro J.Nist U.Loup F.Corzilius S.Hillebrecht M.A.Kochte H.Wunderlich J.Jiang A.Czutro H.Hengster H.Schäfer J.Hartmann A.Sarabi M.A.Perkowski G.Hotz R.Kolla P.Molitor H.Osthof L.M.Ciganda P.Bernardi M.Narizzano E.Giunchiglia T.Quatmann
Talks about:base (12) generat (7) test (7) circuit (6) markov (6) solv (6) optim (5) model (5) function (4) effici (4)
Person: Bernd Becker
DBLP: Becker:Bernd
Contributed to:
2015
2015
2015
20152014
2014
2014
201320132012
201220112010200920092008
2007200520052005200420032003
200120002000199719971995
1995199419941987Wrote 43 papers:
- DATE-2015-GitinaWRSSB #quantifier
- Solving DQBF through quantifier elimination (KG, RW, SR, MS, CS, BB), pp. 1617–1622.
- DATE-2015-RiefertCSRB #automation #generative #on the #source code
- On the automatic generation of SBST test programs for in-field test (AR, RC, MS, MSR, BB), pp. 1186–1191.
- FM-2015-QuatmannJDWAKB
- Counterexamples for Expected Rewards (TQ, NJ, CD, RW, EÁ, JPK, BB), pp. 435–452.
- SAT-2015-BurchardSB #parallel #satisfiability
- Laissez-Faire Caching for Parallel #SAT Solving (JB, TS, BB), pp. 46–61.
- SAT-2015-WimmerGNSB #preprocessor
- Preprocessing for DQBF (RW, KG, JN, CS, BB), pp. 173–190.
- VMCAI-2015-BraitlingFHWBH #automaton #markov #metric
- Abstraction-Based Computation of Reward Measures for Markov Automata (BB, LMFF, HH, RW, BB, HH), pp. 172–189.
- DATE-2014-ErbSSB #fault #performance #smt
- Efficient SMT-based ATPG for interconnect open defects (DE, KS, MS, BB), pp. 1–6.
- DATE-2014-ReimerSSB #using
- Using MaxBMC for Pareto-optimal circuit initialization (SR, MS, TS, BB), pp. 1–6.
- DATE-2014-RiefertCSBRB #approach #automation #effectiveness #fault #functional #generative #testing
- An effective approach to automatic functional processor test generation for small-delay faults (AR, LMC, MS, PB, MSR, BB), pp. 1–6.
- QAPL-2014-BraitlingFHWBH #abstraction #automaton #game studies #markov #named #refinement
- MeGARA: Menu-based Game Abstraction and Abstraction Refinement of Markov Automata (BB, LMFF, HH, RW, BB, HH), pp. 48–63.
- SFM-2014-AbrahamBDJKW #generative #markov #modelling #overview
- Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey (EÁ, BB, CD, NJ, JPK, RW), pp. 65–121.
- CADE-2013-LoupSCAB #algebra #composition #constraints
- A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition (UL, KS, FC, EÁ, BB), pp. 193–207.
- DATE-2013-HillebrechtKEWB #generative
- Accurate QBF-based test pattern generation in presence of unknown values (SH, MAK, DE, HJW, BB), pp. 436–441.
- DATE-2013-SauerRSPB #performance #satisfiability
- Efficient SAT-based dynamic compaction and relaxation for longest sensitizable paths (MS, SR, TS, IP, BB), pp. 448–453.
- DATE-2012-JiangSCBP #algorithm #constraints #generative #memory management #on the
- On the optimality of K longest path generation algorithm under memory constraints (JJ, MS, AC, BB, IP), pp. 418–423.
- DATE-2012-MarinMLB #design #incremental #using #verification
- Verification of partial designs using incremental QBF solving (PM, CM, MDTL, BB), pp. 623–628.
- TACAS-2012-WimmerJABK #markov #modelling
- Minimal Critical Subsystems for Discrete-Time Markov Models (RW, NJ, EÁ, BB, JPK), pp. 299–314.
- DATE-2011-KumarRPB #3d #clustering #testing
- Hyper-graph based partitioning to reduce DFT cost for pre-bond 3D-IC testing (AK, SMR, IP, BB), pp. 1424–1429.
- DATE-2011-ReimerPSB #integration #orthogonal
- Integration of orthogonal QBF solving techniques (SR, FP, CS, BB), pp. 149–154.
- SAT-2010-MillerKLB #bound #design #encoding #model checking
- Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs (CM, SK, MDTL, BB), pp. 194–208.
- SAT-2009-LewisMSNBG #distributed #named
- PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing (MDTL, PM, TS, MN, BB, EG), pp. 509–523.
- VMCAI-2009-WimmerBB #bound #generative #markov #model checking #using
- Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking (RW, BB, BB), pp. 366–380.
- DATE-2008-EngelkePSB #fault #industrial #simulation
- Resistive Bridging Fault Simulation of Industrial Circuits (PE, IP, JS, BB), pp. 628–633.
- CAV-2007-BeckerDEK #constraints #integer #linear #named
- LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals (BB, CD, JE, FK), pp. 307–310.
- DATE-2005-PolianCB #optimisation
- Evolutionary Optimization in Code-Based Test Compression (IP, AC, BB), pp. 1124–1129.
- SAT-2005-LewisSB #satisfiability
- Speedup Techniques Utilized in Modern SAT Solvers (MDTL, TS, BB), pp. 437–443.
- VMCAI-2005-AbrahamBKS #bound #hybrid #linear #model checking #optimisation
- Optimizing Bounded Model Checking for Linear Hybrid Systems (EÁ, BB, FK, MS), pp. 396–412.
- SAT-2004-LewisSB #detection #satisfiability
- Early Conflict Detection Based BCP for SAT Solving (MDTL, TS, BB), pp. 29–36.
- DATE-2003-PolianBR #markov #optimisation #pseudo #random
- Evolutionary Optimization of Markov Sources for Pseudo Random Scan BIST (IP, BB, SMR), pp. 11184–11185.
- SAT-2003-HerbstrittB #branch
- Conflict-Based Selection of Branching Rules (MH, BB), pp. 441–451.
- DAC-2001-SchollB #equivalence #implementation
- Checking Equivalence for Partial Implementations (CS, BB), pp. 238–243.
- DAC-2000-HettSB #distance #finite #state machine #traversal
- Distance driven finite state machine traversal (AH, CS, BB), pp. 39–42.
- DATE-2000-SchollB #generative #logic #multi #on the
- On the Generation of Multiplexer Circuits for Pass Transistor Logic (CS, BB), pp. 372–378.
- EDTC-1997-DrechslerHSHB #testing
- Testability of 2-level AND/EXOR circuits (RD, HH, HS, JH, BB), pp. 548–553.
- EDTC-1997-HettDB #order #performance #synthesis
- Fast and efficient construction of BDDs by reordering based synthesis (AH, RD, BB), pp. 168–175.
- TACAS-1997-DrechslerBR #algorithm
- Manipulation Algorithms for K*BMDs (RD, BB, SR), pp. 4–18.
- DAC-1995-KriegerBK #fault #multi #simulation
- Symbolic Fault Simulation for Sequential Circuits and the Multiple Observation Time Test Strategy (RK, BB, MK), pp. 339–344.
- ICALP-1995-BeckerDT
- OKFDDs versus OBDDs and OFDDs (BB, RD, MT), pp. 475–486.
- DAC-1994-DrechslerSTBP #diagrams #functional #order #performance #representation
- Efficient Representation and Manipulation of Switching Functions Based on Ordered Kronecker Functional Decision Diagrams (RD, AS, MT, BB, MAP), pp. 415–419.
- EDAC-1994-BeckerD #diagrams #functional #testing
- Testability of Circuits Derived from Functional Decision Diagrams (BB, RD), p. 667.
- EDAC-1994-HahnKB #approach #fault
- A Hierarchical Approach to Fault Collapsing (RH, RK, BB), pp. 171–176.
- DAC-1987-BeckerHKMO #calculus #design
- Hierarchical Design Based on a Calculus of Nets (BB, GH, RK, PM, HGO), pp. 649–653.