Sciweavers

10 search results - page 2 / 2
» Instruction sequences with indirect jumps
Sort
View
ICFP
2007
ACM
14 years 5 months ago
Faster laziness using dynamic pointer tagging
In the light of evidence that Haskell programs compiled by GHC exhibit large numbers of mispredicted branches on modern processors, we re-examine the "tagless" aspect of...
Simon Marlow, Alexey Rodriguez Yakushev, Simon L. ...
ICCD
2006
IEEE
103views Hardware» more  ICCD 2006»
14 years 2 months ago
Architectural Support for Run-Time Validation of Control Flow Transfer
—Current micro-architecture blindly uses the address in the program counter to fetch and execute instructions without validating its legitimacy. Whenever this blind-folded instru...
Yixin Shi, Sean Dempsey, Gyungho Lee
ISCAPDCS
2007
13 years 7 months ago
Architectural requirements of parallel computational biology applications with explicit instruction level parallelism
—The tremendous growth in the information culture, efficient digital searches are needed to extract and identify information from huge data. The notion that evolution in silicon ...
Naeem Zafar Azeemi
WCRE
2002
IEEE
13 years 10 months ago
Disassembly of Executable Code Revisited
Machine code disassembly routines form a fundamental component of software systems that statically analyze or modify executable programs. The task of disassembly is complicated by...
Benjamin Schwarz, Saumya K. Debray, Gregory R. And...
ESOP
2001
Springer
13 years 10 months ago
Proof-Directed De-compilation of Low-Level Code
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Shin-ya Katsumata, Atsushi Ohori