Sciweavers

257 search results - page 41 / 52
» Programming with narrowing: A tutorial
Sort
View
ICTAC
2004
Springer
14 years 1 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
FLOPS
2006
Springer
13 years 11 months ago
Contracts as Pairs of Projections
Abstract. Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. In 2002, Findler and Felleisen showed...
Robert Bruce Findler, Matthias Blume
POPL
2003
ACM
14 years 8 months ago
From symptom to cause: localizing errors in counterexample traces
There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom...
Thomas Ball, Mayur Naik, Sriram K. Rajamani
ICCAD
2003
IEEE
143views Hardware» more  ICCAD 2003»
14 years 4 months ago
Fractional Cut: Improved Recursive Bisection Placement
In this paper, we present improvements to recursive bisection based placement. In contrast to prior work, our horizontal cut lines are not restricted to row boundaries; this avoid...
Ameya R. Agnihotri, Mehmet Can Yildiz, Ateen Khatk...
PPPJ
2009
ACM
14 years 2 months ago
Automatic parallelization for graphics processing units
Accelerated graphics cards, or Graphics Processing Units (GPUs), have become ubiquitous in recent years. On the right kinds of problems, GPUs greatly surpass CPUs in terms of raw ...
Alan Leung, Ondrej Lhoták, Ghulam Lashari