Sciweavers

674 search results - page 34 / 135
» Explanation Based Program Transformation
Sort
View
CASES
2010
ACM
13 years 8 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
HPCC
2009
Springer
14 years 2 months ago
On the Performance of Commit-Time-Locking Based Software Transactional Memory
Compared with lock-based synchronization techniques, Software Transactional Memory (STM) can significantly improve the programmability of multithreaded applications. Existing res...
Zhengyu He, Bo Hong
CC
2004
Springer
177views System Software» more  CC 2004»
14 years 3 months ago
Value-Based Partial Redundancy Elimination
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
Thomas VanDrunen, Antony L. Hosking
IJCAI
1993
13 years 11 months ago
A Metalogic Programming Approach to Reasoning about Time in Knowledge Bases
The problem of representing and reasoning about two notions of time that are relevant in the context of knowledge bases is addressed. These are called historical time and belief t...
Suryanarayana M. Sripada
INTERACT
2003
13 years 11 months ago
Programmorphosis: a Knowledge-Based Approach to End-User Programming
: Whereas sophisticated computer users can exercise more control in what they are exposed to and produce computational artifacts, technologically challenged end-users assume a more...
Andri Ioannidou