Sciweavers

168 search results - page 24 / 34
» Making Applications Persistent at Run-time
Sort
View
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 7 months ago
Genome-scale disk-based suffix tree indexing
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
Benjarath Phoophakdee, Mohammed J. Zaki
ICFEM
2009
Springer
13 years 5 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
ICFP
2000
ACM
13 years 11 months ago
Fully reflexive intensional type analysis
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...
Valery Trifonov, Bratin Saha, Zhong Shao
DAC
2008
ACM
14 years 8 months ago
Automated hardware-independent scenario identification
Scenario-based design exploits the time-varying execution behavior of applications by dynamically adapting the system on which they run. This is a particularly interesting design ...
Juan Hamers, Lieven Eeckhout
PPOPP
2006
ACM
14 years 1 months ago
McRT-STM: a high performance software transactional memory system for a multi-core runtime
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...
Bratin Saha, Ali-Reza Adl-Tabatabai, Richard L. Hu...