4719 search results - page 247 / 944 » Newtonian program analysis |
249
click to vote
ISOLA
2010
Springer
15 years 3 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-...
287
Voted
POPL
2009
ACM
16 years 6 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
153
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
158
Voted
ICTAC
2009
Springer
16 years 11 days ago
2009
Springer
Abstract. We design a deadlock-free semantics for a concurrent, functional and imperative programming language where locks are implicitly and univocally associated with pointers. T...
108
Voted
APLAS
2006
ACM
15 years 11 months ago
2006
ACM
We give an elementary semantics to an effect system, tracking read and write effects by using relations over a standard extensional semantics for the original language. The seman...