-
3
-
-
0031638153
-
Making complex timing relationships readable: Presburger formula simplification using don't cares
-
June
-
T. Amon, G. Borriello, and J. Liu. Making complex timing relationships readable: Presburger formula simplification using don't cares. In ACM/IEEE Design Automation Conference, June 1998.
-
(1998)
ACM/IEEE Design Automation Conference
-
-
Amon, T.1
Borriello, G.2
Liu, J.3
-
8
-
-
0003083237
-
Theorem proving in arithmetic without multiplication
-
D. C. Cooper. Theorem proving in arithmetic without multiplication. Machine Intelligence, 7:91-99, 1972.
-
(1972)
Machine Intelligence
, vol.7
, pp. 91-99
-
-
Cooper, D.C.1
-
13
-
-
0031249368
-
Bounded delay timing analysis of a class of CSP program
-
H. Hulgaard and S. M. Bums. Bounded delay timing analysis of a class of CSP program. Formal Methods in System Design, 11(3):265-294, 1997.
-
(1997)
Formal Methods in System Design
, vol.11
, Issue.3
, pp. 265-294
-
-
Hulgaard, H.1
Bums, S.M.2
-
14
-
-
2342418657
-
An algorithm for exact bounds on the time separation of events in concurrent systems
-
Nov.
-
H. Hulgaard, S. M. Bums, T. Amon, and G. Borriello. An algorithm for exact bounds on the time separation of events in concurrent systems. IEEE Transactions on Computers, 44(11): 1306-1317, Nov. 1995.
-
(1995)
IEEE Transactions on Computers
, vol.44
, Issue.11
, pp. 1306-1317
-
-
Hulgaard, H.1
Bums, S.M.2
Amon, T.3
Borriello, G.4
-
16
-
-
0000421548
-
The design of an asynchronous microprocessor
-
A. J. Martin, S. M. Bums, T. K. Lee, D. Borkovic, and P. J. Hazewindus. The design of an asynchronous microprocessor. In Advanced Research in VLSI: Proceedings of the Decennial Caltech Conference on VLSI, pages 351-373, 1989.
-
(1989)
Advanced Research in VLSI: Proceedings of the Decennial Caltech Conference on VLSI
, pp. 351-373
-
-
Martin, A.J.1
Bums, S.M.2
Lee, T.K.3
Borkovic, D.4
Hazewindus, P.J.5
-
19
-
-
84870980682
-
-
On
-
The Omega project. On http://www.cs.umd.edu/projects/omega/.
-
The Omega Project
-
-
-
20
-
-
0003825734
-
Predicting deterministic execution times of real-time programs
-
PhD thesis, University of Washington Available as
-
C.-Y. Park. Predicting Deterministic Execution Times of Real-Time Programs. PhD thesis, University of Washington, 1992. Available as Techical report # TR-92-08-02.
-
(1992)
Techical Report # TR-92-08-02
-
-
Park, C.-Y.1
-
21
-
-
0018454851
-
A practical decision procedure for arithmetic with function symbols
-
Apr.
-
R. E. Shostak. A practical decision procedure for arithmetic with function symbols. Journal of the ACM, 26(2):351-360, Apr. 1979.
-
(1979)
Journal of the ACM
, vol.26
, Issue.2
, pp. 351-360
-
-
Shostak, R.E.1
-
22
-
-
84988750098
-
Analyzing and improving the latency and throughput performance of self-timed pipelines and rings
-
May
-
T. E. Williams. Analyzing and improving the latency and throughput performance of self-timed pipelines and rings. In Proc. International Symposium on Circuits and Systems, May 1992.
-
(1992)
Proc. International Symposium on Circuits and Systems
-
-
Williams, T.E.1
-
23
-
-
17044397303
-
Performance of iterative computation in self-timed rings
-
Oct.
-
T. E. Williams. Performance of iterative computation in self-timed rings. Journal of VLSI Signal Processing, 6(3), Oct. 1993.
-
(1993)
Journal of VLSI Signal Processing
, vol.6
, Issue.3
-
-
Williams, T.E.1
|