BibSLEIGH — Karem_A

Travelled to:

1 × Austria
1 × China
1 × Italy
15 × USA
3 × Germany
3 × United Kingdom
4 × France

Collaborated with:

J.P.M.Silva H.M.Sheini F.A.Aloul I.L.Markov M.H.Liffiton M.N.Mneimneh V.N.Kravets J.Whittemore Z.S.Andraus V.Chandramouli H.Katebi P.T.Darga J.Kim R.B.Brown S.Lee A.Ramani H.Yalcin R.Palermo M.Mortazavi C.Bamji B.D.Sierawski G.Nam R.A.Rutenbar P.N.Parakh T.N.Mudge K.Olukotun I.Lynce Y.Oh A.Chandna C.D.Kibler M.Roberts Z.Yang B.Al-Rawi X.Huang S.A.Smolka R.Grosu C.T.Weaver S.Chatterjee T.M.Austin J.P.Hayes

Talks about:

satisfi (12) symmetri (8) boolean (5) search (5) sat (5) unsatisfi (4) model (4) time (4) use (4) increment (3)

Person: Karem A. Sakallah

DBLP: Sakallah:Karem_A=

Facilitated 2 volumes:

Contributed to:

2014

2011

2010

2009

2008

2006

2005

2004

2003

2002

2001

2000

1999

1998

1996

1995

1994

1990

Wrote 39 papers:

