Sciweavers

136 search results - page 13 / 28
» The Category Theoretic Solution of Recursive Program Schemes
Sort
View
PLDI
2009
ACM
14 years 3 months ago
PetaBricks: a language and compiler for algorithmic choice
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when considering different choices for data distributions, parallelism, transformati...
Jason Ansel, Cy P. Chan, Yee Lok Wong, Marek Olsze...
SIGDOC
2006
ACM
14 years 2 months ago
Handling objects: a scenario based approach
We report on the development of a tool which supports software programmers in programming to an interface by providing just in time (JIT) solutions. The development of the tool wa...
Thomas George Kannampallil, John M. Daughtry III
ACMSE
2006
ACM
14 years 2 months ago
A SAT-based solver for Q-ALL SAT
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
Ben Browning, Anja Remshagen
ACMSE
2011
ACM
12 years 8 months ago
Integrating digital logic design and assembly programming using FPGAs in the classroom
Rising Field Programmable Gate Array (FPGA) market volumes combined with increasing industrial popularity have driven prices down and improved capability to the point that FPGA ha...
William M. Jones, D. Brian Larkins
PLDI
1997
ACM
14 years 23 days ago
Componential Set-Based Analysis
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
Cormac Flanagan, Matthias Felleisen