Sciweavers

24 search results - page 4 / 5
» Automatic Complexity Analysis for Programs Extracted from Co...
Sort
View
GECCO
2008
Springer
115views Optimization» more  GECCO 2008»
13 years 6 months ago
A genetic programming approach to business process mining
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
Chris J. Turner, Ashutosh Tiwari, Jörn Mehnen
AFRICACRYPT
2009
Springer
14 years 16 days ago
Breaking KeeLoq in a Flash: On Extracting Keys at Lightning Speed
We present the first simple power analysis (SPA) of software implementations of KeeLoq. Our attack drastically reduces the efforts required for a complete break of remote keyless...
Markus Kasper, Timo Kasper, Amir Moradi, Christof ...
CAV
2009
Springer
209views Hardware» more  CAV 2009»
14 years 6 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 5 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
14 years 17 days ago
Recommending Join Queries via Query Log Analysis
— Complex ad hoc join queries over enterprise databases are commonly used by business data analysts to understand and analyze a variety of enterprise-wide processes. However, eff...
Xiaoyan Yang, Cecilia M. Procopiuc, Divesh Srivast...