Joao Marques-Silva

João P. Marques Silva, João Marques-Silva

	2013
c107		Anton Belov, Huan Chen, Alan Mishchenko, Joao Marques-Silva: Core minimization in SAT-based abstraction. DATE 2013: 1411-1416
c106		Anton Belov, Matti Järvisalo, João Marques-Silva: Formula Preprocessing in MUS Extraction. TACAS 2013: 108-123
	2012
j34		Anton Belov, Inês Lynce, João Marques-Silva: Towards efficient MUS extraction. AI Commun. 25(2): 97-116 (2012)
j33		Florian Letombe, João Marques-Silva: Hybrid Incremental Algorithms for Boolean Satisfiability. International Journal on Artificial Intelligence Tools 21(6) (2012)
j32		Huan Chen, João Marques-Silva: TG-Pro: A SAT-based ATPG System. JSAT 8(1/2): 83-88 (2012)
j31		Mikolás Janota, Inês Lynce, Vasco M. Manquinho, João Marques-Silva: PackUp: Tools for Package Upgradability Solving. JSAT 8(1/2): 89-94 (2012)
j30		Anton Belov, João Marques-Silva: MUSer2: An Efficient MUS Extractor. JSAT 8(1/2): 123-128 (2012)
j29		João Marques-Silva: Computing Minimally Unsatisfiable Subformulas: State of the Art and Future Directions. Multiple-Valued Logic and Soft Computing 19(1-3): 163-183 (2012)
j28		Lucas Cordeiro, Bernd Fischer, João Marques-Silva: SMT-Based Bounded Model Checking for Embedded ANSI-C Software. IEEE Trans. Software Eng. 38(4): 957-974 (2012)
c105		Federico Heras, António Morgado, João Marques-Silva: An Empirical Study of Encodings for Group MaxSAT. Canadian Conference on AI 2012: 85-96
c104		Anton Belov, Mikolás Janota, Inês Lynce, João Marques-Silva: On Computing Minimal Equivalent Subformulas. CP 2012: 158-174
c103		Huan Chen, Mikolás Janota, João Marques-Silva: QBf-based boolean function bi-decomposition. DATE 2012: 816-819
c102		Huan Chen, João Marques-Silva: New & improved models for SAT-based bi-decomposition. ACM Great Lakes Symposium on VLSI 2012: 141-146
c101		Federico Heras, António Morgado, Jordi Planes, João P. Marques Silva: Iterative SAT Solving for Minimum Satisfiability. ICTAI 2012: 922-927
c100		Lucas Bordeaux, Mikolás Janota, João P. Marques Silva, Pierre Marquis: On Unit-Refutation Complete Formulae with Existentially Quantified Variables. KR 2012
c99		Federico Heras, António Morgado, João Marques-Silva: Lower Bounds and Upper Bounds for MaxSAT. LION 2012: 402-407
c98		Mikolás Janota, William Klieber, João Marques-Silva, Edmund M. Clarke: Solving QBF with Counterexample Guided Refinement. SAT 2012: 114-128
c97		António Morgado, Federico Heras, João Marques-Silva: Improvements to Core-Guided Binary Search for MaxSAT. SAT 2012: 284-297
c96		Anton Belov, Alexander Ivrii, Arie Matsliah, João Marques-Silva: On Efficient Computation of Variable MUSes. SAT 2012: 298-311
c95		Lucas Bordeaux, João Marques-Silva: Knowledge Compilation with Empowerment. SOFSEM 2012: 612-624
i15		Anton Belov, João Marques-Silva: Generalizing Redundancy in Propositional Logic: Foundations and Hitting Sets Duality. CoRR abs/1207.1257 (2012)
	2011
