BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Israel
2 × France
8 × USA
Collaborated with:
A.Pardo F.Somenzi E.Macii H.Cho M.R.Lightner A.L.Sangiovanni-Vincentelli R.I.Bahar M.Poncino J.Jang I.Moon C.Pixley S.Jeong A.R.Newton C.Wang H.Jin D.Gregory K.A.Bartlett A.J.d.Geus B.Plessier S.Manne R.K.Brayton A.Aziz S.Cheng S.A.Edwards S.P.Khatri Y.Kukimoto S.Qadeer R.K.Ranjan S.Sarwary T.R.Shiple G.Swamy T.Villa
Talks about:
algorithm (4) state (4) model (4) check (4) techniqu (2) approxim (2) abstract (2) travers (2) circuit (2) automat (2)

Person: Gary D. Hachtel

DBLP DBLP: Hachtel:Gary_D=

Contributed to:

DAC 20042004
DATE 20002000
DAC 19981998
CAV 19971997
CAV 19961996
DAC 19951995
DAC 19941994
EDAC-ETC-EUROASIC 19941994
DAC 19931993
DAC 19921992
DAC 19861986
DAC 19821982

Wrote 15 papers:

DAC-2004-WangJHS #bound #model checking #satisfiability
Refining the SAT decision ordering for bounded model checking (CW, HJ, GDH, FS), pp. 535–538.
DATE-2000-JangMH #model checking
Iterative Abstraction-Based CTL Model Checking (JYJ, IHM, GDH), pp. 502–507.
DAC-1998-PardoH #incremental #model checking #using
Incremental CTL Model Checking Using BDD Subsetting (AP, GDH), pp. 457–462.
CAV-1997-PardoH #abstraction #automation #calculus #model checking #μ-calculus
Automatic Abstraction Techniques for Propositional μ-calculus Model Checking (AP, GDH), pp. 12–23.
CAV-1996-BraytonHSSACEKKPQRSSSV #named #synthesis #verification
VIS: A System for Verification and Synthesis (RKB, GDH, ALSV, FS, AA, STC, SAE, SPK, YK, AP, SQ, RKR, SS, TRS, GS, TV), pp. 428–432.
DAC-1995-MannePBHSMP
Computing the Maximum Power Cycles of a Sequential Circuit (SM, AP, RIB, GDH, FS, EM, MP), pp. 23–28.
DAC-1994-HachtelMPS #analysis #finite #probability #scalability #state machine
Probabilistic Analysis of Large Finite State Machines (GDH, EM, AP, FS), pp. 270–275.
EDAC-1994-BaharCHMS #analysis #using
Timing Analysis of Combinational Circuits using ADD’s (RIB, HC, GDH, EM, FS), pp. 625–629.
EDAC-1994-ChoHMPS #algorithm #approximate #automaton #composition #traversal
A State Space Decomposition Algorithm for Approximate FSM Traversal (HC, GDH, EM, MP, FS), pp. 137–141.
EDAC-1994-HachtelMPS #algorithm #finite #state machine
Symbolic Algorithms to Calculate Steady-State Probabilities of a Finite State Machine (GDH, EM, AP, FS), pp. 214–218.
DAC-1993-ChoHMPS #algorithm #approximate #automaton #traversal
Algorithms for Approximate FSM Traversal (HC, GDH, EM, BP, FS), pp. 25–30.
DAC-1992-PixleyJH #diagrams #sequence
Exact Calculation of Synchronization Sequences Based on Binary Decision Diagrams (CP, SWJ, GDH), pp. 620–623.
DAC-1986-GregoryBGH #automation #logic #named #optimisation
SOCRATES: a system for automatically synthesizing and optimizing combinational logic (DG, KAB, AJdG, GDH), pp. 79–85.
DAC-1982-HachtelNS #array #logic #programmable
Techniques for programmable logic array folding (GDH, ARN, ALSV), pp. 147–155.
DAC-1982-LightnerH #algorithm #functional #megamodelling #testing
Implication algorithms for MOS switch level functional macromodeling implication and testing (MRL, GDH), pp. 691–698.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.