Sciweavers

2432 search results - page 220 / 487
» Cryptographic logical relations
Sort
View
CORR
2008
Springer
92views Education» more  CORR 2008»
15 years 6 months ago
Branching Bisimilarity with Explicit Divergence
Abstract. We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original...
Rob J. van Glabbeek, Bas Luttik, Nikola Trcka
FPGA
2004
ACM
126views FPGA» more  FPGA 2004»
15 years 11 months ago
A synthesis oriented omniscient manual editor
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing a...
Tomasz S. Czajkowski, Jonathan Rose
LOGCOM
2008
94views more  LOGCOM 2008»
15 years 5 months ago
Preservation of Interpolation Features by Fibring
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
Walter Alexandre Carnielli, João Rasga, Cri...
ACTA
1998
81views more  ACTA 1998»
15 years 5 months ago
Dijkstra-Scholten Predicate Calculus: Concepts and Misconceptions
The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for correct programs. For proving the correctness of a program (i.e. the fact that...
Lex Bijlsma, Rob Nederpelt
GLVLSI
2009
IEEE
125views VLSI» more  GLVLSI 2009»
16 years 21 days ago
Timing-driven N-way decomposition
Logic decomposition has been extensively used to optimize the worst-case delay and the area in the technology independent phase. Bi-decomposition is one of the state-of-art techni...
David Bañeres, Jordi Cortadella, Michael Ki...