122 search results - page 19 / 25 » Bounded Model Checking of Pointer Programs |
VMCAI
2004
Springer
14 years 25 days ago
2004
Springer
Typed Assembly Languages (TALs) can be used to validate the safety of assembly-language programs. However, typing rules are usually trusted as axioms. In this paper, we show how to...
ILP
2003
Springer
14 years 21 days ago
2003
Springer
We believe that AI programs written for discovery tasks will need to simultaneously employ a variety of reasoning techniques such as induction, abduction, deduction, calculation an...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
ICCD
2003
IEEE
14 years 4 months ago
2003
IEEE
Multiple clock domains are a challenge for hardware specification and verification. We present a method for specifying the relations between multiple clocks, and for modeling th...