A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1071, Issue , 1996, Pages 261-277

  Mendler, Michael ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL CIRCUITS; COMPUTER CIRCUITS; FORMAL LOGIC; INTEGRATED CIRCUITS; LOGIC CIRCUITS; RECONFIGURABLE HARDWARE; SEMANTICS; STABILIZATION; THEOREM PROVING;

EXPERIMENTAL PROTOTYPE; HARDWARE VERIFICATION; INTENSIONAL SEMANTICS; INTUITIONISTIC LOGIC; INTUITIONISTIC PROOFS; INTUITIONISTIC PROPOSITIONAL LOGIC; TEMPORAL OPERATORS; TIMING INFORMATION;

TIMING CIRCUITS;

EID: 21344433632     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61208-4_17     Document Type: Conference Paper

References (16)

1. ACM. International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, Intermar Hotel Malente, Germany, September 1993.
2. A. G. Dragalin. Mathematical Intuitionism. Introduction to Proof Theory. American Mathematical Society, 1988.
3. R. Dyckhoff. Contraction-free sequent calculi for intuitionistic logic. The Journal of Symbolic Logic, 57(3):795-807, September 1992.
4. M. Fairtlough and M. Mendler. An intuitionistic modal logic with applications to the formal verification of hardware. In Proceedings of the 1994 Annual Conference of the European Association for Computer Science Logic, pages 354-368. University of Warsawa, Springer, LNCS 933, 1995.
5. Torkel Franzén. Algorithmic aspects of intuitionistic propositional logic. Research Report SICS R87010, Swedish Institute of Computer Science, 1987.
6. G. Gentzen. Untersuchungen fiber das Logische Schlieflen. Math. Z., 39:176-210, 405-431, 1934-1935.
7. J. Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.
8. C. T. Gray, W. Liu, and R. K. Cavin III. Exact timing analysis considering data dependent delays. [1].
9. D. Gurr. Semantic Frameworks for Complexity. PhD thesis, Edinburgh University, Department of Computer Science, January 1991.
10. Lego. The Lego proof assistant, http://wmc.dcs.ed.ac.uk/packages/lego on the World Wide Web, 1995.
11. M. Mendler. Constrained proofs: a logic for dealing with behavioural constraints in formal hardware verification. In G. Jones and M. Sheeran, editors, Workshop on Designing Correct Circuits. Springer, 1991.
12. M. Mendler. A Modal Logic for Handling Behavioural Constraints in Formal Hardware Verification. PhD thesis, Department of Computer Science, University of Edinburgh, ECS-LFCS-93-255, March 1993.
13. M. Mendler. A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits. Technical Report MIP-9518, University of Passau, November 1995.
14. M. Mendler and M. Fairtlough. Ternary simulation: A refinement of binary functions or an abstraction of real-time behaviour? Technical Report MIP-9605, University of Passau, March 1996.
15. E. Moggi. Computational lambda-calculus and monads. In Proceedings LICS'89, pages 14-23, June 1989.
16. P. Tharau. BinProlog 3.45 User Guide. Departement d’Informatique, Université de Moncton, Canada, June 1995.