Sciweavers

366 search results - page 47 / 74
» Four equivalent equivalences of reductions
Sort
View
CONCUR
2006
Springer
15 years 2 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
103
Voted
CSL
2008
Springer
15 years 2 months ago
On the Almighty Wand
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
Rémi Brochenin, Stéphane Demri, &Eac...
104
Voted
DATE
2008
IEEE
118views Hardware» more  DATE 2008»
15 years 2 months ago
Layout Level Timing Optimization by Leveraging Active Area Dependent Mobility of Strained-Silicon Devices
Advanced MOSFETs such as Strained Silicon (SS) devices have emerged as critical enablers to keep Moore's law on track for sub100nm technologies. Use of Strained Silicon devic...
Ashutosh Chakraborty, Sean X. Shi, David Z. Pan
FLOPS
2008
Springer
15 years 2 months ago
Rewriting and Call-Time Choice: The HO Case
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
Francisco Javier López-Fraguas, Juan Rodr&i...
107
Voted
APAL
2007
79views more  APAL 2007»
15 years 25 days ago
A completeness result for a realisability semantics for an intersection type system
In this paper we consider a type system with a universal type ω where any term (whether open or closed, β-normalising or not) has type ω. We provide this type system with a rea...
Fairouz Kamareddine, Karim Nour