CAV-2014-LeeS #abstraction #approximate #bound #reachability #scalability #verification: Unbounded Scalable Verification Based on Approximate Property-Directed Reachability and Datapath Abstraction (SL, KAS), pp. 849–865.
SAT-2011-KatebiSS #empirical #satisfiability: Empirical Study of the Anatomy of Modern Sat Solvers (HK, KAS, JPMS), pp. 343–356.
SAT-2010-KatebiSM #satisfiability #symmetry: Symmetry and Satisfiability: An Update (HK, KAS, ILM), pp. 113–127.
IFM-2009-YangASHSG #model checking #reduction: Dynamic Path Reduction for Software Model Checking (ZY, BAR, KAS, XH, SAS, RG), pp. 322–336.
SAT-2009-LiffitonS #satisfiability: Generalizing Core-Guided Max-SAT (MHL, KAS), pp. 481–494.
DAC-2008-DargaSM #performance #symmetry #using: Faster symmetry discovery using sparsity of symmetries (PTD, KAS, ILM), pp. 149–154.
SAT-2008-LiffitonS #satisfiability #set: Searching for Autarkies to Trim Unsatisfiable Clause Sets (MHL, KAS), pp. 182–195.
SAT-2006-SheiniS #modulo theories #satisfiability: From Propositional Satisfiability to Satisfiability Modulo Theories (HMS, KAS), pp. 1–9.
SAT-2006-SheiniS06a #modulo theories #satisfiability: A Progressive Simplifier for Satisfiability Modulo Theories (HMS, KAS), pp. 184–197.
DATE-2005-SheiniS #named #pseudo #satisfiability: Pueblo: A Modern Pseudo-Boolean SAT Solver (HMS, KAS), pp. 684–685.
SAT-2005-LiffitonS #on the #satisfiability: On Finding All Minimally Unsatisfiable Subformulas (MHL, KAS), pp. 173–186.
SAT-2005-MneimnehLASS #algorithm #bound #satisfiability: A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas (MNM, IL, ZSA, JPMS, KAS), pp. 467–474.
SAT-2005-SheiniS #integer #linear #logic #satisfiability #scalability: A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic (HMS, KAS), pp. 241–256.
DAC-2004-AndrausS #abstraction #automation #modelling #verification: Automatic abstraction and verification of verilog models (ZSA, KAS), pp. 218–223.
DAC-2004-DargaLSM #detection #symmetry: Exploiting structure in symmetry detection for CNF (PTD, MHL, KAS, ILM), pp. 530–534.
DAC-2004-OhMASM #named #satisfiability: AMUSE: a minimally-unsatisfiable subformula extractor (YO, MNM, ZSA, KAS, ILM), pp. 518–523.
DATE-v1-2004-RamaniAMS #graph #independence #symmetry: Breaking Instance-Independent Symmetries in Exact Graph Coloring (AR, FAA, ILM, KAS), pp. 324–331.
DAC-2003-AloulMS #named #performance #satisfiability #symmetry: Shatter: efficient symmetry-breaking for boolean satisfiability (FAA, ILM, KAS), pp. 836–839.
SAT-2003-MneimnehS #graph #scalability: Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution (MNM, KAS), pp. 411–425.
DAC-2002-AloulRMS #satisfiability #symmetry: Solving difficult SAT instances in the presence of symmetry (FAA, AR, ILM, KAS), pp. 731–736.
DAC-2002-AloulSS #how #named #question: Satometer: how much have we searched? (FAA, BDS, KAS), pp. 737–742.
DATE-2002-AloulMS #satisfiability #search-based #using: Search-Based SAT Using Zero-Suppressed BDDs (FAA, MNM, KAS), p. 1082.
DAC-2001-MneimnehAWCSA #hybrid #scalability #verification: Scalable Hybrid Verification of Complex Microprocessors (MNM, FAA, CTW, SC, KAS, TMA), pp. 41–46.
DAC-2001-WhittemoreKS #incremental #named #satisfiability: SATIRE: A New Incremental Satisfiability Engine (JW, JK, KAS), pp. 542–545.
DAC-2001-YalcinPMBSH #dependence #using: An Advanced Timing Characterization Method Using Mode Dependency (HY, RP, MM, CB, KAS, JPH), pp. 657–660.
DATE-2001-NamSR #approach #incremental #satisfiability: A boolean satisfiability-based incremental rerouting approach with application to FPGAs (GJN, KAS, RAR), pp. 560–565.
CAV-2000-Marques-SilvaS #algorithm #automation #design #satisfiability #tutorial: Invited Tutorial: Boolean Satisfiability Algorithms and Applications in Electronic Design Automation (JPMS, KAS), p. 3.
DAC-2000-SilvaS #automation #design #satisfiability: Boolean satisfiability in electronic design automation (JPMS, KAS), pp. 675–680.
DATE-2000-KimWSS #fault #incremental #on the #satisfiability #testing: On Applying Incremental Satisfiability to Delay Fault Testing (JK, JW, KAS, JPMS), pp. 380–384.
DATE-2000-KravetsS #symmetry #synthesis #using: Constructive Library-Aware Synthesis Using Symmetries (VNK, KAS), pp. 208–213.
DATE-2000-SakallahAS #case study #heuristic #satisfiability: An Experimental Study of Satisfiability Search Heuristics (KAS, FAA, JPMS), p. 745.
DAC-1999-YalcinMPBS #analysis #functional: Functional Timing Analysis for IP Characterization (HY, MM, RP, CB, KAS), pp. 731–736.
DAC-1998-KravetsS #logic #multi #named #synthesis: M32: A Constructive multilevel Logic Synthesis System (VNK, KAS), pp. 336–341.
DAC-1998-ParakhBS #polynomial: Congestion Driven Quadratic Placement (PNP, RBB, KAS), pp. 275–278.
DATE-1998-ChandramouliWS #analysis #functional #named: AFTA: A Formal Delay Model for Functional Timing Analysis (VC, JW, KAS), pp. 350–355.
DAC-1996-ChandramouliS #modelling #proximity: Modeling the Effects of Temporal Proximity of Input Transitions on Gate Propagation Delay and Transition Time (VC, KAS), pp. 617–622.
DAC-1995-ChandnaKBRS #compilation #ram: The Aurora RAM Compiler (AC, CDK, RBB, MR, KAS), pp. 261–266.
DAC-1994-SilvaS: Dynamic Search-Space Pruning Techniques in Path Sensitization (JPMS, KAS), pp. 705–711.
DAC-1990-SakallahMO #analysis #design: Analysis and Design of Latch-Controlled Synchronous Digital Circuits (KAS, TNM, KO), pp. 111–117.