101 search results - page 11 / 21 » Cyclic proofs of program termination in separation logic |
90
Voted
ENTCS
2008
14 years 9 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
APSEC
2008
IEEE
15 years 4 months ago
2008
IEEE
Memory usage analysis is an important problem for resource-constrained mobile devices, especially under mission- or safety-critical circumstances. Program codes running on or bein...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
176
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
104
click to vote
ENTCS
2006
14 years 9 months ago
2006
Separation logic [20,21,14] began life as an extended formalisation of Burstall's treatment of list-mutating programs [8]. It rapidly became clear that there was more that it...