Sciweavers

2007 search results - page 313 / 402
» Using general-purpose programming languages for FPGA design
Sort
View
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 2 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
VEE
2012
ACM
222views Virtualization» more  VEE 2012»
13 years 5 months ago
Unpicking the knot: teasing apart VM/application interdependencies
Flexible and efficient runtime design requires an understanding of the dependencies among the components internal to the runtime and those between the application and the runtime...
Yi Lin, Stephen M. Blackburn, Daniel Frampton
ADAEUROPE
2001
Springer
15 years 2 months ago
Transaction Support for Ada
This paper describes the transaction support framework OPTIMA and its implementation for Ada 95. First, a transaction model that fits concurrent programming languages is presented...
Jörg Kienzle, Ricardo Jiménez-Peris, A...
ASPLOS
2010
ACM
15 years 4 months ago
ParaLog: enabling and accelerating online parallel monitoring of multithreaded applications
Instruction-grain lifeguards monitor the events of a running application at the level of individual instructions in order to identify and help mitigate application bugs and securi...
Evangelos Vlachos, Michelle L. Goodstein, Michael ...
PLDI
2009
ACM
15 years 4 months ago
Stretching transactional memory
Transactional memory (TM) is an appealing abstraction for programming multi-core systems. Potential target applications for TM, such as business software and video games, are like...
Aleksandar Dragojevic, Rachid Guerraoui, Michal Ka...