j27		João Marques-Silva, Josep Argelich, Ana Graça, Inês Lynce: Boolean lexicographic optimization: algorithms & applications. Ann. Math. Artif. Intell. 62(3-4): 317-343 (2011)
j26		Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira: Haplotype inference with pseudo-Boolean optimization. Annals OR 184(1): 137-162 (2011)
j25		Karem A. Sakallah, João Marques-Silva: Anatomy and Empirical Evaluation of Modern SAT Solvers. Bulletin of the EATCS 103: 96-121 (2011)
j24		Inês Lynce, João Marques-Silva: Restoring CSP Satisfiability with MaxSAT. Fundam. Inform. 107(2-3): 249-266 (2011)
p3		Ana Graça, João Marques-Silva, Inês Lynce: Haplotype Inference Using Propositional Satisfiability. Mathematical Approaches to Polymer Sequence Analysis and Related Problems 2011: 127-147
c94		Federico Heras, António Morgado, João Marques-Silva: Core-Guided Binary Search Algorithms for Maximum Satisfiability. AAAI 2011
c93		Mikolás Janota, João P. Marques Silva: On Deciding MUS Membership with QBF. CP 2011: 414-428
c92		Anton Belov, João Marques-Silva: Accelerating MUS extraction with recursive model rotation. FMCAD 2011: 37-40
c91		António Morgado, João Marques-Silva: On Validating Boolean Optimizers. ICTAI 2011: 924-926
c90		Federico Heras, João Marques-Silva: Read-Once Resolution for Unsatisfiability-Based Max-SAT Algorithms. IJCAI 2011: 572-577
c89		Mikolás Janota, João Marques-Silva: cmMUS: A Tool for Circumscription-Based MUS Membership Testing. LPNMR 2011: 266-271
c88		Anton Belov, João P. Marques Silva: Minimally Unsatisfiable Boolean Circuits. SAT 2011: 145-158
c87		João P. Marques Silva, Inês Lynce: On Improving MUS Extraction Algorithms. SAT 2011: 159-173
c86		Mikolás Janota, João P. Marques Silva: Abstraction-Based Algorithm for 2QBF. SAT 2011: 230-244
c85		Hadi Katebi, Karem A. Sakallah, João P. Marques Silva: Empirical Study of the Anatomy of Modern Sat Solvers. SAT 2011: 343-356
c84		Huan Chen, João Marques-Silva: Improvements to satisfiability-based boolean function bi-decomposition. VLSI-SoC 2011: 142-147
c83		Youssef Hamadi, João Marques-Silva, Christoph M. Wintersteiger: Lazy Decomposition for Distributed Decision Procedures. PDMC 2011: 43-54
i14		António Morgado, João Marques-Silva: On Validating Boolean Optimizers. CoRR abs/1109.2752 (2011)
i13		Huan Chen, Mikolás Janota, João P. Marques Silva: QBF-Based Boolean Function Bi-Decomposition. CoRR abs/1112.2313 (2011)
	2010
j23		António Morgado, João Marques-Silva: Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem. Fundam. Inform. 102(3-4): 363-389 (2010)
j22		Ana Graça, Inês Lynce, João Marques-Silva, Arlindo L. Oliveira: Haplotype Inference by Pure Parsimony: A Survey. Journal of Computational Biology 17(8): 969-992 (2010)
j21		Yibin Chen, Sean Safarpour, João Marques-Silva, Andreas G. Veneris: Automated Design Debugging With Maximum Satisfiability. IEEE Trans. on CAD of Integrated Circuits and Systems 29(11): 1804-1817 (2010)
c82		Ana Graça, Inês Lynce, João Marques-Silva, Arlindo L. Oliveira: Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information. ANB 2010: 38-56
c81		João Marques-Silva, Mikolás Janota, Inês Lynce: On Computing Backbones of Propositional Theories. ECAI 2010: 15-20
c80		Lucas Cordeiro, Bernd Fischer, João Marques-Silva: Continuous Verification of Large Embedded Software Using SMT-Based Bounded Model Checking. ECBS 2010: 160-169
c79		Ashish Darbari, Bernd Fischer, João Marques-Silva: Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking. ICTAC 2010: 260-274
c78		João P. Marques Silva: Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper). ISMVL 2010: 9-14
c77		Mikolás Janota, Radu Grigore, João Marques-Silva: Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription. JELIA 2010: 195-207
c76		Mikolás Janota, Goetz Botterweck, Radu Grigore, João P. Marques Silva: How to Complete an Interactive Configuration Process? SOFSEM 2010: 528-539
c75		Josep Argelich, Daniel Le Berre, Inês Lynce, João P. Marques Silva, Pascal Rapicault: Solving Linux Upgradeability Problems Using Boolean Optimization. LoCoCo 2010: 11-22
i12		Mikolás Janota, João Marques-Silva, Radu Grigore: Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription. CoRR abs/1006.5896 (2010)
	2009
