Tuning parallel program through automatic program analysis

2002 ◽  
Author(s):  
K.C. Li ◽  
K. Zhang
Keyword(s):  
Program Analysis ◽  
Parallel Program ◽  
Automatic Program

JPF-HJ: A Tool for Task Parallel Program Analysis

2019 ◽  
Vol 44 (4) ◽  
pp. 19-19 ◽  
Author(s):  
Joshua Hooker ◽  
Peter Aldous ◽  
Eric Mercer ◽  
Benjamin Ogles ◽  
Kyle Storey ◽  
...  
Keyword(s):  
Program Analysis ◽  
Parallel Program ◽  
Task Parallel

Using integer sets for data-parallel program analysis and optimization

1998 ◽  
Vol 33 (5) ◽  
pp. 186-198 ◽  
Author(s):  
Vikram Adve ◽  
John Mellor-Crummey
Keyword(s):  
Program Analysis ◽  
Parallel Program ◽  
Data Parallel

scholarly journals Dijkstra's interpretation of the approach to solving a problem of program correctness

2010 ◽  
Vol 20 (2) ◽  
pp. 229-236 ◽  
Author(s):  
Branko Markoski ◽  
Petar Hotomski ◽  
Dusan Malbaski ◽  
Danilo Obradovic
Keyword(s):  
Program Analysis ◽  
Practical Importance ◽  
Program Synthesis ◽  
Program Correctness ◽  
Great Practical Importance ◽  
Automatic Program ◽  
Analysis And Synthesis ◽  
The Difference ◽  
Automated Methods

Proving the program correctness and designing the correct programs are two connected theoretical problems, which are of great practical importance. The first is solved within program analysis, and the second one in program synthesis, although intertwining of these two processes is often due to connection between the analysis and synthesis of programs. Nevertheless, having in mind the automated methods of proving correctness and methods of automatic program synthesis, the difference is easy to tell. This paper presents denotative interpretation of programming calculation explaining semantics by formulae ? and ?, in such a way that they can be used for defining state sets for program P.

Sign in / Sign up

Export Citation Format

Share Document