413 search results - page 44 / 83 » An abstract Monte-Carlo method for the analysis of probabili... |
DIDACTICA
2000
13 years 8 months ago
2000
In computer science methods to aid learning are very important, because abstract models are used frequently. For this conventional teaching methods do not suffice. We have develope...
TACAS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
DAGSTUHL
2006
13 years 10 months ago
2006
Abstract. An overview of the concept of program similarity is presented. It divides similarity into two types--syntactic and semantic-and provides a review of eight categories of m...
SAS
2007
Springer
14 years 2 months ago
2007
Springer
In static analysis, the semantics of the program is expressed as a set ions. The equations are solved iteratively over some abstract domain. If ract domain is distributive and sati...
ISOLA
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...