Malung complex timing relationships readable:presburger formula simplification using don't cares

Proceedings - Design Automation Conference

Volumn , Issue , 1998, Pages 586-590

  Amont, Tod ^a   Borriellot, Gaetano ^b   Liut, Jiwen ^a  

^a TEXAS STATE UNIVERSITY   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC SYNTHESIS; TIMING CIRCUITS; BOOLEAN FUNCTIONS; LOGIC CIRCUITS; OPTIMIZATION;

BOOLEAN RELATIONS; COMPLEX RELATIONSHIPS; DON'T-CARES; LINEAR RELATIONSHIPS; LOGIC MINIMIZATION; PRESBURGER; RELATIONSHIP ANALYSIS;

BOOLEAN ALGEBRA; TIMING CIRCUITS;

COMPLEX TIMING RELATIONSHIP; LOGIC MINIMIZATION METHODS; PRESBURGER FORMULAS;

EID: 0031638153     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. T. Amon and G. Borriello. An approach to symbolic timing verification. In Proc. ACM/IEEE Design Automation Conference (DAC), June 1992.
2. T. Amon, G. Borriello, D. Hu, and J. Liu. Symbolic timing verification of timing diagrams using presburger formulas. In Proc. ACM/IEEE Design Automation Conference (DAC), June 1997.
3. Tevfik Bultan, Richard Gerber, and William Pugh. Symbolic model checking of infinite state programs using presburger arithmetic. Technical Report UMIACS-TR-96-66, University of Maryland, September 1996.
4. D. C. Cooper. Programs for mechanical program vilification. In Machine Intelligence 6, 1971.
5. Wayne Kelly and William Pugh. Determining schedules based on performance estimation. In Parallel Processing Letters, September 1994.
6. Wayne Kelly and William Pugh. Finding legal reordering transformations using mappings. In Seventh International Workshop on Languages and Compilers for Parallel Computing, August 1994.
7. K. L. McMillan and D. L. Dill. Algorithms for interface timing verification. In Proc. International Conf Computer Design (lCCD), October 1992.
8. n upper bound on the complexity of presburger arithmetic. In Journal of Computer and System Sciences, July 1978.
9. William Pugh. A practical algorithm for exact array dependence analysis. Communications of the ACM, 35(8), August 1992.
10. William Pugh et al. The omega project. In URL: http://www.cs.umd.edu/projects/omega.
11. William Pugh and David Wonnacott. An exact method for the analysis of value-based array data dependences. In Proc. 6th Workshop on Programming Languages and Compilers for Parallel Computing, August 1993.
12. E. M. Sentovich et al. SIS: A system for sequential circuit synthesis. Technical Report UCB/ERL M92/41, UC Berkeley, May 1992. see http://www-cad.eecs.berkeley.edu/Software/.
13. P. Vanbekbergen, G. Goossens, and H. De Man. Specification and analysis of timing constraints in signal transition graphs. In European Design Automation Conference, March 1992.
14. E. Walkup and G. Borriello. Interface timing verification with application to synthesis. In Proc. ACM/IEEE Design Automation Conference (DAC) June 1994.
15. Elizabeth A. Walkup. Optimization of Linear Max-Plus Systems with Application to Timing Analysis. Ph.D. thesis, University of Washington, 1995.