1247 search results - page 198 / 250 » Reasoning about Function Objects |
POPL
2008
ACM
14 years 8 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
ICCAD
2002
IEEE
14 years 5 months ago
2002
IEEE
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
FASE
2009
Springer
14 years 11 days ago
2009
Springer
This paper describes the certification of smart-card applications in the framework of Common Criteria. In this framework, a smart-card application is represented by a model of its...
CAV
2008
Springer
13 years 10 months ago
2008
Springer
We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementa...