70 search results - page 9 / 14 » Refining the control structure of loops using static analysi... |
103
Voted
HASE
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper deals with verification of flow control in concurrent programs. We use Ada language model as reference. After translation of Ada programs into Petri nets (named Ada net...
ADAEUROPE
2004
Springer
15 years 5 months ago
2004
Springer
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
111
click to vote
ECOOP
1999
Springer
15 years 4 months ago
1999
Springer
Although it is acknowledged that internal iterators are easier and safer to use than conventional external iterators, it is commonly assumed that they are not applicable in languag...
LCTRTS
2007
Springer
15 years 6 months ago
2007
Springer
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
113
click to vote
SIGSOFT
2005
ACM
16 years 1 months ago
2005
ACM
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...