Travelled to:1 × Germany
2 × Italy
3 × France
3 × USA
Collaborated with:∅ J.H.Kukula I.Moon C.Pixley T.Leonard A.Mokkedem P.A.Abdulla N.Eén G.Andersson B.Cook Z.Hanna K.Claessen M.Sheeran S.Singh R.F.Damiano T.Stanion Y.Zhu
Talks about:approach (3) combin (3) solver (2) design (2) check (2) guid (2) find (2) use (2) sat (2) bug (2)
Person: Per Bjesse
DBLP: Bjesse:Per
Contributed to:
2008
20072004
2003
20022001
20001999
1998Wrote 9 papers:
- CAV-2008-Bjesse #approach #industrial #model checking #word
- A Practical Approach to Word Level Model Checking of Industrial Netlists (PB), pp. 446–458.
- DATE-2007-MoonBP #approach #composition #equivalence
- A compositional approach to the combination of combinational and sequential equivalence checking of circuits without known reset states (IHM, PB, CP), pp. 1170–1175.
- DATE-v1-2004-BjesseK #abstraction #debugging #refinement #using
- Using Counter Example Guided Abstraction Refinement to Find Complex Bugs (PB, JHK), pp. 156–161.
- SAT-2003-BjesseKDSZ #satisfiability
- Guiding SAT Diagnosis with Tree Decompositions (PB, JHK, RFD, TS, YZ), pp. 315–329.
- DAC-2002-AnderssonBCH #approach #automation #design #problem #proving
- A proof engine approach to solving combinational design automation problems (GA, PB, BC, ZH), pp. 725–730.
- CAV-2001-BjesseLM #debugging #satisfiability #using
- Finding Bugs in an α Microprocessor Using Satisfiability Solvers (PB, TL, AM), pp. 454–464.
- TACAS-2000-AbdullaBE #analysis #reachability
- Symbolic Reachability Analysis Based on SAT-Solvers (PAA, PB, NE), pp. 411–425.
- CAV-1999-Bjesse #automation #combinator #pipes and filters #verification
- Automatic Verification of Combinatorial and Pipelined FFT (PB), pp. 380–393.
- ICFP-1998-BjesseCSS #design #hardware #haskell #named
- Lava: Hardware Design in Haskell (PB, KC, MS, SS), pp. 174–184.