Следене
Randal Bryant
Randal Bryant
Carnegie Mellon University
Потвърден имейл адрес: cs.cmu.edu - Начална страница
Заглавие
Позовавания
Позовавания
Година
Graph-based algorithms for boolean function manipulation
RE Bryant
Computers, IEEE Transactions on 100 (8), 677-691, 1986
133951986
Symbolic boolean manipulation with ordered binary-decision diagrams
RE Bryant
ACM Computing Surveys (CSUR) 24 (3), 293-318, 1992
32781992
Efficient implementation of a BDD package
KS Brace, RL Rudell, RE Bryant
ACM/IEEE Proc. 27th DAC, 40-45, 1990
1909*1990
Semantics-aware malware detection
M Christodorescu, S Jha, SA Seshia, D Song, RE Bryant
2005 IEEE symposium on security and privacy (S&P'05), 32-46, 2005
11762005
Computer systems: a programmer's perspective
R Bryant, DR O'Hallaron
Prentice Hall, 2003
841*2003
On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
RE Bryant
IEEE transactions on Computers 40 (2), 205-213, 1991
7781991
Verification of arithmetic circuits with binary moment diagrams
RE Bryant, YA Chen
Design Automation, 1995. DAC'95. 32nd Conference on, 535-541, 1995
6691995
Simulation of packet communication architecture computer systems
RE Bryant
Massachusetts Institute of Technology, 1977
5501977
A switch-level model and simulator for MOS digital systems
Bryant
IEEE Transactions on computers 100 (2), 160-177, 1984
5441984
Big-data computing: creating revolutionary breakthroughs in commerce, science and society
R Bryant, RH Katz, ED Lazowska
December, 2008
3902008
Formal verification by symbolic evaluation of partially-ordered trajectories
CJH Seger, RE Bryant
Formal Methods in System Design 6 (2), 147-189, 1995
3901995
COSMOS: A Compiled Simulator for MOS Circuits
RE Bryant, D Beatty, K Brace, K Cho, T Sheffler
24th ACM/IEEE Design Automation Conference, 9-16, 1987
3811987
Binary decision diagrams and beyond: Enabling technologies for formal verification
RE Bryant
Proceedings of IEEE International Conference on Computer Aided Design (ICCAD …, 1995
3801995
Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions
RE Bryant, SK Lahiri, SA Seshia
Computer Aided Verification: 14th International Conference, CAV 2002 …, 2002
3402002
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW
MN Velev, RE Bryant
Proceedings of the 38th annual design automation conference, 226-231, 2001
3142001
Boolean analysis of MOS circuits
RE Bryant
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 1987
2661987
Data-intensive supercomputing: The case for DISC
RE Bryant
technical report cmu-cs-07-128, carnegie mellon university, 2007
2422007
Symbolic manipulation of boolean functions using a graphical representation
RE Bryant
22nd ACM/IEEE Design Automation Conference, 688-694, 1985
2071985
Deciding bit-vector arithmetic with abstraction
RE Bryant, D Kroening, J Ouaknine, SA Seshia, O Strichman, B Brady
Tools and Algorithms for the Construction and Analysis of Systems: 13th …, 2007
2022007
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
RE Bryant, S German, MN Velev
ACM Transactions on Computational Logic (TOCL) 2 (1), 93-134, 2001
1702001
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20