j20		Mark H. Liffiton, Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João Marques-Silva, Karem A. Sakallah: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas. Constraints 14(4): 415-442 (2009)
c74		Yibin Chen, Sean Safarpour, Andreas G. Veneris, João P. Marques Silva: Spatial and temporal design debug using partial MaxSAT. ACM Great Lakes Symposium on VLSI 2009: 345-350
c73		Huan Chen, João Marques-Silva: TG-PRO: A new model for SAT-based ATPG. HLDVT 2009: 76-81
c72		Lucas Cordeiro, Bernd Fischer, Huan Chen, João Marques-Silva: Semiformal Verification of Embedded Software in Medical Devices Considering Stringent Hardware Constraints. ICESS 2009: 396-403
c71		Paulo J. Matos, Bernd Fischer, João P. Marques Silva: A Lazy Unbounded Model Checker for Event-B. ICFEM 2009: 485-503
c70		Josep Argelich, Inês Lynce, João P. Marques Silva: On Solving Boolean Multilevel Optimization Problemse. IJCAI 2009: 393-398
c69		Lucas Cordeiro, Bernd Fischer, João Marques-Silva: SMT-Based Bounded Model Checking for Embedded ANSI-C Software. ASE 2009: 137-148
c68		Vasco M. Manquinho, João P. Marques Silva, Jordi Planes: Algorithms for Weighted Boolean Optimization. SAT 2009: 495-508
p2		João P. Marques Silva, Inês Lynce, Sharad Malik: Conflict-Driven Clause Learning SAT Solvers. Handbook of Satisfiability 2009: 131-153
i11		Vasco M. Manquinho, João P. Marques Silva, Jordi Planes: Algorithms for Weighted Boolean Optimization. CoRR abs/0903.0843 (2009)
i10		Josep Argelich, Inês Lynce, João P. Marques Silva: On Solving Boolean Multilevel Optimization Problems. CoRR abs/0904.0019 (2009)
i9		Lucas Cordeiro, Bernd Fischer, João P. Marques Silva: SMT-Based Bounded Model Checking for Embedded ANSI-C Software. CoRR abs/0907.2072 (2009)
i8		Mikolás Janota, João Marques-Silva, Radu Grigore: Algorithms for finding dispensable variables. CoRR abs/0910.0013 (2009)
i7		Mikolás Janota, Goetz Botterweck, Radu Grigore, João Marques-Silva: How to Complete an Interactive Configuration Process? CoRR abs/0910.3913 (2009)
i6		Ashish Darbari, Bernd Fischer, João P. Marques Silva: Industrial-Strength Formally Certified SAT Solving. CoRR abs/0911.1678 (2009)
i5		Lucas Cordeiro, Bernd Fischer, João P. Marques Silva: Continuous Verification of Large Embedded Software using SMT-Based Bounded Model Checking. CoRR abs/0911.3784 (2009)
	2008
j19		Inês Lynce, João Marques-Silva, Steven David Prestwich: Boosting Haplotype Inference with Local Search. Constraints 13(1-2): 155-179 (2008)
j18		Inês Lynce, João Marques-Silva: Haplotype Inference with Boolean Satisfiability. International Journal on Artificial Intelligence Tools 17(2): 355-387 (2008)
j17		João Marques-Silva: Model checking with Boolean Satisfiability. J. Algorithms 63(1-3): 3-16 (2008)
c67		Paulo J. Matos, João Marques-Silva: Model Checking Event-B by Encoding into Alloy. ABZ 2008: 346
c66		Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira: Efficient Haplotype Inference with Combined CP and OR Techniques. CPAIOR 2008: 308-312
c65		João Marques-Silva, Jordi Planes: Algorithms for Maximum Satisfiability using Unsatisfiable Cores. DATE 2008: 408-413
c64		Paulo J. Matos, Jordi Planes, Florian Letombe, João Marques-Silva: A MAX-SAT Algorithm Portfolio. ECAI 2008: 911-912
c63		Federico Heras, Vasco M. Manquinho, João Marques-Silva: On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization. FLAIRS Conference 2008: 71-76
c62		Inês Lynce, Ana Graça, João Marques-Silva, Arlindo L. Oliveira: Haplotype Inference with Boolean Constraint Solving: An Overview. ICTAI (1) 2008: 92-100
c61		João Marques-Silva, Inês Lynce, Vasco M. Manquinho: Symmetry Breaking for Maximum Satisfiability. LPAR 2008: 1-15
c60		Florian Letombe, João Marques-Silva: Improvements to Hybrid Incremental SAT Algorithms. SAT 2008: 168-181
c59		João Marques-Silva, Vasco M. Manquinho: Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms. SAT 2008: 225-230
p1		Inês Lynce, Vasco M. Manquinho, João Marques-Silva: Backtracking. Wiley Encyclopedia of Computer Science and Engineering 2008
i4		João Marques-Silva, Inês Lynce, Vasco M. Manquinho: Symmetry Breaking for Maximum Satisfiability. CoRR abs/0804.0599 (2008)
i3		António Morgado, João P. Marques Silva: A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem. CoRR abs/0805.0202 (2008)
i2		Paulo J. Matos, João Marques-Silva: Model Checking Event-B by Encoding into Alloy. CoRR abs/0805.3256 (2008)
	2007
