Sciweavers

481 search results - page 42 / 97
» Differential symbolic execution
Sort
View
POPL
2010
ACM
15 years 10 months ago
A simple, verified validator for software pipelining
Software pipelining is a loop optimization that overlaps the execution of several iterations of a loop to expose more instruction-level parallelism. It can result in first-class p...
Jean-Baptiste Tristan, Xavier Leroy
84
Voted
ECIS
2003
15 years 1 months ago
E-learning: designing new business education
Business Schools are experiencing increased competitive pressures, and one way to differentiate and compete distinctively is through the adoption of innovative uses of information...
Cristina Cáliz, Sandra Sieber
SIGSOFT
2006
ACM
16 years 1 months ago
Lightweight extraction of syntactic specifications
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
Mana Taghdiri, Robert Seater, Daniel Jackson
118
Voted
PPOPP
1999
ACM
15 years 4 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
121
Voted
NFM
2011
223views Formal Methods» more  NFM 2011»
14 years 7 months ago
Generating Data Race Witnesses by an SMT-Based Analysis
Abstract. Data race is one of the most dangerous errors in multithreaded programming, and despite intensive studies, it remains a notorious cause of failures in concurrent systems....
Mahmoud Said, Chao Wang, Zijiang Yang, Karem Sakal...