15811 search results - page 3035 / 3163 » Search-based software engineering |
124
Voted
ICFP
2005
ACM
16 years 23 days ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
137
Voted
ICFP
2004
ACM
16 years 23 days ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
113
Voted
MOBISYS
2008
ACM
16 years 12 days ago
2008
ACM
Mobile users of computation and communication services have been rapidly adopting battery-powered mobile handhelds, such as PocketPCs and SmartPhones, for their work. However, the...
106
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
104
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...