Sciweavers

430 search results - page 61 / 86
» Extracting Computer Algebra Programs from Statements
Sort
View
SIGSOFT
2010
ACM
13 years 5 months ago
Language-based replay via data flow cut
A replay tool aiming to reproduce a program's execution interposes itself at an appropriate replay interface between the program and the environment. During recording, it log...
Ming Wu, Fan Long, Xi Wang, Zhilei Xu, Haoxiang Li...
ISOLA
2010
Springer
13 years 5 months ago
Context-Sensitivity in IPET for Measurement-Based Timing Analysis
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...
Michael Zolda, Sven Bünte, Raimund Kirner
CONCURRENCY
1998
139views more  CONCURRENCY 1998»
13 years 7 months ago
Applications experience in Jade
This paper presents our experience developing applications in Jade, a portable, implicitly parallel programming language designed for exploiting task-level concurrency. Jade progr...
Martin C. Rinard
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
13 years 7 months ago
Conservative swept volume boundary approximation
We present a novel technique for approximating the boundary of a swept volume. The generator given by an input triangle mesh is rendered under all rigid transformations of a discr...
Andreas von Dziegielewski, R. Erbes, Elmar Sch&oum...
POPL
2009
ACM
14 years 2 months ago
Speculative N-Way barriers
Speculative execution is an important technique that has historically been used to extract concurrency from sequential programs. While techniques to support speculation work well ...
Lukasz Ziarek, Suresh Jagannathan, Matthew Fluet, ...