A Timing Refinement of Intuitionistic Proofs and its Application to the Timing Analysis of Combinational Circuits (1996)

Cached

Download Links

by Michael Mendler
Venue:PROCEEDINGS OF THE 5TH INTERNATIONAL WORKSHOP ON THEOREM PROVING WITH ANALYTIC TABLEAUX AND RELATED METHODS
Citations:5 - 3 self

Documents Related by Co-Citation

18 An intuitionistic modal logic with applications to the formal verification of hardware – M Fairtlough, M Mendler - 1995
1739 Foundations of logic programming – J W Lloyd
51 Computational Types from a Logical Perspective I – P.N. Benton, G.M. Bierman, V.C.V. de Paiva - 1995
4 Ternary simulation of binary gate networks – M Yoeli, J A Brzozowski - 1977
7 Equivalence of the Arbiter, the Synchronized, the Latch and the Inertial Delay – J C Barros, B W Johnson - 1983
12 On a Ternary Model of Gate Networks – J Brzozowski, M Yoeli - 1979
13 Newtonian arbiters cannot be proven correct – M Mendler, T Stroup - 1992
13 Application of ternary algebra to the study of static hazards – M Yoeli, S Rinon - 1964
11 A Note on Three-Valued Logic Simulation – M Breuer - 1972
39 detection in combinational and sequential switching circuits – Hazard - 1965
57 Analysis of cyclic combinational circuits – S Malik - 1994
57 Boolean analysis of MOS circuits – Randal E. Bryant - 1987
593 Introduction to Metamathematics – S C Kleene - 1971
149 Synchronization and Linearity – F Baccelli, G Cohen, G J Olsder, J P Quadrat
33 General theory of metastable operation – L R Marino - 1981
61 A proof-theoretic approach to logic programming. II. Programs as definitions – L Hallnäs, P Schroeder-Heister - 1991
12 A Modal Logic for Handling Behavioural Constraints in Formal Hardware Verification – M Mendler
3 Semantics of Constraint Logic Programs with Bounded Quantifiers – Martin Argenius - 1998
2 A General Computational Scheme for Constraint Logic Programming – John Darlington, Yike Guo, Qian Wu - 1991