394 search results - page 63 / 79 » Formal polytypic programs and proofs |
122
click to vote
FOSSACS
2008
Springer
15 years 4 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
132
Voted
SAS
2010
Springer
15 years 1 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
101
click to vote
WWW
2007
ACM
16 years 3 months ago
2007
ACM
Cryptographic protocols are useful for trust engineering in Web transactions. The Cryptographic Protocol Programming Language (CPPL) provides a model wherein trust management anno...
127
Voted
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
117
Voted
PPOPP
2006
ACM
15 years 9 months ago
2006
ACM
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...