L
Lintao Zhang
Researcher at Microsoft
Publications - 83
Citations - 8609
Lintao Zhang is an academic researcher from Microsoft. The author has contributed to research in topics: Boolean satisfiability problem & Computer science. The author has an hindex of 32, co-authored 70 publications receiving 8004 citations. Previous affiliations of Lintao Zhang include Northeastern University & Princeton University.
Papers
More filters
Proceedings ArticleDOI
Chaff: engineering an efficient SAT solver
TL;DR: The development of a new complete solver, Chaff, is described which achieves significant performance gains through careful engineering of all aspects of the search-especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy.
Proceedings ArticleDOI
Efficient conflict driven learning in a boolean satisfiability solver
TL;DR: This paper generalizes various conflict driven learning strategies in terms of different partitioning schemes of the implication graph to re-examine the learning techniques used in various SAT solvers and propose an array of new learning schemes.
Journal ArticleDOI
Vigilante: end-to-end containment of internet worms
Manuel Costa,Jon Crowcroft,Miguel Castro,Antony Rowstron,Lidong Zhou,Lintao Zhang,Paul Barham +6 more
TL;DR: Vigilante, a new end-to-end approach to contain worms automatically that addresses limitations of network-level techniques, can automatically contain fast-spreading worms that exploit unknown vulnerabilities without blocking innocuous traffic.
Proceedings ArticleDOI
Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications
Lintao Zhang,Sharad Malik +1 more
TL;DR: The implementation of an independent resolution-based checking procedure that can check the validity of unsatisfiable claims produced by the SAT solver zchaff is described and Experimental results show low overhead for the checking process.
Book ChapterDOI
The Quest for Efficient Boolean Satisfiability Solvers
Lintao Zhang,Sharad Malik +1 more
TL;DR: The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical solutions to this problem enable significant practical applications.