Sciweavers

1855 search results - page 32 / 371
» Composing model programs for analysis
Sort
View
POPL
2012
ACM
13 years 5 months ago
Analysis of recursively parallel programs
We propose a general formal model of isolated hierarchical parallel computations, and identify several fragments to match the concurrency constructs present in real-world programm...
Ahmed Bouajjani, Michael Emmi
CIAC
1997
Springer
111views Algorithms» more  CIAC 1997»
15 years 1 months ago
A Meticulous Analysis of Mergesort Programs
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
Jyrki Katajainen, Jesper Larsson Träff
ICSE
1999
IEEE-ACM
15 years 2 months ago
Data Flow Analysis for Checking Properties of Concurrent Java Programs
In this paper we show how the FLAVERS data flow analysis technique, originally formulated for programs with the rendezvous model of concurrency, can be applied to concurrent Java...
Gleb Naumovich, George S. Avrunin, Lori A. Clarke
ICASSP
2011
IEEE
14 years 1 months ago
Cosparse analysis modeling - uniqueness and algorithms
In the past decade there has been a great interest in a synthesis-based model for signals, based on sparse and redundant representations. Such a model assumes that the signal of i...
Sangnam Nam, Michael E. Davies, Michael Elad, R&ea...
ICFEM
2004
Springer
15 years 3 months ago
Memory-Model-Sensitive Data Race Analysis
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom