Characterising Combinational Timing Analyses in Intuitionistic Modal Logic

Characterising Combinational Timing Analyses in Intuitionistic Modal Logic (2000)

Cached

Download Links

[www.dcs.shef.ac.uk]

Other Repositories/Bibliography

DBLP

by M. Mendler

Citations:

3 - 2 self

BibTeX

@MISC{Mendler00characterisingcombinational,
    author = {M. Mendler},
    title = {Characterising Combinational Timing Analyses in Intuitionistic Modal Logic},
    year = {2000}
}

Bookmark

OpenURL

Abstract

The paper presents a new logical specification language, called Propositional Stabilisation Theory (PST), to capture the stabilisation behaviour of combinational input-output systems. PST is an intuitionistic propositional modal logic interpreted over sets of waveforms. The language is more economic than conventional specification formalisms such as timed Boolean functions, temporal logic, or predicate logic in that it separates function from time and only introduces as much syntax as is necessary to deal with stabilisation behaviour. It is a purely propositional system but has secondorder expressiveness. One and the same Boolean function can be represented in various ways as a PST formula, giving rise to different timing models which associate different stabilisation delays with different parts of the functionality and adjust the granularity of the data-dependency of delays within wide margins. We show how several standard timing analyses can be characterised as algorithms computing c...

Citations

651	Notions of computation and monads - Moggi - 1991
150	Synchronization and Linearity - Baccelli, Cohen, et al. - 1992
67	Intuitionnistic logic - Dalen - 1986
59	A propositional calculus with denumerable matrix - Dummett - 1959
57	Analysis of cyclic combinational circuits - Malik - 1994
53	Propositional lax logic - Fairtlough, Mendler - 1997
51	Computational types from a logical perspective - Benton, Bierman, et al. - 1998
39	detection in combinational and sequential switching circuits - Hazard - 1965
38	Path Sensitization in Critical Path Problem - Chen, Du - 1993
29	Efficient Algorithms for Computing the Longest Viable Path in a Combinational Network - McGeer, Brayton - 1989
26	Certified Timing Verification and the Transition Delay of a Logic Circuit - Devadas, Keutzer, et al. - 1992
20	Timing Verification Using Statically Sensitizable Paths - Benkoski, Meersch, et al. - 1990
20	On the general false path problem in timing analysis - Du, Yen, et al. - 1989
20	Static Timing Analysis of Dynamically Sensitizable Paths - Perremans, Claesen, et al. - 1989
19	The elimination theorem when modality is present - Curry - 1952
16	Brayton: Timed Boolean Functions: A Unified Formalism for Exact Timing Analysis - Lam, K - 1994
15	Klassische und nicht-klassische Aussagenlogik - Rautenberg - 1979
13	Application of ternary algebra to the study of static hazards - Yoeli, Rinon - 1964
12	Delay Computation in Combinational Logic Circuits: Theory and Algorithms - Devadas, Keutzer, et al. - 1991
12	Grothendieck topology as geometric modality - Goldblatt - 1981
11	Eine Unableitbarkeitsbeweismethode für den intuitionistischen - Kreisel, Putnam - 1957
9	Circuit delay models and their exact computation using timed boolean functions - Lam, Brayton, et al. - 1993
9	On interpretation of logic formulas by means of finite problems - Medvedev - 1966
9	Ternary simulation: A refinement of binary functions or an abstraction of real-time behaviour - Mendler, Fairtlough - 1996
8	Sehtman. Impossibility of finite axiomatization of Medvedev’s logic of finite problems. Doklady Akademii Nauk SSSR - Maksimova, Skvorcov, et al. - 1979
7	Modal operators on Heyting algebras - Macnab - 1981
6	A new approach to solving false path problem in timing analysis - Huang, Parng, et al. - 1991
6	Sakallah, “An analysis of path sensitization criteria - Silva, A
6	Static Timing Analysis Using Interval Constraints - Stewart, Benkoski - 1991
5	Timing analysis of combinational circuits in intuitionistic propositional logic - Mendler
5	FPD: An Environment for Exact Timing Analysis - Silva, Sakallah, et al. - 1991
4	Provably correct critical paths - McGeer, Brayton - 1989
4	Some results on intermediate constructive logics. Notre Dame - Miglioli, Moscato, et al. - 1989
2	On the use of reconvergence analysis for efficient hierarchical static sensitizable path analysis - Johannes, Claesen, et al. - 1993
2	A comparison of path sensitization criteria for timing analysis - Silva, Sakallah - 1993
2	Sensitization networks for accurate timing analysis - Silva, Sakallah - 1993
2	A high-level dataflow system - Verdoscia, Vaccaro - 1998
1	Cavin III. Optimal clocking for wave pipelined operation in multistage systems with feedback - Gray, K - 1993