49 search results - page 7 / 10 » Safe Reasoning with Logic LTS |
TPHOL
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
LICS
2002
IEEE
14 years 15 days ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
PPOPP
2006
ACM
14 years 1 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 ...
TMC
2012
11 years 10 months ago
2012
The FCC ruling on Nov 4th, 2008 on white spaces has opened up the possibility of wireless network deployments over white spaces, i.e., vacant UHF TV channels. A key requirement fo...
ENTCS
2006
13 years 7 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...