Sciweavers

14 search results - page 1 / 3
» Hybrid Analysis for Partial Order Reduction of Programs with...
Sort
View
IFL
2005
Springer
155views Formal Methods» more  IFL 2005»
13 years 10 months ago
A Binding Scope Analysis for Generic Programs on Arrays
Performance of generic array programs crucially relies on program specialization wrt. shape information. Traditionally, this is done in a rather adhoc fashion by propagating all sh...
Clemens Grelck, Sven-Bodo Scholz, Alexander V. Sha...
ICS
2001
Tsinghua U.
13 years 9 months ago
Global optimization techniques for automatic parallelization of hybrid applications
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
Dhruva R. Chakrabarti, Prithviraj Banerjee
TACAS
2009
Springer
212views Algorithms» more  TACAS 2009»
13 years 11 months ago
Semantic Reduction of Thread Interleavings in Concurrent Programs
Abstract. We propose a static analysis framework for concurrent programs based on reduction of thread interleavings using sound invariants on the top of partial order techniques. S...
Vineet Kahlon, Sriram Sankaranarayanan, Aarti Gupt...
RV
2010
Springer
110views Hardware» more  RV 2010»
13 years 3 months ago
Interval Analysis for Concurrent Trace Programs Using Transaction Sequence Graphs
Abstract. Concurrent trace programs (CTPs) are slices of the concurrent programs that generate the concrete program execution traces, where inter-thread event order specific to th...
Malay K. Ganai, Chao Wang
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
14 years 11 hour ago
Boom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Gérard Basler, Matthew Hague, Daniel Kroeni...