1128 search results - page 110 / 226 » Little Engines of Proof |
198
click to vote
ICFP
2009
ACM
16 years 1 months ago
2009
ACM
We report on our experience using Haskell as an executable specification language in the formal verification of the seL4 microkernel. fication connects an abstract operational spe...
232
click to vote
POPL
2007
ACM
16 years 1 months ago
2007
ACM
Race detection algorithms for multi-threaded programs using the common lock-based synchronization idiom must correlate locks with the memory locations they guard. The heart of a p...
208
click to vote
POPL
2004
ACM
16 years 1 months ago
2004
ACM
We investigate proof rules for information hiding, using the recent formalism of separation logic. In essence, we use the separating conjunction to partition the internal resource...
FOSSACS
2010
Springer
15 years 7 months ago
2010
Springer
Λµ-calculus was introduced as a Böhm-complete extension of Parigot's λµ-calculus. Λµ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited con...
102
click to vote
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...