1291 search results - page 184 / 259 » Arithmetic program paths |
114
Voted
IEE
2010
14 years 11 months ago
2010
A key problem in compositional model checking of software systems is that typical model checkers accept only closed systems (runnable programs) and therefore a component cannot be ...
169
Voted
ISOLA
2010
Springer
14 years 10 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-...
137
click to vote
ICSE
2012
IEEE-ACM
13 years 3 months ago
2012
IEEE-ACM
Abstract—Key program interfaces are sometimes documented with usage examples: concrete code snippets that characterize common use cases for a particular data type. While such doc...
138
Voted
VMCAI
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
122
Voted
CGO
2008
IEEE
15 years 7 months ago
2008
IEEE
Array inlining expands the concepts of object inlining to arrays. Groups of objects and arrays that reference each other are placed consecutively in memory so that their relative ...