j16		João Marques-Silva, Karem A. Sakallah, Inês Lynce: Report on the SAT 2007 Conference on Theory and Applications of Satisfiability Testing. AI Magazine 28(4): 135-136 (2007)
j15		Inês Lynce, João P. Marques Silva: Random backtracking in backtrack search algorithms for satisfiability. Discrete Applied Mathematics 155(12): 1604-1612 (2007)
j14		João Marques-Silva: Interpolant Learning and Reuse in SAT-Based Model Checking. Electr. Notes Theor. Comput. Sci. 174(3): 31-43 (2007)
c58		Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira: Efficient Haplotype Inference with Pseudo-boolean Optimization. AB 2007: 125-139
c57		João P. Marques Silva, Inês Lynce: Towards Robust CNF Encodings of Cardinality Constraints. CP 2007: 483-497
c56		João Marques-Silva, Inês Lynce, Ana Graça, Arlindo L. Oliveira: Efficient and Tight Upper Bounds for Haplotype Inference by Pure Parsimony Using Delayed Haplotype Selection. EPIA Workshops 2007: 621-632
c55		Nicola Bombieri, Franco Fummi, Graziano Pravadelli, João Marques-Silva: Towards Equivalence Checking Between TLM and RTL Models. MEMOCODE 2007: 113-122
c54		Inês Lynce, João P. Marques Silva: Breaking Symmetries in SAT Matrix Models. SAT 2007: 22-27
e1		João Marques-Silva, Karem A. Sakallah (Eds.): Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings. Lecture Notes in Computer Science 4501, Springer 2007, isbn 978-3-540-72787-3
i1		João Marques-Silva, Jordi Planes: On Using Unsatisfiability for Solving Maximum Satisfiability. CoRR abs/0712.1097 (2007)
	2006
j13		Vasco M. Manquinho, João P. Marques Silva: On Using Cutting Planes in Pseudo-Boolean Optimization. JSAT 2(1-4): 209-219 (2006)
c53		Inês Lynce, João Marques-Silva: Efficient Haplotype Inference with Boolean Satisfiability. AAAI 2006: 104-109
c52		Oliver Kullmann, Inês Lynce, João Marques-Silva: Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel. SAT 2006: 22-35
c51		Inês Lynce, João Marques-Silva: SAT in Bioinformatics: Making the Case with Haplotype Inference. SAT 2006: 136-141
c50		António Morgado, Paulo J. Matos, Vasco M. Manquinho, João P. Marques Silva: Counting Models in Integer Domains. SAT 2006: 410-423
	2005
j12		Inês Lynce, João P. Marques Silva: Efficient data structures for backtrack search SAT solvers. Ann. Math. Artif. Intell. 43(1): 137-152 (2005)
j11		Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva: Heuristic-Based Backtracking Relaxation for Propositional Satisfiability. J. Autom. Reasoning 35(1-3): 3-24 (2005)
c49		João P. Marques Silva: Improvements to the Implementation of Interpolant-Based Model Checking. CHARME 2005: 367-370
c48		Vasco M. Manquinho, João P. Marques Silva: Effective Lower Bounding Techniques for Pseudo-Boolean Optimization. DATE 2005: 660-665
c47		António Morgado, João P. Marques Silva: Good Learning and Implicit Model Enumeration. ICTAI 2005: 131-136
c46		Vasco M. Manquinho, João P. Marques Silva: Satisfiability-Based Algorithms for Pseudo-Boolean Optimization Using Gomory Cuts and Search Restarts. ICTAI 2005: 150-155
c45		Vasco M. Manquinho, João P. Marques Silva: On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization. SAT 2005: 451-458
c44		Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João P. Marques Silva, Karem A. Sakallah: A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas. SAT 2005: 467-474
	2004
