João P. Marques Silva

26 papers A* 2A 5B 2C 5Journal 7Unranked 5
YearRankTypeTitle / Venue / Authors
2011 A conf
Empirical Study of the Anatomy of Modern Sat Solvers.
SAT
Hadi Katebi, Karem A. Sakallah, João P. Marques Silva
2004 J jnl
Satisfiability-Based Algorithms for Boolean Optimization.
Ann. Math. Artif. Intell.
Vasco M. Manquinho, João P. Marques Silva
2003 J jnl
An Overview of Backtrack Search Satisfiability Algorithms.
Ann. Math. Artif. Intell.
Inês Lynce, João P. Marques Silva
2002 J jnl
Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Vasco M. Manquinho, João P. Marques Silva
2001 J jnl
An exact solution to the minimum size test pattern problem.
ACM Trans. Design Autom. Electr. Syst.
Paulo F. Flores, Horácio C. Neto, João P. Marques Silva
2001 J jnl
Efficient Algorithms for the Inference of Minimum Size DFAs.
Mach. Learn.
Arlindo L. Oliveira, João P. Marques Silva
2000 A conf
An Experimental Study of Satisfiability Search Heuristics.
DATE
Karem A. Sakallah, Fadi A. Aloul, João P. Marques Silva
2000 A* conf
Boolean satisfiability in electronic design automation.
DAC
João P. Marques Silva, Karem A. Sakallah
2000 A conf
On Applying Incremental Satisfiability to Delay Fault Testing.
DATE
Joonyoung Kim, Jesse Whittemore, Karem A. Sakallah, João P. Marques Silva
1999 J jnl
GRASP: A Search Algorithm for Propositional Satisfiability.
IEEE Trans. Computers
João P. Marques Silva, Karem A. Sakallah
1999 — conf
On Applying Set Covering Models to Test Set Compaction.
Great Lakes Symposium on VLSI
Paulo F. Flores, Horácio C. Neto, João P. Marques Silva
1998 C conf
An exact solution to the minimum size test pattern problem.
ICCD
Paulo F. Flores, Horácio C. Neto, João P. Marques Silva
1998 C conf
Efficient Search Techniques for the Inference of Minimum Size Finite Automata.
SPIRE
Arlindo L. Oliveira, João P. Marques Silva
1998 — conf
Integer Programming Models for Optimization Problems in Test Generation.
ASP-DAC
João P. Marques Silva
1998 — conf
Timing analysis using propositional satisfiability.
ICECS
Luís Guerra e Silva, João P. Marques Silva, Luís Miguel Silveira, Karem A. Sakallah
1997 B conf
Prime Implicant Computation Using Satisfiability Algorithms.
ICTAI
Vasco M. Manquinho, Paulo F. Flores, João P. Marques Silva, Arlindo L. Oliveira
1997 — conf
Robust Search Algorithms for Test Pattern Generation.
FTCS
João P. Marques Silva, Karem A. Sakallah
1996 B conf
Conflict Analysis in Search Algorithms for Satisfiability.
ICTAI
João P. Marques Silva, Karem A. Sakallah
1996 A conf
GRASP - a new search algorithm for satisfiability.
ICCAD
João P. Marques Silva, Karem A. Sakallah
1996 J jnl
Ravel-XL: a hardware accelerator for assigned-delay compiled-code logic gate simulation.
IEEE Trans. Very Large Scale Integr. Syst.
Michael A. Riepe, João P. Marques Silva, Karem A. Sakallah, Richard B. Brown
1994 A* conf
Dynamic Search-Space Pruning Techniques in Path Sensitization.
DAC
João P. Marques Silva, Karem A. Sakallah
1994 C conf
Efficient and Robust Test Generation-Based Timing Analysis.
ISCAS
João P. Marques Silva, Karem A. Sakallah
1993 C conf
An Analysis of Path Sensitization Criteria.
ICCD
João P. Marques Silva, Karem A. Sakallah
1993 — conf
Concurrent path sensitization in timing analysis.
EURO-DAC
João P. Marques Silva, Karem A. Sakallah
1993 C conf
Ravel-XL: A Hardware Accelerator for Assigned-Delay Compiled-Code Logic Gate Simulation.
ICCD
Michael A. Riepe, João P. Marques Silva, Karem A. Sakallah, Richard B. Brown
1991 A conf
FPD - An Environment for Exact Timing Analysis.
ICCAD
João P. Marques Silva, Karem A. Sakallah, Luís M. Vidigal