2008 |
23 | EE | John D. Davis,
Zhangxi Tan,
Fang Yu,
Lintao Zhang:
A practical reconfigurable hardware accelerator for Boolean satisfiability solvers.
DAC 2008: 780-785 |
22 | EE | John D. Davis,
Zhangxi Tan,
Fang Yu,
Lintao Zhang:
Designing an Efficient Hardware Implication Accelerator for SAT Solving.
SAT 2008: 48-62 |
21 | EE | Manuel Costa,
Jon Crowcroft,
Miguel Castro,
Antony I. T. Rowstron,
Lidong Zhou,
Lintao Zhang,
Paul Barham:
Vigilante: End-to-end containment of Internet worm epidemics.
ACM Trans. Comput. Syst. 26(4): (2008) |
2007 |
20 | EE | Lucas Bordeaux,
Lintao Zhang:
A solver for quantified Boolean and linear constraints.
SAC 2007: 321-325 |
19 | EE | Manuel Costa,
Miguel Castro,
Lidong Zhou,
Lintao Zhang,
Marcus Peinado:
Bouncer: securing software by blocking bad input.
SOSP 2007: 117-130 |
2006 |
18 | | Lintao Zhang:
Solving QBF by Combining Conjunctive and Disjunctive Normal Forms.
AAAI 2006 |
17 | EE | Ilya Mironov,
Lintao Zhang:
Applications of SAT Solvers to Cryptanalysis of Hash Functions.
SAT 2006: 102-115 |
16 | EE | Lucas Bordeaux,
Youssef Hamadi,
Lintao Zhang:
Propositional Satisfiability and Constraint Programming: A comparative survey.
ACM Comput. Surv. 38(4): (2006) |
2005 |
15 | EE | Lidong Zhou,
Lintao Zhang,
Frank McSherry,
Nicole Immorlica,
Manuel Costa,
Steve Chien:
A First Look at Peer-to-Peer Worms: Threats and Defenses.
IPTPS 2005: 24-35 |
14 | EE | Darko Marinov,
Sarfraz Khurshid,
Suhabe Bugrara,
Lintao Zhang,
Martin C. Rinard:
Optimizations for Compiling Declarative Models into Boolean Formulas.
SAT 2005: 187-202 |
13 | EE | Lintao Zhang:
On Subsumption Removal and On-the-Fly CNF Simplification.
SAT 2005: 482-489 |
12 | EE | Manuel Costa,
Jon Crowcroft,
Miguel Castro,
Antony I. T. Rowstron,
Lidong Zhou,
Lintao Zhang,
Paul Barham:
Vigilante: end-to-end containment of internet worms.
SOSP 2005: 133-147 |
2004 |
11 | EE | Thomas Ball,
Byron Cook,
Shuvendu K. Lahiri,
Lintao Zhang:
Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement.
CAV 2004: 457-461 |
2003 |
10 | EE | Lintao Zhang,
Sharad Malik:
Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications.
DATE 2003: 10880-10885 |
9 | EE | Lintao Zhang,
Sharad Malik:
Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms.
SAT 2003: 287-298 |
2002 |
8 | EE | Lintao Zhang,
Sharad Malik:
The Quest for Efficient Boolean Satisfiability Solvers.
CADE 2002: 295-313 |
7 | EE | Lintao Zhang,
Sharad Malik:
The Quest for Efficient Boolean Satisfiability Solvers.
CAV 2002: 17-36 |
6 | EE | Lintao Zhang,
Sharad Malik:
Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation.
CP 2002: 200-215 |
5 | EE | Malay K. Ganai,
Pranav Ashar,
Aarti Gupta,
Lintao Zhang,
Sharad Malik:
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver.
DAC 2002: 747-750 |
4 | EE | Lintao Zhang,
Sharad Malik:
Conflict driven learning in a quantified Boolean Satisfiability solver.
ICCAD 2002: 442-449 |
2001 |
3 | EE | Matthew W. Moskewicz,
Conor F. Madigan,
Ying Zhao,
Lintao Zhang,
Sharad Malik:
Chaff: Engineering an Efficient SAT Solver.
DAC 2001: 530-535 |
2 | EE | Lintao Zhang,
Conor F. Madigan,
Matthew W. Moskewicz,
Sharad Malik:
Efficient Conflict Driven Learning in Boolean Satisfiability Solver.
ICCAD 2001: 279-285 |
1 | EE | Aarti Gupta,
Zijiang Yang,
Pranav Ashar,
Lintao Zhang,
Sharad Malik:
Partition-Based Decision Heuristics for Image Computation Using SAT and BDDs.
ICCAD 2001: 286-292 |