Sciweavers

7167 search results - page 543 / 1434
» Answer Set Programming
Sort
View
ENTCS
2007
124views more  ENTCS 2007»
15 years 4 months ago
Structuring Optimizing Transformations and Proving Them Sound
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker
TPDS
1998
114views more  TPDS 1998»
15 years 4 months ago
On the Automatic Parallelization of the Perfect Benchmarks
We present a set of advanced program parallelization techniques that are able to signi cantly improve the performance of application programs. We present evidence for this improve...
Rudolf Eigenmann, Jay Hoeflinger, David A. Padua
TPDS
1998
124views more  TPDS 1998»
15 years 4 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad
DSL
2009
15 years 2 months ago
CLOPS: A DSL for Command Line Options
Programmers often write custom parsers for the command line input of their programs. They do so, in part, because they believe that both their program's parameterization and t...
Mikolás Janota, Fintan Fairmichael, Viliam ...
TACAS
2012
Springer
263views Algorithms» more  TACAS 2012»
14 years 11 days ago
Reachability under Contextual Locking
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
Rohit Chadha, P. Madhusudan, Mahesh Viswanathan