Sciweavers

2432 search results - page 191 / 487
» Cryptographic logical relations
Sort
View
IJCAI
1993
15 years 2 months ago
Notes on Formalizing Context
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c, p). It asserts that the proposition p is true in the context c. The most important f...
John McCarthy
ICCD
2005
IEEE
100views Hardware» more  ICCD 2005»
15 years 10 months ago
Temporal Decomposition for Logic Optimization
Traditional approaches for sequential logic optimization include (1) explicit state-based techniques such as state minimization, (2) structural techniques such as retiming, and (3...
Nathan Kitchen, Andreas Kuehlmann
PLPV
2010
ACM
15 years 10 months ago
Free theorems for functional logic programs
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...
Jan Christiansen, Daniel Seidel, Janis Voigtlä...
108
Voted
GLVLSI
2009
IEEE
167views VLSI» more  GLVLSI 2009»
15 years 7 months ago
Dual-threshold pass-transistor logic design
This paper introduces pass-transistor logic design with dualthreshold voltages. A set of single-rail, fully restored, passtransistor gates are presented. Logic transistors are imp...
Lara D. Oliver, Krishnendu Chakrabarty, Hisham Z. ...
99
Voted
IAT
2009
IEEE
15 years 7 months ago
A New Semantics of Social Commitments Using Branching Space-Time Logic
—Commitments based on branching time logic are powerful representations for modeling multi-agent interactions. Current approaches into commitments have conceived these representa...
Mohamed El-Menshawy, Jamal Bentahar, Rachida Dssou...