1020 search results - page 162 / 204 » Tight Semantics for Logic Programs |
POPL
2010
ACM
14 years 7 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
PEPM
2009
ACM
14 years 2 months ago
2009
ACM
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies t...
CSFW
2011
IEEE
12 years 9 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 ...
IFL
2005
Springer
14 years 3 months ago
2005
Springer
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
APLAS
2004
ACM
14 years 3 months ago
2004
ACM
This paper develops a mathematical characterisation of object-oriented concepts by defining an observation-oriented semantics for an object-oriented language (OOL) with a rich var...