Analysis of multithreaded programs

M Rinard - International Static Analysis Symposium, 2001 - Springer
The field of program analysis has focused primarily on sequential programming languages.
But multithreading is becoming increasingly important, both as a program structuring …

Automatic parallelization: an overview of fundamental compiler techniques

S Midkiff - 2022 - books.google.com
Compiling for parallelism is a longstanding topic of compiler research. This book describes
the fundamental principles of compiling" regular" numerical programs for parallelism. We …

Object race detection

C Von Praun, TR Gross - Acm Sigplan Notices, 2001 - dl.acm.org
We present an on-the-fly mechanism that detects access conflicts in executions of multi-
threaded Java programs. Access conflicts are a conservative approximation of data races …

[PDF][PDF] Detecting access anomalies in programs with critical sections

A Dinning, E Schonberg - Proceedings of the 1991 ACM/ONR workshop …, 1991 - dl.acm.org
ThE paper presents an efficient on-the-fly method for detecting accessanomalies in
programs that contain critical section coordinw tion. For a large class of programs, a single …

Data flow analysis for verifying properties of concurrent programs

MB Dwyer, LA Clarke - ACM SIGSOFT Software Engineering Notes, 1994 - dl.acm.org
In this paper we present an approach, based on data flow analysis, that can provide cost-
effective analysis of concurrent programs with respect to explicitly stated correctness …

Interactive parallel programming using the ParaScope Editor

K Kennedy, KS Mckinley, CW Tseng - IEEE Transactions on Parallel & …, 1991 - computer.org
Abstract The ParaScope Editor, an intelligent interactive editor for parallel Fortran programs,
which is the centerpiece of the ParaScope project, an integrated collection of tools to help …

Barrier inference

A Aiken, D Gay - Proceedings of the 25th ACM SIGPLAN-SIGACT …, 1998 - dl.acm.org
Many parallel programs are written in SPMD style ie by running the same sequential
program on all processes. SPMD programs include synchronization, but it is easy to write …

Data flow equations for explicitly parallel programs

D Grunwald, H Srinivasan - Proceedings of the fourth ACM SIGPLAN …, 1993 - dl.acm.org
We present a solution to the reaching definitions problem for programs with explicit lexically
specified parallel constructs, such as cobegin/coend or parallel_sections, both with and …

[PDF][PDF] Representation of planar graphs by segments

J Pach, H de Fraysseix, P de Mendez - Intuitive Geometry, 1994 - infoscience.epfl.ch
コ 5 シ スソ セ h サ X タツ チゥテト ト & サゥチ, シァナ & テニヌ テネィ チ 5 テノ ハ B タ'チ 5 シ 7 ヒ k サ 5 シァヒフ ナ &
ニヘ シァホヲサ l ハ% トマタ'ニヲサ ミメ ム ヲサヤ モヨユ% ラ木, ル d レぺ ロ, ラ責} ワ s ユ゙ ン'ル ゚ 燎矼 稾ロ ワ s ユ B …

Non-concurrency analysis

SP Masticola, BG Ryder - ACM SIGPLAN Notices, 1993 - dl.acm.org
Non-concurrency analysis is a set of techniques for statically identifying pairs (or sets) of
statements in a concurrent program which can never happen together. This information aids …