j10		Vasco M. Manquinho, João P. Marques Silva: Satisfiability-Based Algorithms for Boolean Optimization. Ann. Math. Artif. Intell. 40(3-4): 353-372 (2004)
c43		Inês Lynce, João P. Marques Silva: Hidden Structure in Unsatisfiable Random 3-SAT: An Empirical Study. ICTAI 2004: 246-251
c42		Vasco M. Manquinho, João P. Marques Silva: Integration of Lower Bound Estimates in Pseudo-Boolean Optimization. ICTAI 2004: 742-748
c41		Elsa Carvalho, João P. Marques Silva: Using Rewarding Mechanisms for Improving Branching Heuristics. SAT 2004
c40		Inês Lynce, João P. Marques Silva: On Computing Minimum Unsatisfiable Cores. SAT 2004
c39		Vasco M. Manquinho, João P. Marques Silva: Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization. SAT 2004
	2003
j9		Inês Lynce, João P. Marques Silva: An Overview of Backtrack Search Satisfiability Algorithms. Ann. Math. Artif. Intell. 37(3): 307-326 (2003)
j8		João P. Marques Silva, Luís Guerra e Silva: Solving Satisfiability in Combinational Circuits. IEEE Design & Test of Computers 20(4): 16-21 (2003)
c38		Ateet Bhalla, Inês Lynce, José T. de Sousa, João P. Marques Silva: Heuristic-Based Backtracking for Propositional Satisfiability. EPIA 2003: 116-130
c37		Inês Lynce, João P. Marques Silva: Probing-Based Preprocessing Techniques for Propositional Satisfiability. ICTAI 2003: 105-
c36		Ateet Bhalla, Inês Lynce, José T. de Sousa, João P. Marques Silva: Heuristic Backtracking Algorithms for SAT. MTV 2003: 69-74
	2002
j7		Vasco M. Manquinho, João P. Marques Silva: Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem. IEEE Trans. on CAD of Integrated Circuits and Systems 21(5): 505-516 (2002)
j6		Luís Guerra e Silva, João P. Marques Silva, Luis Miguel Silveira, Karem A. Sakallah: Satisfiability models and algorithms for circuit delay computation. ACM Trans. Design Autom. Electr. Syst. 7(1): 137-158 (2002)
c35		Inês Lynce, João P. Marques Silva: The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms. International Workshop on Constraint Solving and Constraint Logic Programming 2002: 144-158
c34		Inês Lynce, João P. Marques Silva: Tuning Randomization in Backtrack Search SAT Algorithms. CP 2002: 769
c33		Inês Lynce, João P. Marques Silva: Building State-of-the-Art SAT Solvers. ECAI 2002: 166-170
	2001
j5		Inês Lynce, Luís Baptista, João Marques-Silva: Stochastic Systematic Search Algorithms for Satisfiability. Electronic Notes in Discrete Mathematics 9: 190-204 (2001)
j4		Arlindo L. Oliveira, João P. Marques Silva: Efficient Algorithms for the Inference of Minimum Size DFAs. Machine Learning 44(1/2): 93-119 (2001)
j3		Paulo F. Flores, Horácio C. Neto, João P. Marques Silva: An exact solution to the minimum size test pattern problem. ACM Trans. Design Autom. Electr. Syst. 6(4): 629-644 (2001)
c32		Inês Lynce, João P. Marques Silva: Improving SAT Algorithms by Using Search Pruning Techniques. CP 2001: 770
c31		Inês Lynce, Luís Baptista, João P. Marques Silva: Towards Provably Complete Stochastic Search Algorithms for Satisfiability. EPIA 2001: 363-370
c30		José T. de Sousa, João P. Marques Silva, Miron Abramovici: A Configurable Hardware/Software Approach to SAT Solving. FCCM 2001: 239-248
	2000
c29		Vasco M. Manquinho, João P. Marques Silva: On Solving Boolean Optimization with Satisfiability-Based Algorithms. AMAI 2000
c28		João P. Marques Silva, Karem A. Sakallah: Invited Tutorial: Boolean Satisfiability Algorithms and Applications in Electronic Design Automation. CAV 2000: 3
c27		Luís Baptista, João P. Marques Silva: Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability. CP 2000: 489-494
c26		João P. Marques Silva: Algebraic Simplification Techniques for Propositional Satisfiability. CP 2000: 537-542
c25		João P. Marques Silva, Karem A. Sakallah: Boolean satisfiability in electronic design automation. DAC 2000: 675-680
c24		Vasco M. Manquinho, João P. Marques Silva: On Using Satisfiability-Based Pruning Techniques in Covering Algorithms. DATE 2000: 356-363
c23		Joonyoung Kim, Jesse Whittemore, Karem A. Sakallah, João P. Marques Silva: On Applying Incremental Satisfiability to Delay Fault Testing. DATE 2000: 380-384
c22		Karem A. Sakallah, Fadi A. Aloul, João P. Marques Silva: An Experimental Study of Satisfiability Search Heuristics. DATE 2000: 745
c21		Vasco M. Manquinho, João P. Marques Silva: Search Pruning Conditions for Boolean Optimization. ECAI 2000: 103-107
c20		João P. Marques Silva, Paulo Guedes: Ship Hull Hydrodynamic Analysis Using Distributed Shared Memory. PARA 2000: 366-372
	1999
