Mendler, M., Timing analysis of combinational circuits in intuitionistic propositional logic, Formal Methods in System Design 17 (2000), pp. 5--37. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Extracting Exact Time Bounds From Logical Proofs - Ferrari, Fiorentini, Ornaghi (Correct)
....on them, and we show a calculus that is valid with respect to this semantics and allows us to prove functional correctness while evaluating, at the same time, exact delays. Finally, in Section 4 we brie y discuss the logical aspects of the proposed semantics. 133 2 Waveforms and Circuits As in [7,8], a signal is a discrete timed boolean function 2 N B. A circuit is characterized by a set S of observables and a waveform is a map V 2 S N B associating with every observable a signal. A waveform represents an observable property of a circuit C, and an (observable) behavior of C is a set ....
....ned as expected. As for the negation, the above semantics de nes it as a constructive negation and the validity of :A is de ned recursively on the structure of A (see [10] We remark that t; V :2B is stronger than t; V 6 2B. See Section 3 for a comparison between our semantics and the one of [7,8]. A logical characterization of stable and eventually stable waveforms is the following: V is stable i 0; V A :A for every formula A, and V is eventually stable i 0; V 2A :2A for every formula A. If V is an eventually stable waveform, we can associate with it the classical ....
[Article contains additional citation context not shown here]
M. Mendler. Timing analysis of combinational circuits in intuitionistic propositional logic. Formal Methods in System Design, 17(1):5-37, 2000.
Characterising Combinational Timing Analyses in Intuitionistic.. - Mendler (2000) (1 citation) (Correct)
....be shown, however, that if we abstract from the realisers the resulting extensional semantics can be captured equivalently in terms of a class of Kripke constraint models. An indication of this will be given in Section 4.2. A more detailed presentation of this extensional semantics can be found in [25], albeit for a slightly more restrictive setting. 2.1 Syntax The formulas of PST are generated by the language : true j false j a = 0 j a = 1 j j j oe j fl ; Characterising Combinational Timing Analyses in Intuitionistic Modal Logic 5 where a ranges over a countably infinite ....
M. Mendler. Timing analysis of combinational circuits in intuitionistic propositional logic. Formal Methods in System Design, to appear 1999. A short preliminary version was presented at TABLEAUX'96, Springer, LNAI 1071, pp. 261--277.
Improving Constructiveness in Code Generators - Schneider, Brandt, Schuele.. (2005) (Correct)
No context found.
Mendler, M., Timing analysis of combinational circuits in intuitionistic propositional logic, Formal Methods in System Design 17 (2000), pp. 5--37.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC