Extracting exact time bounds from logical proofs

DOI10.1007/3-540-45607-4_14MaRDI QIDQ4808818zbMATH OpenFDO

Authors Mauro Ferrari, Camillo Fiorentini, Mario Ornaghi

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2372/23720245.htm

Mathematics Subject Classification ID

Recommendations

• A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits
• Formal Modeling and Analysis of Timed Systems
• Synthesis of delay-verifiable combinational circuits
• Constructive Boolean circuits and the exactness of timed ternary simulation
• scientific article; zbMATH DE number 791802

Cited in

(5)

• scientific article; zbMATH DE number 3860251 (Why is no real title available?)
• Characterising combinational timing analyses in intuitionistic modal logic
• A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits
• Optimization techniques for propositional intuitionistic logic and their implementation
• \(\mathcal {BCDL}\): Basic constructive description logic

This page was built for publication: Extracting exact time bounds from logical proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808818)