Sciweavers

6120 search results - page 173 / 1224
» The Power of Linear Functions
Sort
View
ESORICS
2011
Springer
14 years 6 months ago
Linear Obfuscation to Combat Symbolic Execution
Abstract. Trigger-based code (malicious in many cases, but not necessarily) only executes when specific inputs are received. Symbolic execution has been one of the most powerful t...
Zhi Wang, Jiang Ming, Chunfu Jia, Debin Gao
DBPL
1997
Springer
87views Database» more  DBPL 1997»
15 years 10 months ago
Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions
We examine the power of incremental evaluation systems that use an SQL-like language for maintaining recursively-de ned views. We show that recursive queries such as transitive clo...
Leonid Libkin, Limsoon Wong
ACISP
2000
Springer
15 years 10 months ago
Two-Stage Optimisation in the Design of Boolean Functions
This paper shows how suitable choice of cost function can significantly affect the power of optimisation methods for the synthesising of Boolean functions. In particular we show ...
John A. Clark, Jeremy Jacob
JUCS
2007
120views more  JUCS 2007»
15 years 6 months ago
Compile-time Computation of Polytime Functions
: We investigate the computational power of C++ compilers. In particular, it is known that any partial recursive function can be computed at compile time, using the template mechan...
Emanuele Covino, Giovanni Pani, Daniele Scrimieri
GLVLSI
2010
IEEE
156views VLSI» more  GLVLSI 2010»
15 years 11 months ago
A multi-level approach to reduce the impact of NBTI on processor functional units
NBTI is one of the most important silicon reliability problems facing processor designers today. The impact of NBTI can be mitigated at both the circuit and microarchitecture leve...
Taniya Siddiqua, Sudhanva Gurumurthi