41 search results - page 7 / 9 » Proving Pointer Programs in Higher-Order Logic |
CSFW
2011
IEEE
12 years 5 months ago
2011
IEEE
—This paper introduces YARRA, a conservative extension to C to protect applications from non-control data attacks. YARRA programmers specify their data integrity requirements by ...
LOPSTR
1997
Springer
13 years 9 months ago
1997
Springer
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
TPHOL
1997
IEEE
13 years 9 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...
ICSE
2011
IEEE-ACM
12 years 8 months ago
2011
IEEE-ACM
A raw object is partially initialized, with only some fields set to legal values. It may violate its object invariants, such as that a given field is non-null. Programs often ma...
POPL
2011
ACM
12 years 8 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...