Travelled to:1 × China
1 × Germany
1 × Italy
1 × Korea
1 × Portugal
2 × Denmark
2 × United Kingdom
6 × USA
Collaborated with:S.Malik L.Zhou J.D.Davis Z.Tan F.Yu L.Bordeaux I.Mironov ∅ M.Costa M.Castro T.Ball B.Cook S.K.Lahiri M.Peinado D.Marinov S.Khurshid S.Bugrara M.C.Rinard M.K.Ganai P.Ashar A.Gupta M.W.Moskewicz C.F.Madigan Y.Zhao H.Guo M.Wu G.Hu J.Yang J.Crowcroft A.I.T.Rowstron P.Barham
Talks about:solver (9) sat (6) boolean (5) effici (5) satisfi (3) practic (3) base (3) implement (2) algorithm (2) softwar (2)
Person: Lintao Zhang
DBLP: Zhang:Lintao
Contributed to:
2011
2008
2008
20072007200620052005
2004
20032003
2002200220022001Wrote 16 papers:
- SOSP-2011-GuoWZHYZ #interface #model checking #reduction
- Practical software model checking via dynamic interface reduction (HG, MW, LZ, GH, JY, LZ), pp. 265–278.
- DAC-2008-DavisTYZ #configuration management #hardware #satisfiability
- A practical reconfigurable hardware accelerator for Boolean satisfiability solvers (JDD, ZT, FY, LZ), pp. 780–785.
- SAT-2008-DavisTYZ #design #hardware #performance #satisfiability
- Designing an Efficient Hardware Implication Accelerator for SAT Solving (JDD, ZT, FY, LZ), pp. 48–62.
- SAC-2007-BordeauxZ #constraints #linear #quantifier
- A solver for quantified Boolean and linear constraints (LB, LZ), pp. 321–325.
- SOSP-2007-CostaCZZP #named
- Bouncer: securing software by blocking bad input (MC, MC, LZ, LZ, MP), pp. 117–130.
- SAT-2006-MironovZ #satisfiability
- Applications of SAT Solvers to Cryptanalysis of Hash Functions (IM, LZ), pp. 102–115.
- SAT-2005-MarinovKBZR #compilation #declarative #modelling #optimisation
- Optimizations for Compiling Declarative Models into Boolean Formulas (DM, SK, SB, LZ, MCR), pp. 187–202.
- SAT-2005-Zhang #on the #on the fly
- On Subsumption Removal and On-the-Fly CNF Simplification (LZ), pp. 482–489.
- SOSP-2005-CostaCCRZZB #internet #named
- Vigilante: end-to-end containment of internet worms (MC, JC, MC, AITR, LZ, LZ, PB), pp. 133–147.
- CAV-2004-BallCLZ #abstraction #automation #named #proving #refinement #theorem proving
- Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement (TB, BC, SKL, LZ), pp. 457–461.
- DATE-2003-ZhangM #implementation #independence #satisfiability #using #validation
- Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications (LZ, SM), pp. 10880–10885.
- SAT-2003-ZhangM #algorithm #case study #implementation #performance #satisfiability
- Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms (LZ, SM), pp. 287–298.
- CADE-2002-ZhangM #performance #satisfiability
- The Quest for Efficient Boolean Satisfiability Solvers (LZ, SM), pp. 295–313.
- CAV-2002-ZhangM #performance #satisfiability
- The Quest for Efficient Boolean Satisfiability Solvers (LZ, SM), pp. 17–36.
- DAC-2002-GanaiAGZM #algorithm #satisfiability
- Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver (MKG, PA, AG, LZ, SM), pp. 747–750.
- DAC-2001-MoskewiczMZZM #named #performance #satisfiability
- Chaff: Engineering an Efficient SAT Solver (MWM, CFM, YZ, LZ, SM), pp. 530–535.