j2		João P. Marques Silva, Karem A. Sakallah: GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Trans. Computers 48(5): 506-521 (1999)
c19		João P. Marques Silva, Thomas Glass: Combinational Equivalence Checking Using Satisfiability and Recursive Learning. DATE 1999: 145-149
c18		Luís Guerra e Silva, Luis Miguel Silveira, João P. Marques Silva: Algorithms for Solving Boolean Satisfiability in Combinational Circuits. DATE 1999: 526-530
c17		João P. Marques Silva: The Impact of Branching Heuristics in Propositional Satisfiability Algorithms. EPIA 1999: 62-74
c16		Paulo F. Flores, Horácio C. Neto, João P. Marques Silva: On Applying Set Covering Models to Test Set Compaction. Great Lakes Symposium on VLSI 1999: 8-11
c15		Joonyoung Kim, João P. Marques Silva, Karem A. Sakallah: Satisfiability-Based Functional Delay Fault Testing. VLSI 1999: 362-372
c14		Paulo F. Flores, Horácio C. Neto, K. Chakrabarty, João P. Marques Silva: Test pattern generation for width compression in BIST. ISCAS (1) 1999: 114-118
c13		Paulo F. Flores, José C. Costa, Horácio C. Neto, José C. Monteiro, João P. Marques Silva: Assignment and Reordering of Incompletely Specified Pattern Sequences Targetting Minimum Power Dissipation. VLSI Design 1999: 37-41
	1998
c12		João P. Marques Silva: Integer Programming Models for Optimization Problems in Test Generation. ASP-DAC 1998: 481-487
c11		Paulo F. Flores, Horácio C. Neto, João P. Marques Silva: An exact solution to the minimum size test pattern problem. ICCD 1998: 510-515
c10		Arlindo L. Oliveira, João P. Marques Silva: Efficient Search Techniques for the Inference of Minimum Size Finite Automata. SPIRE 1998: 81-89
	1997
c9		João P. Marques Silva, Karem A. Sakallah: Robust Search Algorithms for Test Pattern Generation. FTCS 1997: 152-161
c8		Vasco M. Manquinho, Paulo F. Flores, João P. Marques Silva, Arlindo L. Oliveira: Prime Implicant Computation Using Satisfiability Algorithms. ICTAI 1997: 232-239
	1996
j1		Michael A. Riepe, João P. Marques Silva, Karem A. Sakallah, Richard B. Brown: Ravel-XL: a hardware accelerator for assigned-delay compiled-code logic gate simulation. IEEE Trans. VLSI Syst. 4(1): 113-129 (1996)
c7		João P. Marques Silva, Karem A. Sakallah: GRASP - a new search algorithm for satisfiability. ICCAD 1996: 220-227
c6		João P. Marques Silva, Karem A. Sakallah: Conflict Analysis in Search Algorithms for Satisfiability. ICTAI 1996: 467-469
	1994
c5		João P. Marques Silva, Karem A. Sakallah: Dynamic Search-Space Pruning Techniques in Path Sensitization. DAC 1994: 705-711
c4		João P. Marques Silva, Karem A. Sakallah: Efficient and Robust Test Generation-Based Timing Analysis. ISCAS 1994: 303-306
	1993
c3		João P. Marques Silva, Karem A. Sakallah: An Analysis of Path Sensitization Criteria. ICCD 1993: 68-72
c2		Michael A. Riepe, João P. Marques Silva, Karem A. Sakallah, Richard B. Brown: Ravel-XL: A Hardware Accelerator for Assigned-Delay Compiled-Code Logic Gate Simulation. ICCD 1993: 361-364
	1991
c1		João P. Marques Silva, Karem A. Sakallah, Luís M. Vidigal: FPD - An Environment for Exact Timing Analysis. ICCAD 1991: 212-215

Coauthor Index

Last update Sun May 19 01:53:57 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page