The CompCert Memory Model, Version 2

Størrelse: px
Starte visningen fra side:

Download "The CompCert Memory Model, Version 2"

Transkript

1 The CompCert Memory Model, Version 2 Xavier Leroy, Andrew Appel, Sandrine Blazy, Gordon Stewart To cite this version: Xavier Leroy, Andrew Appel, Sandrine Blazy, Gordon Stewart. The CompCert Memory Model, Version 2. [Research Report] RR-7987, INRIA. 2012, pp.26. <hal > HAL Id: hal Submitted on 1 Jun 2012 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

2 The CompCert Memory Model, Version 2 Xavier Leroy, Andrew W. Appel, Sandrine Blazy, Gordon Stewart RESEARCH REPORT N 7987 June 2012 Project-Teams Gallium and Celtique ISSN ISRN INRIA/RR FR+ENG

3

4 rt r2 rs r r 2 r r 32 r t rt Pr t s t q s r rt s str t r2 s rt t t t r s t s r t r r s t s s t r r t s r r2 st t s s s r s r t s r 2 r rt r s s s st t r2 t t s s r t t s t s ts s r t rt s s t t r t s r r rt s t s r2 2 rt t r t r s s t r s r t r t r t s t rt r2 s s r rt 2 r 2 32 t s r s t r s r r rt s r s rs t s r2 r r t t t s rs rst r t s t 1 s t 2t r2 r r s t t t rs ts r s r s r q ss r rt s t r s s r t s t t r t r s r ss s ss r ts s rts r r ss t 3 t s r r 2 t s t 2 t r s s r r2 t r r rr 2 t st2 s r t r r t 2 r s r2 s r s t s r t rt P r s q rt r t t rt rt 2 t r r t r è r t Pr t rs t2 rt rt 2 t r r t s r r t t t t r t rs té s r t t t q RESEARCH CENTRE PARIS ROCQUENCOURT Domaine de Voluceau, - Rocquencourt B.P Le Chesnay Cedex

5 è é r rt rs és é è é r st s t rt t sé t q r ér t r r t s é rt t s ér t s s r s ét ts é r t s q s t r s t s é r t r s t r r t ér é rt t s è é r é ré q rt tr s sé t q s s s r s s s rt t s s s t r é r s s r r étés é r q s è é r t rô rt t s s r s rés r t sé t q t r r èr rs è é r rt st é r t s rt r 2 t 32 t s r rt r r é r t rs è é r q rés t s r s t t s rs Pr èr é r t 1 s r rés t t é r t t s t rs t s tt ts t t rés r t s r r étés t s té s t rs é r t tè r é s r ss s r ts ès à r q t r s t r à t r s t s t s s r ss s s r s é s t r s t st t r r s rs r é s à é r rt é s2 r sé s st2 r t r t r ts és è s é r s sé t q s r s t ér é rt

6 rt r2 rs tr t r t r r r s r r s s s q s s t t r t 2 t r2 st t s st r r2 s s t r2 st t s r t s r r2 s s r s r t s r2 s r r q s t t r s t s t r t r r s r 2 r rt s r r s r t rr t ss r r tr s r t s r t2 s s s s r t s q t r t t r2 s s ts t t r str t r2 t s t t s t 2 t t t t r t 1 t2 s tr r2 s r s r r2 rr t r r s t t r s r 1 s q t 2 s st t r2 r rt s t t r t r 1 t s r r r s r s r t s t t r t s t t r r t r t t s r s r2 s r t r r r r t r t s t s q t s t t 1t s s t t r r rr 2 t t r t s s r t r t s ts s s t rs t r r t t st ts s ts s s s r t r s ss r t s r st t r r t t r s t s r rt r t t r2 r s r r 2 t t rs 2 t t s r t t t t r2 r s rr s t t st t r s r t s ss s t r s t r2 str t r2 s s t r rst r t t t r s r t r s t s r t r st s s sts t t t r t2 s r2 r t r2 s s t r r r2 s rr 2 2t s 1 2 r ss s t t r st t rs s t r s r t r s ss r t s s t ss t r t rr t ss st r r ss s t t r t t t r2 t t 1t t rt r t r r 2 r 2 t rr t ss r st t 3 r r 3 t q r ss st t r2 r t rt t t r r r t r s t r t s t rt r rs t rt r2 s s r t s rt 2 r 2 32 s r 3 s t t 2 rs t s t s r t t s t s r2 r s r t t r r s s s2st s t rs r t t t 1t s rt t r s r r rr t r r s st t t r t r r t t t t s t s r s t s t r t rt r2 t r t s s t 1 s t 2t r r s t t t rs t t rs str t t r r s t t t rs s r q r t r s r r r r rt s r 2 r 3 r t rs t r r t s t r r ss s s s ss r ts r2 2t t r2 st t r s tr r2 r t s r r tt t s 2t s r st t r2 r r s t t str t r r 2 r ss s r s t r t r t s t s r2 s tr r s rt t rt r r r s s t r rt ts t rt r2 t rt r2 rs

7 r 2 32 t rt rt r2 rs rst r rs t rt r2 r rr t r r t r 2 32 r t s t s r2 st t s m r t s s rr 2 str t 2t s r P t rs r r r s t 2 rs (b,i) t r b 2t s t i t t s b s t t r s low bound m b high bound m b s ts t b r t low bound m b s high bound m b 1 s s 3 b s t r r high bound m b low bound m b 2t s r s t s r rt t t t r t ss t r t t r2 r t r r t r2 r ss r r2 t t t t r r t r2 t r r s r s s r t t t tr2 t t t t r t r s P t r r t t s t s t rt t r ts t r rt (b,i)+n def = (b,i+n) s s q s r s r t 2 str t r t r t b t t r r t t r t t r t b b t r r t t 2 r t t r t rs t b r t rs ts b s s s str t t t2 r2 st t s r r s t s t2 st t empty : mem t t t2 r2 st t t r t s alloc : mem Z Z mem block free : mem block mem load : mem memory chunk block Z option val store : mem memory chunk block Z val option mem alloc m l h t s r s s 3 h l 2t s t l h t r t r s t t r2 st t t t r r t r s free m b t s t b r t r t t r2 st t b s s (0,0) t r r r r r r r tt t store m τ b i v st r s v t t2 τ b t s t i s r t s r t t t rs t ts t r s s t v ::= Vint(i) Vfloat(f) Vptr(b,i) Vundef r2 t2 s τ t t s 3 t2 s ss t st r 2t s ts t rs r r s r2 st t s r

8 rt r2 rs τ ::= Mint8signed Mint8unsigned t t rs Mint16signed Mint16unsigned t t rs Mint32 t t rs r t rs Mfloat32 t s r s ts Mfloat64 t r s ts t2 τ s t s 3 τ 2t s t r t τ s s 2 t t r t r t2 r2 st r s s t 2 r r s t st r s s r t r s Some m r m s t t r2 st t 2 s t str ts r r s t τ s i low bound m b i i+ τ high bound m b t r s st r r t r s load m τ b i r s t2 τ r b t st rt s t i s s r t r s Some v r v s t r 2 s ts str ts r r s t s t s st r t r s s r t r r s r t r 3 st t s t s t s r2 r t s t r alloc m l h = (m,b) ❼ load m τ b i = load m τ b i b b ❼ load m τ b i = Some v t v = undef t r r free m b = m ❼ load m τ b i = load m τ b i b b ❼ load m τ b i = None t r st r store m τ b i v = Some m ❼ s t s load m τ b i = load m τ b i b b r i + τ i r i+ τ i ❼ t s load m τ b i = Some(convert τ v) τ = τ ❼ t s load m τ b i = Some v τ τ t v = undef ❼ r s load m τ b i = Some v i i i + τ > i i+ τ > i t v = undef t r t t s t s r s r s s t t r st r r s

9 r 2 32 t rt s s t t r st r s r t r s t s rr s s t ts t r2 r t 2 t st r t t s 1 t 2 r t r2 r t 2 t st r s t t st st r t r rs t t st t t2 τ convert (Vint(n)) Mint8unsigned = Vint( t 3 r 1t s n) convert (Vint(n)) Mint8signed = Vint( t s 1t s n) convert (Vint(n)) Mint16unsigned = Vint( t 3 r 1t s n) convert (Vint(n)) Mint16signed = Vint( t s 1t s n) convert (Vint(n)) Mint32 = Vint(n) convert (Vptr(b, i)) Mint32 = Vptr(b, i) convert (Vfloat(f)) float32 = Vfloat(f r 3 t s r s ) convert (Vfloat(f)) float64 = Vfloat(f) convert v τ = Vundef t r s s t t r s s t r t 2t s r 2 t s t t t 2t s r tt 2 t st r ss 2 t t r 2t s t t r t t 2 t st r s 2 t r s t t t s t s s t 1 s t 2t r r s t t s r2 r t rs st r r tt r r s t t t s t 2t ts t s s s t t t t rs t r2 r r st s 2 t t t r s s r r r t 3 r2 r s s t s s s t t r s t rs t r2 ss ss t t r2 rs t2 t r r r r s rt r2 rs rr t 2 s t r2 r r r s t t r t t st r s s s t t st r t r2 r s t t s t t2 s t r ts r st t t2 2 r t t2 t t st ss t t t s t t s r st t t2 r t r r 2s ss s t t r s t2 s t t t t t t t2 t t t t2 s t r r q rs s s s s ss s rr s s t t t s t t r st r s storemτ biv = Some m τ = τ t loadm τ bi = Some(convert(τ,v)) t t2 s t,t t t r t t s s t st r t rt r2 s τ,τ t t t s s 3 r 2 s ss r r t s t s r t t t t v st r t t2 t s r 3 st t t2 t r st r t s s rt s rs t t convert(τ,v) s t t2 st (t ) v s s st r r t r r s t rt r2 t s r r r r s t t r r t t st r s r 1 rt t r r s t t t r s s t r

10 rt r2 rs t r st t t r t2 s r r st r 2 t r t2 t 2 t r t r t2 t t t r t r t2 s s t t t2 t t 1 t 1 q t t 1 r t r 1 rt r2 s r ss t 2t s ts t rt t s t s t t 2t s ts rr s t rr 2 ts r str t s r r r r2 ss s s s t ss t s t s t r t r r s t t ss ts rr 2s r str ts st r sts r t r r t t r 1 str t 4 t s s 2 t s t r s s 3 t t r ss ts r rt t s s t s 2 st r t t r t s t t ss t t r s s t r s t s r t s s r t 4 str t s 6 r 2 t t2 t ts t r r t s ss r t 2 s s 1 s 2 s 3 r s t t ss t r2 t r r s t t s 2st s r r r2 s t t r tt st r r t s t 2 t r t r t r2 r r s t t t t t 2t s r ts r 1 t ss t r rt t r tt t r r s t t r rs 2 s t r tt s s s t s s t s t r 6 sr st t sr 1 st sr st sr st sr st sr r t r st 6 t s 1 t r2 ts r sr st r ss s t s 2 t t2 s t r s s t s rt 2 rs t rt r2 t t r s s t t r st r s t r r sr sr r s s s st r s s st t 2t r rs 1 s 1 t 1 s t t s r s s t r r tt t st r r t

11 r 2 32 t rt s t s s t r t r r t 1 s r s t t r r s t t t 1 t t t r r s t t t t rs t t s t r t s r st t t s t s r s t ts t r t t t ts r r s t t t s s t t s t r t r s t s t t s t s t rt r2 rs t t t t 2s r t r s st t 1 t t r s t t r t r t r t s t t s t t r st r s t s t s r r2 r t t rs st r r 2 t r ts t t r t r t s r t r r ss r r s t str t s r 1 t P rp ts r t t r s str t t rt t t r t r s t s rs st t 2 q t t t s t t s t r t r s 1 ts t 2 t t t t t P rp s r t t r t s t t r r s t t t t tt r 2 1 r r s ts t t t t tt r r r s ts t t (double)x r r t t t s tr t t t s t ts s 1 t r s t (double)x rs t rt r2 s t t t s t s t t s r t r s t st 2 s r r2 t s r r 2t t r r s t t s 2 rt t t st r r t r s s t s r t t t t 2 t r t st r r r2 2 st st sr s 3 t 4 6 r r st st r sr r t r st r

12 rt r2 rs r t t rt r2 rs t s 2 r s s t t s ss rr 2s r s r s r t r t2 s s st 2 r s t r s r 1 sr ts t rr 2 t r t r st r sr r t r s t st t st s t s t2 r 2 r2 tr s r t s t t t t r2 t rs r t rs r ss s t 2 t r t r t r t s t r2 t rt r s t s r s s t t t s rt r t rs r st t rt s t s t st r s r r s t t st t r t t rs r q s t t r r s t t t r t r s t r t r t r s s t t rs s t r t s s r t r r s t t r t 1 t r t r r t s r s t 1 t 2 s t 2 t 1 s 1 t r t t rt s t s t r r t t 1 t s 2 t r 2 t t r r t r t 1 t 2 t t ss t s r rs t t r r s r t s s t t r2 t rt s t s r r t 2 r t rs r r rt s str r t r s r ss r2 t r t rr t ss rt s r ss s r r t 1 s t ss s t t 2 t r2 2 t t r r tr 2s r 2 s t ss r r t r t s r r s s r ss s r r t s t r t r r t r2 t r s r r t s r t r t r2 st t s s r r ss t 3 t s s s t s r s r r t s 2 t s t s r t r t r t s t r r s r t t r s s s s r2 r r s t t st r t t t st ss r r t r r st r t r s t t t t t r st r r s t r2 t s t t st r t rr t t s st r t r r s t 1t t r r s r s t t s t r r tr s r t s t r2 st t s r t r r s t s tr s r t s rt tr s t t r2 t s r r 3 t r s t rs r2 t s t F t t2 F : block option(block Z) t b t r t r2 st t t r r r F(b) = None s t t t s s t r2 2 t r r tr s r t F(b) = Some(b,δ) s t t t s s t s b t r2 st t t tr s r r r s s st rt t s t δ

13 r 2 32 t rt r2 t s r t r r2 1t s s s r r s r t s r r2 st t s t rt r r2 t F s r t F v 1 v 2 t t s v 1 t r r r t s v 2 t tr s r r r s r t rr s s t r t t r s s s 2 F t s s s t r r r t r 2 r s t tr s r r r F Vundef v 2 F Vint(n) Vint(n) F Vfloat(n) Vfloat(n) F(b 1 ) = Some(b 2,δ) i 2 = i 1 +δ F Vptr(b 1,i 1 ) Vptr(b 2,i 2 ) s r2 t F s r t F m 1 m 2 t t r2 st t s m 1 t r r r m 2 t tr s r r r rs t rt r2 t s r t s s r2 m 1 r s s t 2 m 2 r t t s F(b 1 ) = Some(b 2,δ) load τ m 1 b 1 i = Some(v 1 ) v 2,load τ m 2 b 2 (i+δ) = Some(v 2 ) F v 1 v 2 s str t 2 r 2 32 s t r2 t s 2 r rt s t t t t st r r r t s t r2 s r rt s t r s rt t r s t r s r t r t rt r ss s t t 2 t r2 rs r r s s r t r t rt r2 rs s t t t rs r t r t 2 str t r t r t s s s r s r s r t s r rs r r s t t t s t r s r ss s t rt r t r t r s r s t s t t rs r ss tr rs t r2 r st r r t s s s s t ss t s t t s ts s r r t 2s s s t s r 2 r s r s t rs s r s t t s t t str t rst t s t s t t r s t s t t r r s r 2 r r r t s 2 r r s t t r r r rr rs s t s t 2 s tt ts t r r s s s r s r r s s r

14 rt r2 rs r2 s rr s t st r s r t str t r s s r r 2 s t t st r t t s s 2s s s s t s t s rt s r t t st r s r t st ss t t r2 t s 2 s rts t r st t 3 t s s s st t r t st r s st t st t 1 4 r t r 1 st 6 st t st t 1 4 r t r 1 6 r r ss tr r r2 t s s s s t 1t rt t r s t r r rr t r r s s r s 2 t t r t r r t t r r t r s r 2 s r rr t s r t r s r r2 s 2 ss t t t r rr t s r t r s t r r s s 1 s t t r s s ss r ts t ss t r2 r t r t s s r q r t t r r rs t s r ts t r rr t s r t s rts r t r ss s t s s ss r t r t t r r 2 r t r ts t r t r s t r t t r t t r t t t s r2 r r t r r ts r ts t t s r t ss r ts t r r 2 t s r t rt r st t r t t t t s ss r ts r r s t r t t2 t r rt t r st r r q s t r t r r s 2 t r t t t s s t t 2 t s r t s t t r t s t ss s rt s r r rs t rt r2 s t q t r2 t t r r 2t r ss s r r st t r 2t r tt t rr t r t s s s r t s t r2 r ss s s s r2 t ts r t r r tr r 1t r t t s t s s s s t r t t r r r2 ss s r ss r t s s t r2 r ss s t t r t 1t r t s t rs t rt t r t r r s t 1t r t rt ts r2 t t s r t r t s r ss s t r r r r2 r t 2 s 1 r ss s t t t 2 r t t rt r2 st s r2 t r ts s r 2 t str t r ss s t t s s t rt r2 rs s r rs t rt r2 s rs t r ss t t t s s r s t s t t 1t t t t t r rt s s r s t s st s s r r t s t s t s r ❼ 1 s t 2t r2 r r s t t t rs ts t t t rs str t s t ❼ tr r 2t r ss s r t r r2 s s t

15 r 2 32 t rt ❼ r t s r r2 st t s 2t s st r 2t s r r s t r t s t r2 r2 st t s r r s t s t2 st t empty : mem t t t2 r2 st t t r t s alloc : mem Z Z mem block free : mem block Z Z option mem load : mem memory chunk block Z option val store : mem memory chunk block Z val option mem loadbytes : mem block Z Z option(list memval) storebytes : mem block Z list memval option mem drop perm : mem block Z Z permission option mem st r r s rs t r r t free m b l h r r s t b t r t r t r s ts [l,h) t b s s s t t s r t t t r2 t s s t ss t r t s 3 t r t t s t t ss t s t t rt s t 1 r s rr t 2 t r s t t r t2 2 t t s t r r r 2 r r t s r 2t s st r 2t s r s r t st r t st r r r t t 2 r r r t st 2t t ts t2 1 s t 2t s st r 2t s r s t s t s t 2 r t s s s 2 s t r s r 2t r2 r r s t t t 2 drop perm m b l h p rs t r ss s ss r ts r t s (b, l),...,(b, h 1) s tt t t p P r ss s r rt r 1 s t t2 s r r s t s t t r 2 r2 rr s t st r t r t s t 3 P r ss s r2 st t s ss t r ss s r ss r ts t r2 2t t r s r ss s r r r t t2 r ss s r r r t r r r r t t t r r r t t r t r r 2 r t t r r rs t t t2 r t r t t t t t r t rs P r ss s r t r ss p s r ss s p < p r t r r r ss s s Nonempty < Readable < Writable < Freeable rt s t st r s t r r s t rs t rs t r t s s t s r t r s s t s t t r r s s t t t t r Vptr(b, i) s t t (b, i) s t st t2 r ss r

16 rt r2 rs r ss s r r t t2 1 r ss r r ss r r r t t r 1 t s 1 r r ss s r t t s ss r t t r ss t t s s s 2 t t t t s t2 s s t2 2 t s r t s t t t t 2 t r r r 2 r2 2t t s ss t t t t t t r ss s t rr t r ss t 1 r ss t 2 t t 1 t t rr t r ss s ss t r q t t 1 r ss 1 r ss s r t 2 t r t t t t t t t s t t s 1 r ss r t s r ss t r r 2 r r r t 2 r t t r s ts 1 r ss s t t t2 t t t t 1 r ss 2 r s t t s t tr st t rr t r ss r s r r s t t r 1 t 1 r ss r t t t t r 1 t 1t s t s r r2 rr 2 t s t r t t r r 2 r s rr t r ss s r r 2 s s q t r t r str t s t s t r ss s t r t t t t t q r 3 t t ss t r ss s t t s s 1 s s r t perm : mem block Z perm kind permission Prop r r s t r t t t2 1 5 P r r s t perm m b i k p s 2 r2 st t m t (b,i) s k r ss t st p t t2 r ss s t t t t rr t r ss s r r 1 r ss s r 1 r ss 2 t t s perm m b i k p p p perm m b i k p perm m b i Cur p perm m b i Max p st s ts st s s rs t r2 t st r r t s t t t ss t s rr t r ss s t st r s r t s t r r r r t s t t t t t s rr t r ss s t st r t r r r r ss Pr r s s r s t r rt s

17 r 2 32 t rt r t s s 2 load m τ b i range perm m b i (i+ τ ) Cur Readable store m τ b i v range perm m b i (i+ τ ) Cur Writable free m b l h range perm m b l h Cur Freeable drop perm m b l h p range perm m b l h Cur Freeable t t t2 r 2t r ss s t s r s t ss t s t r2 s rs t r2 t r r r s t t s rs s t s t s rt s r s s t st t t t t (b,i) s r 2 t t t 2 t r s t t (b,i) s m def = low bound m b i < high bound m b s rs t t t r t t r s st s (b,i) s m def = perm m b i Max Nonempty P r ss s r r s r 2 r t s r r2 st t s t t 1 t s r t t r ss s alloc m l h = (m,b) t s (b,l)...(b,h 1) t r r ss s 1 r free m b l h t s (b,l)...(b,h 1) s r ss s drop perm m b l h p t s (b,l)...(b,h 1) t 1 r r ss s p str t t t s t r ss s t s s t s r t r 2 t t s r r2 rr t 1t s rt s 1t s r t t r s r t r ss s r r2 t s rr t s r t t r t r ss s r t t s r r ss s rt s s r ss s s r t t t r ss s t t r s A B r r2 t 2s t t s s A s r ss B s r ss t A t B r r st r r t r t Nonempty r st r r Readable r r t2 Writable r r st r 2 t r st r r t t r ss s r r 2 t r s r t s t s t r r t t r ss s s s r r s t t r s t s t s tt st t t r s r r r t r t st t t r s st ts s q t r t s t s s t s t r ss r 1 t r A st r s t t t r B s r t s t r t t st r r t s 2 s t r ss s s r r rs A r s t r B s r t t r rr t s r ss t t s r ss t t r s r2 t r r s t t s r2 st t s t ts t t ss t s t2 t 2t t t s r t r 2t s t r

18 rt r2 rs t t 2t 5 P t r t t t ts r2 2t t r ❼ st r s t tt r s s t t ts t 3 r2 r ❼ Byte n r n s r t t t r t r ❼ Pointer b i n st r t n t 2t t str t t r (b,i) t t t s r r s t t s t t t r t s st r r2 r s t s q 2t s n 1,...,n k t ss ts t t t st r t t ts s t s Byte n 1,...,Byte n k s s 1 t 2 t t r r r ss r s tr st st r t r Vptr(b, i) ts r r r r s t t 2 st r t s Pointer b i 0,...,Pointer b i 3 r r2 r r s t r rs r t r r r s q s s rs s t s sts s r r 2 r2 q t t2 s t t t t s r2 st r2 st r s t s t t encode val Mint8unsigned (Vint(n)) =[Byte x 1 ] r (x 1 ) = encode int 1 n encode val Mint8signed (Vint(n)) =[Byte x 1 ] r (x 1 ) = encode int 1 n encode val Mint16unsigned (Vint(n)) =[Byte x 1 ;Byte x 2 ] r (x 1,x 2 ) = encode int 2 n encode val Mint16signed (Vint(n)) =[Byte x 1 ;Byte x 2 ] r (x 1,x 2 ) = encode int 2 n encode val Mint32 (Vint(n)) =[Byte x 1 ;Byte x 2 ;Byte x 3 ;Byte x 4 ] r (x 1,...,x 4 ) = encode int 4 n encode val Mint32 (Vptr(b,i)) =[Pointer b i 0;Pointer b i 1;Pointer b i 2;Pointer b i 3] encode val Mfloat32 (Vfloat(n)) =[Byte x 1 ;Byte x 2 ;Byte x 3 ;Byte x 4 ] encode val Mfloat64 (Vfloat(n)) =[Byte x 1 ;...;Byte x 8 ] r (x 1,...,x 4 ) = encode int 4 (bits of single n) r (x 1,...,x 8 ) = encode int 8 (bits of double n) encode val τ v =[Undef;...;Undef] τ t s t r s r encode int l n r t r s t st t l 2t s t r n t r r tt r r t t r t r t t r ts s ts r t r s t r t r r s t t s r s r r s t r s t 2 t s s 2 s 2s s r s2 tr t t t

19 r 2 32 t rt decode val Mint8unsigned [Byte x 1 ] = Vint(n) r n = decode int [x 1 ] decode val Mint8signed [Byte x 1 ] = Vint(sign extends(n)) decode val Mint16unsigned [Byte x 1 ;Byte x 2 ] = Vint(n) r n = decode int [x 1 ] r n = decode int [x 1 ;x 2 ] decode val Mint16signed [Byte x 1 ;Byte x 2 ] = Vint(sign extends(n)) decode val Mint32 [Byte x 1 ;...;Byte x 4 ] = Vint(n) decode val Mint32 [Pointer b i 0;...;Pointer b i 3] = Vptr(b,i) r n = decode int [x 1 ;x 2 ] r n = decode int [x 1 ;...;x 4 ] decode val Mfloat32 [Byte x 1 ;...;Byte x 4 ] = Vfloat(single of bits(n)) r n = decode int [x 1 ;...;x 4 ] decode val Mfloat64 [Byte x 1 ;...;Byte x 8 ] = Vfloat(double of bits(n)) r n = decode int [x 1 ;...;x 8 ] decode val τ L = Vundef t r s s r decode int L s t st 2t s L t t r s t r r tt t t t r t r t t r t s r 2 r t t t rs t t r s t st 2t s r rs t r r 3 t t t t r2 t2 s decode val τ (encode val τ v) = convert τ v s r rt2 st s t 2t s r t t r r2 t2 τ t t rs 2 s ss r t r2 t2 τ s r decode val τ (encode val τ v) =convert τ v {τ,τ } = {Mint8unsigned,Mint8signed} r {τ,τ } = {Mint16unsigned,Mint16signed} r r s t s t r rs 2 s ss t t t r r s t t s r s ts decode val Mfloat32 (encode val Mint32 (Vint(i))) = single of bits(i) decode val Mint32 (encode val Mfloat32 (Vfloat(f))) = bits of single(f) r s 2t s st r st r 2t s r t s q t t 2t s r t s t load m τ b i = Some (decode val τ B) loadbytes m b i τ = Some B τ s i r 2 r st r r t t rr s st r 2t s r t store m τ b i v = Some m storebytes m b i (encode val τ v) = Some m τ s i r

20 rt r2 rs s 2t s st r 2t s r t s 2t s r t r t s s q t t t 2t s r t s t t r s loadbytes m b i (n 1 +n 2 ) = Some B B 1, B 2, loadbytes m b i n 1 = Some B 1 loadbytes m b (i+n 1 ) n 2 = Some B 2 B = B 1.B 2 s st r 2t r t s s t t st r 2t s storebytesmbi(b 1.B 2 ) = Somem m 1, storebytes m b i B 1 = Some m 1 storebytes m 1 b (i+ B 1 ) B 2 = Some m t r r rt s s rs t alloc m l h = (m,b) ❼ load m τ b i = load m τ b i b b ❼ load m τ b i = Some v t v = Vundef t r r free m b l h = m ❼ load m τ b i = load m τ b i b b r i + τ l r h i ❼ load m τ b i = None l i i+ τ h 2t s t r st r 2t s storebytes m b i B = Some m ❼ t s loadbytes m b i B = Some B ❼ s t s loadbytes m b i n = loadbytes m b i n b b r i + n i r i+ B i s s rt r r s 2 s t st r 2t s r t 2t s r t t t r t s t r st r store m τ b i v = Some m ❼ s t s load m τ b i = load m τ b i b b r i + τ i r i+ τ i ❼ t s load m τ b i = decode val τ (encode val τ v) τ = τ rt r τ τ r t r r 2 s ss load m τ b i = convert τ v r t rs t r2 t s r t s t t t st r t r t t r s s r 1 r t t t f t t (b,i) t r t t r r t s t t r s t s t t t r rr s t t t r r s t t f s s str t t r2 s t r ss s t t t s s r s t r st s 2 s t t t r s s t v st st r s t r ❼ t s r t r s v s t r load m τ b i = Some v τ Mint32 τ Mint32 t v = Vundef ❼ r s r t r s v s t r load m τ b i = Some v i i i + τ > i i+ τ > i t v = Vundef s s s s r r t t r r t r t2 r rt2 r st r t r s s r 1t

21 r 2 32 t rt t r t2 t r s s s ss t s ss t t r r t s t t r r st r r2 t r s r t s 2t r r s t t s t r t r r t s r s 2 st r r2 r t r2 r t s t t t s t r t r s store m τ b i v = Some m load m τ b i = Some(Vptr(b,i )) t t r ❼ t t r t t s s t st st r τ = τ = Mint32 b = b i = i v = Vptr(b,i ) ❼ r t s s t r t st r b b r i + τ i r i + τ i t r r t t r t t s s r 2 r s t t r r2 st t load m τ b i = Some(Vptr(b,i )) s t r t2 r rt2 s rt t t r s r s t t r 2 2t r r s t t s t r s t r rt s r 2 r2 tr s r t s s t t s r ss s t rt r r r s t s r s r t t rt q s r s r t t t r2 r2 s r t s t s 2 t r s st t t r r rt s s t2 r 2 t t s t t r rr t r r t t t q t r r t s r2 st t s r r r s t 2 t r r t2 t 2 r 2 4 t ts t t ss t r t r ss 1t 1t s 1t ss 1 r s r r r ss s 1 ss s r 1t ss r s 1t ss s r2 st t s s t r s t ❼ t r 1t tr s t rst t s s t t r t t t 1t r t r t r s r s t ❼ t ts r s t rs t s s s t s t t str t r r rt s s r r2 r s t t t 1 t s t t ❼ ss r s t r ss tr s t t t2 t r ss s s r r s r r2 t t r t st r r ss t r t st 1 r ss s r ss s t t 2 t r r ts r t t s t ❼ 1t s 2s s t t t rs r r s r 2 rt t r r s t t t rs r

22 rt r2 rs ❼ r r2 t t r r ss r 1 s t 1 r ss ❼ s t t t t 2 t t2 r ss s r t t t r s t t t st r r t t st r r2 s t ss s r t t s s t ss 1t 1t s ss 1 s t s t ts t ts 1t ss ss s t r t s t s t r s t t t r2 t r r ss 2t s r r t r ss s t st r s r t r s t r2 st t s r t r r t t s (b, ofs),...,(b, ofs+ chunk 1) r s t 2 t 1 r2 t s t t t st s r t r 2 t r t s r ts t rt r2 s s r r s s t r r tr s r t s r r s t t t t r s t t str t t s s s t s r r st r st t r 1 t 3 t s t r ts s s t rr t ss r s r rt s t ss s 2 t 1 t 3 t t r s r s t s t ss ss t t r2 rs rs t r2 r s r s t t r s rs s ss s t 2 ❼ t s t 1 t s t s t r r s t t r t ❼ t s t 1 t s t s t t s r t r r s t t r r sts t t rs ss t s t t r2 2 t s t t2 s str ts s rr 2s ❼ t 2s s r rt s r 2 r2 tr s r t s t r2 t s t 2 r rs 1t s s 2 t rs t s s t t t r2 r t s r s s t r s r t r rt s r ss s r r t 2 s2 t t t rs t r2 s ss t r ts r t 2 rs t t t s rs t2 t r r r s t rs ts rs t r2 s t r s s t s t r r s t t ss t s t t r2 r r s t t s s t2 s t rs ts r s t t

23 r 2 32 t rt 1 s s t t str t t s t2 ss s t s s t s t r 6 sr st t sr 1 t st sr st sr st sr st sr t r t r st 6 s t st r st r 2t s q s t t t r r t t r2 ss t t sr t s t [Byte x 1 ;Byte x 2 ;Byte x 3 ;Byte x 4 ] t t r 1 r (x 1,...,x 4 ) = encode int 4 x s t 2t s st r 2t s s t t t t r r t t r2 ss t t st t s t s [Byte x 4 ;Byte x 3 ;Byte x 2 ;Byte x 1 ] 2t s q t s s t t t t r r t r 2 t t s decode int [x 4,x 3,x 2,x 1 ] s t 2t s t r 1 r s s t t s s t t s t 6 1 t 1 t r t r 6 r t t st r t t t r r t s decode val Mint32 (encode val Mfloat32 x) = bits of single(x) t t s t t t r rr s t t r r s t t t s r s t 1 s t s t r t r t t s single of bits(n) r n s t t t n = bits of single(x) 0x7FFFFFFF t s t t s s t s t t x single of bits(bits of single(x) 0x7FFFFFFF) s r 3 t s s q t r t t t s t s t t s t r

24 rt r2 rs rt t rs t r s ts P rp st2 s t t s t t r t r s 2 t r2 s st r st r 2t s 2t s q 2t s st r 2t s s 2t s st r 2t s s t r rt s ss r t t r t t t t t a.d = double of bits(0x ) b.d = double of bits(0x x) r t r t t s t r r t r s t t r t t s t ts s q t r s t r t t t s r s t t 1 t t t t 2 31 x < 2 31 t s t t t rr t ss t s t s r t r t t r t t r t 2t t s r ts r r s 2 t s t t r2 t t ss t t r r s t t s t rs s r t 2 1 r s t 2 st st sr s 3 t 4 6 r r st st r sr r t r st rs t r2 s t s t t t s t 1 t s s 1 t t 2 t s r rr 2 sr t s t r s r r s 2 t s t src...src+n 1 r t 2t r t t2 r t Byte x r s s t t r x r x s s 1t s t r t r t2 s s t r t s t r t t2 r ts t st r t Byte x t s r s t r s s t r t s s t 2 t s r s t r r t Pointer b i n t r s s t r t s s ss r t t sr st r2 r s t t t 2 s s t r r t 2 t s t sr t t r t 2 st t r t r r ts t s r s r 2t s t r r s t 1 t r t 2 sr t st s r t 2 rt s s t s 2 sr t s t rs ts t t rs r t t s r s 1 s t r t 2 s t t r t st r r r2 r s t t ts t r2 r s s t 2 r rr 2s

25 r 2 32 t rt r t rs 2 t r s t s s r2 r t t rt r s t s r s t s 2t s tr 2 rs t str t r s t r 1 s t s t r rs t ss t r r st r ss r 1 s t str t r s t tt tr r s t s s r s t t r r t 1 r t r t s s t s r t s q st t r r t ts t t s ss rst t st r s r t t 1 st rr t 2 t t st r r r2 t r s 2 t t t r tt r t s t s 2t r 2t 2 r 2 t r 2s r r2 rs s r t 2 t 1 t 3 t r s rr t 2 t s 2t s r t r t r src...src+n 1 2 st r 2t s t st 2 rs rt r s r 2 r t t 2 s s t s s r s 2 s 2t s r t 2 st r 2t s s s r s r rr t t t t s t r t s t t t r 2t s t 2 st t st t 1 rt s t r r2 t ss 2 r t 2 s t 2t r2 ss s r t 2 r r t t s t t rt s2st s s r ts 2 t t s memcpy(dest, src, sizeof(src)) s t 2 s t 2 tt r s t 2 s t s r t r t r s s t 2 rr 2s t rs rs 2 s 3 r t s s 2 tr st st sr s 3 t 4 6 r s 3 st sr r t r st t rs rs t rt r2 s t t t s t rr t 2 s rr 2s t rs t rs t t ss t s t t str ts t 1t r t r s r s r rr 2s s str ts r s s t r r s t t t t t r s str ts r 2s r t t t s str t t t st t2 r ss tr r ss s tr rs t s t t tt r tr t r2 r t s t t r r s s t s rt r r ss t 3 t s t rt r r r s s t s r t st t t rt r t s t s t t r2 st t r r st rts 1 t s t s s r r2 r t r r r2 s t t t t t r r t s r 2 r 2 t 3 r s t r s t r ss s r t r r t ❼ t2 t t2 t r rr s t t r r

26 rt r2 rs ❼ t s t2 rr s t st r t t t t r ❼ r t t r s rt tr ts str t r s s t 3 rr 2s r t rs t t2 st r str t r s t t r ss s r r ss s r r s s s r ts rst tt t t t r r str t r 2 r ts r ss s s t s s t s s s r t t t t r2 s rr s t r s 2s t r r ss t s s t rr r r r r t tr2 t ss t st r r t ss t r t r r st r r t s tt r t s r s r 1 t s rt s t t r ss s t s t st t t2 r s t s t r st r r t s t s t t s t t r t t r t t t t r t t t 2 ss s t r t r t t r r s t t ss s tr t s t t t r t t t t ts r t r t t tr s r s r t r r 2 ss t r2 t r 2 t tt r s t t ss s tr t s r r st r r t s r 3 t t t2 t s t t t ss t t t t t r r st r r t st r rr r t t t r t st r t s t rr r t t r t s s s q t ss t r t r ss s t r s t t r s r t s t st r s st t t t r r s s t t s ss t r t s r s t r st s s t r t t r r t t2 t t t s ss s r t r s r s r t r s rt ss t 2 r s t st t rs t r s tt s s s t 2 t rr s t r r r2 st r s t t r r ss s r s t r 2 t r s t s r ss s t r r t t t t r t r t r r ss t 3 t s r t st t r t ss rt t t t t st ss r s s r st t st t r t r t 6 t t st rs t s 2s t r t 1 t t t s 2s t s t r r t t t t 3 t t 4 r t r 6 s s t t r st t r t ss s ts rr t ss r s t r s r t 2 1 ts t t r s t rt r2 2 t r s s t t t t ts st r s r t t t r2 st t t r2 st t t 2 t t r r 1 t s ss st r

27 r 2 32 t rt r t r r 2 t r r t t t ts r2 tt t st r s s s r2 s 1 r ss t st t t r2 st t 1 r ss s r r 2 t s 2 r s r 1 t s ss st r r q r s r t rr t r ss s r t t s t s s s s rt r s t r s r t st t r t st r s t 2 r s t q t2 t ss 2 r 2 rt s s s 1 t t s r s t t 2 r t r r t r t r ts 2 r st ts st r s r t r t t t r s s s rs t s rs t rt r2 s t s t s t s r t r t s rt t s r t r2 r r r s t r s r s r s r t r rt s r2 r t s t t rt s rr t ss r r s s r s r s tr s t s t t r ts ❼ r t r st r r t r r s s s t t s r2 r r s t t s t rs ts s t s t r r r rr t t r s t t t r s t s t s r t t 2 rt s t s r s r r ❼ r t s r s rs s s 2 str t r t r s rr rs 2 t rt r s t s t rt r t r r r r ss t 3 t s 2 t t r t t s rt s s t s t r t t s s rr rs t t t t r s rt s r2 s ts t2 t 2t ss t t r s s 2 r t s r st r t t t s t t s s t r t rt t ss s t 2s t t t s t t ❼ rst r s r 2 s sts 1t rt s t2 s t t s Vptr fragment(b, i, n) str t 2 t t n t 2t t r2 r r s t t t r Vptr(b, i) 2t s 3 st r r t s tr s t t t Vptr fragment(b, i, n) t Pointer(b, i, n) t t ss r t st t r t t r t s r s t tr r t s s t 1t s t t s t s t t 2 1 ❼ s r s r r r rt s rr t t2 s r t t r t t r s 2 t t2 st sts 2t r2 r r s t t s s s s t r 2 rr s s r r s t s r t r r 1 r ss s t t 2 t t r 2t r2 r r s t t s t s r t r t t r s t r sts 2t s s r r r t st r t t r t r r t t r r t s r r s s r rt r r t r rt s r 2 t tr t r r ss s t r2 s rst st t r s 1t rt t s r r2 t r r rr 2 rt r st s t s r

28 rt r2 rs r t r r t r t s t s rt s s r t r s ts t P s q s 1 r P 3 r t r s st s t s t r2 ts s s t rt s t s rr t ss r s r s r t s r2 s s r r t r s r r t s t r r s t r t t t Pr r s 2st s t r 2 s Pr r P t r t s t r s r r r r 32 r t r s st r r Pr r r r s t t P s t r t s t r s r r r 32 r r 2 3 s t s r t t s s t t r t t s 2 q q r r2 r r t t r t s q t r r t t t 2 s s t r t2 Pr ss r r t Pr t r r r s r P Pr t t t s Pr r str t t r t s t r s r r rst t q s r r rr t ss r r s t r t str t r s t rt s q s r r r s t s r t r s s r t Pr r s 2st s t s 2 s t r t s t r s r r q s r r r s r r s t s r rr t s r t Pr r s 2st s t r 2 s Pr r P t r t s t r s r r t r t st r Pr r s r r 2 r r t r st r t s t r r 2 r 32 r r t r2 ts s s r r 2 r r tr s r t s r t t s

29 r 2 32 t rt rr s r 3 P t s s rs t2 r r rt P t r r s r s rr 2 r s r t t r r 2 r rr s 2 s 2t s s r t t s2 s Pr s Pr r s s Pr ss r

30 RESEARCH CENTRE PARIS ROCQUENCOURT Domaine de Voluceau, - Rocquencourt B.P Le Chesnay Cedex Publisher Inria Domaine de Voluceau - Rocquencourt BP Le Chesnay Cedex inria.fr ISSN

Log Analysis for Data Protection Accountability (Extended Version)

Log Analysis for Data Protection Accountability (Extended Version) Log Analysis for Data Protection Accountability (Extended Version) Denis Butin, Daniel Le Métayer To cite this version: Denis Butin, Daniel Le Métayer. Log Analysis for Data Protection Accountability (Extended

Læs mere

Aalborg Universitet. Borgerinddragelse i Danmark Lyhne, Ivar; Nielsen, Helle; Aaen, Sara Bjørn. Publication date: 2015

Aalborg Universitet. Borgerinddragelse i Danmark Lyhne, Ivar; Nielsen, Helle; Aaen, Sara Bjørn. Publication date: 2015 Aalborg Universitet Borgerinddragelse i Danmark Lyhne, Ivar; Nielsen, Helle; Aaen, Sara Bjørn Publication date: 2015 Document Version Også kaldet Forlagets PDF Link to publication from Aalborg University

Læs mere

Citation for published version (APA): Byrge, C., & Hansen, S. (2011). Værktøjskasse til kreativitet [2D/3D (Fysisk produkt)].

Citation for published version (APA): Byrge, C., & Hansen, S. (2011). Værktøjskasse til kreativitet [2D/3D (Fysisk produkt)]. Aalborg Universitet Værktøjskasse til kreativitet Sørensen, Christian Malmkjær Byrge; Hansen, Søren Publication date: 2011 Document Version Indsendt manuskript Link to publication from Aalborg University

Læs mere

17 B 17 A 19 B 1 9 C A. Antal boliger: 37 Bolig størrelse: m2. 12 J 7000aa 31 J F 3 31 N 31 M. Tiltag:

17 B 17 A 19 B 1 9 C A. Antal boliger: 37 Bolig størrelse: m2. 12 J 7000aa 31 J F 3 31 N 31 M. Tiltag: 000p bb cg u F C D L z C ay ac bt 0af ae bi Nav: Tøreha resse: Søgae tal bolig: olig størrelse: - m 0ao s 0am bq 0p Nav: øgeha resse: Tøre -J tal bolig: 0 olig størrelse: m bl bx H y G br 000ak 0l bk bv

Læs mere

Aalborg Universitet. Undersøgelse af miljøvurderingspraksis i Danmark Lyhne, Ivar; Cashmore, Matthew Asa. Publication date: 2013

Aalborg Universitet. Undersøgelse af miljøvurderingspraksis i Danmark Lyhne, Ivar; Cashmore, Matthew Asa. Publication date: 2013 Aalborg Universitet Undersøgelse af miljøvurderingspraksis i Danmark Lyhne, Ivar; Cashmore, Matthew Asa Publication date: 2013 Document Version Peer-review version Link to publication from Aalborg University

Læs mere

Bidrag Til Den Danske Literaturs Historie: Det Lærde Tidsrum (Danish Edition) By Niels Matthias Petersen READ ONLINE

Bidrag Til Den Danske Literaturs Historie: Det Lærde Tidsrum (Danish Edition) By Niels Matthias Petersen READ ONLINE Bidrag Til Den Danske Literaturs Historie: Det Lærde Tidsrum 1560-1710 (Danish Edition) By Niels Matthias Petersen READ ONLINE If you are searched for a book by Niels Matthias Petersen Bidrag Til Den Danske

Læs mere

landinspektøren s meddelelsesblad maj 1968 udsendes kun til Den danske Landinspektørforenings redaktion: Th. Meklenborg Kay Lau ritzen landinspektører

landinspektøren s meddelelsesblad maj 1968 udsendes kun til Den danske Landinspektørforenings redaktion: Th. Meklenborg Kay Lau ritzen landinspektører landinspektøren s meddelelsesblad udsendes kun til Den danske Landinspektørforenings medlemmer redaktion: Th. Meklenborg Kay Lau ritzen landinspektører indhold: L a n d in s p e k t ø r lo v e n o g M

Læs mere

Bilag J - Beregning af forventet uheldstæthed på det tosporede vejnet i åbent land Andersen, Camilla Sloth

Bilag J - Beregning af forventet uheldstæthed på det tosporede vejnet i åbent land Andersen, Camilla Sloth Aalborg Universitet Bilag J - Beregning af forventet uheldstæthed på det tosporede vejnet i åbent land Andersen, Camilla Sloth Publication date: 2014 Document Version Også kaldet Forlagets PDF Link to

Læs mere

Afprøvning af InVentilate Ventilationssystem

Afprøvning af InVentilate Ventilationssystem Afprøvning af InVentilate Ventilationssystem P. Heiselberg Udarbejdet for: InVentilate A/S DCE Contract Report No. 108 Department of Civil Engineering Aalborg University Department of Civil Engineering

Læs mere

Grøn Open Access i Praksis

Grøn Open Access i Praksis Downloaded from orbit.dtu.dk on: Feb 03, 2017 Grøn Open Access i Praksis Sand, Ane Ahrenkiel Publication date: 2016 Document Version Også kaldet Forlagets PDF Link to publication Citation (APA): Sand,

Læs mere

Register. I. U d s e n d e l s e r. Rettelser til tjenestedokumenter.

Register. I. U d s e n d e l s e r. Rettelser til tjenestedokumenter. Register I. U d s e n d e l s e r T j e n e s t e d o k u m e n t e r. R e g le m e n t I, b i l a g s b o g e n...9 9, R e g le m e n t V... R e g le m e n t V I I I... P o s t g i r o b o g e n... V

Læs mere

Ikke-parametriske tests

Ikke-parametriske tests Ikke-parametriske tests 2 Dagens menu t testen Hvordan var det nu lige det var? Wilcoxson Mann Whitney U Kruskall Wallis Friedman Kendalls og Spearmans correlation 3 t-testen Patient Drug Placebo difference

Læs mere

Project Step 7. Behavioral modeling of a dual ported register set. 1/8/ L11 Project Step 5 Copyright Joanne DeGroat, ECE, OSU 1

Project Step 7. Behavioral modeling of a dual ported register set. 1/8/ L11 Project Step 5 Copyright Joanne DeGroat, ECE, OSU 1 Project Step 7 Behavioral modeling of a dual ported register set. Copyright 2006 - Joanne DeGroat, ECE, OSU 1 The register set Register set specifications 16 dual ported registers each with 16- bit words

Læs mere

FREDERIKSSUND KOMMUNE

FREDERIKSSUND KOMMUNE Plan og Miljøudvalget den 24. marts 2003 Side 1 af 10 FREDERIKSSUND KOMMUNE U DSKRIFT Plan og Miljøudvalget Mandag den 24. marts 2003 kl. kl. 14.00 i mødelokale Udvalgsværelset Mødedeltagere: Finn Vester,

Læs mere

Shared space - mellem vision og realitet. - Lyngby Idrætsby som case

Shared space - mellem vision og realitet. - Lyngby Idrætsby som case Downloaded from orbit.dtu.dk on: Jan 27, 2017 Shared space - mellem vision og realitet. - Lyngby Idrætsby som case Brinkø, Rikke Publication date: 2015 Document Version Peer-review version Link to publication

Læs mere

Aktiv lytning - som kompetence hos ph.d.-vejledere

Aktiv lytning - som kompetence hos ph.d.-vejledere Downloaded from orbit.dtu.dk on: Oct 09, 2016 Aktiv lytning - som kompetence hos ph.d.-vejledere Godskesen, Mirjam Irene; Wichmann-Hansen, Gitte Publication date: 2012 Document Version Også kaldet Forlagets

Læs mere

Bilag 8. TDC technical requirements for approval of splitterfilters and inline filters intended for shared access (ADSL or VDSL over POTS).

Bilag 8. TDC technical requirements for approval of splitterfilters and inline filters intended for shared access (ADSL or VDSL over POTS). Bilag 8. TDC technical requirements for approval of splitters and inline s intended for shared access (ADSL or VDSL over POTS). Dette bilag udgør bilag 8 til det mellem parterne tiltrådte Produkttillæg

Læs mere

fhair 52.0"; ( ^ ^ as Z < ^ -» H S M 3

fhair 52.0; ( ^ ^ as Z < ^ -» H S M 3 fair 52.0"; (515 974 ^ ^ as ^ -» S M 3 > D Z (D Z Q LU LU > LU W CC LO CO > CD LJJ > LJJ O LL .. O ^ CO ^ ^ ui,"" 2.2 C d. ii "^ S Q ~ 2 & 2 ^ S i; 2 C O T3 Q _, - - ^ Z W O 1- ' O CM OOCMOOO'-'O'^'N

Læs mere

Bilag 1: Dataanalyse af ordmaterialet, fase 1

Bilag 1: Dataanalyse af ordmaterialet, fase 1 1. Hvor mange har fået alternativt forslag opsat for hvert mulige alternative forslag af 41 elever (deltagere i prætest)? (Er det godt at teste for det alternative forslag?) Skåret ved < 20% dvs. BP, DT,

Læs mere

STUDIERETNINGER 2014-2017 SR1 SR2 SR3 SR4 SR5 MA A MA A MA A MA A BI A FY A FY B KE B BT A MA B KE B FI C BI B FY B ID B

STUDIERETNINGER 2014-2017 SR1 SR2 SR3 SR4 SR5 MA A MA A MA A MA A BI A FY A FY B KE B BT A MA B KE B FI C BI B FY B ID B STUDIERETNINGER 2014-2017 SR1 SR2 SR3 SR4 SR5 MA A MA A MA A MA A BI A FY A FY B KE B BT A MA B KE B FI C BI B FY B ID B SR6 SR7 SR8 SR9 SR10 SR11 SR12 SA A EN A EN A MU A EN A EN A EN A MA B SA B ME B

Læs mere

Gram Skole 2018 (Haderslev)

Gram Skole 2018 (Haderslev) GRAM SKOLE 2018 (HADERSLEV) / 10. DECEMBER 2018 Gram Skole 2018 (Haderslev) Gram Skole har udviklet Gramblomsten, der g ennem samarbejde og struktur har formået at skabe en alsidig og succesfuld holddeling,

Læs mere

D Referat af ekstraordinær generalforsamling i Å T O F T E N S G RU N D E J E RF O RE N I N G tirsdag den 23. marts 2004 kl. 19.30 i fælleshuset a g s o r d e n 1. V a l g a f d i r i g e n t 2. K ø b

Læs mere

Aalborg Universitet. Økonomisk ulighed og selvværd Hansen, Claus Dalsgaard. Publication date: 2011

Aalborg Universitet. Økonomisk ulighed og selvværd Hansen, Claus Dalsgaard. Publication date: 2011 Aalborg Universitet Økonomisk ulighed og selvværd Hansen, Claus Dalsgaard Publication date: 2011 Document Version Tidlig version også kaldet pre-print Link to publication from Aalborg University Citation

Læs mere

Aalborg Universitet. Empty nesters madpræferencer på feriehusferie Baungaard, Gitte; Knudsen, Kirstine ; Kristensen, Anja. Publication date: 2011

Aalborg Universitet. Empty nesters madpræferencer på feriehusferie Baungaard, Gitte; Knudsen, Kirstine ; Kristensen, Anja. Publication date: 2011 Aalborg Universitet Empty nesters madpræferencer på feriehusferie Baungaard, Gitte; Knudsen, Kirstine ; Kristensen, Anja Publication date: 2011 Document Version Også kaldet Forlagets PDF Link to publication

Læs mere

FREDERIKSSUND KOMMUNE

FREDERIKSSUND KOMMUNE Økonomiudvalget den 21. januar 2002 Side 1 af 9 FREDERIKSSUND KOMMUNE U DSKRIFT Økonomiudvalget 21. januar 2002 kl. 16.00 i mødelokale 2 Mødedeltagere: Knud B. Christoffersen, F in n V e s te r, B e n

Læs mere

StarWars-videointro. Start din video på den nørdede måde! Version: August 2012

StarWars-videointro. Start din video på den nørdede måde! Version: August 2012 StarWars-videointro Start din video på den nørdede måde! Version: August 2012 Indholdsfortegnelse StarWars-effekt til videointro!...4 Hent programmet...4 Indtast din tekst...5 Export til film...6 Avanceret

Læs mere

Aalborg Universitet. Banker i Danmark pr. 22/3-2012 Krull, Lars. Publication date: 2012. Document Version Pre-print (ofte en tidlig version)

Aalborg Universitet. Banker i Danmark pr. 22/3-2012 Krull, Lars. Publication date: 2012. Document Version Pre-print (ofte en tidlig version) Aalborg Universitet Banker i Danmark pr. 22/3-2012 Krull, Lars Publication date: 2012 Document Version Pre-print (ofte en tidlig version) Link to publication from Aalborg University Citation for published

Læs mere

På nedenstående billede skal du finde den figur som optræder nøjagtig 3 gange.

På nedenstående billede skal du finde den figur som optræder nøjagtig 3 gange. Navn: Klasse: Materiale ID: PIC.33.1.1.da Lærer: Dato: Klasse: Materiale ID: PIC.33.1.1.da Navn: Klasse: Materiale ID: PIC.33.2.1.da Lærer: Dato: Klasse: Materiale ID: PIC.33.2.1.da Navn: Klasse: Materiale

Læs mere

Agenda. Ny Digital Strategi Data og Vækst Smart Government. Carsten Ingerslev: [email protected]

Agenda. Ny Digital Strategi Data og Vækst Smart Government. Carsten Ingerslev: caring@erst.dk Agenda Ny Digital Strategi Data og Vækst Smart Government Carsten Ingerslev: [email protected] Roadmap for forudsætninger Indsatsområder 1 2 Vision og rammefortælling 3 1.1 1.2 2.1 2.2 2.3 3.1 3.2 Digital

Læs mere

No. 5 I'm An Ordinary Man

No. 5 I'm An Ordinary Man Voice Keyoard MD Bass Clarinet in B 0 & & solo No 5 I'm An Ordinary Man Moderato q = 108 "jeg' en ganske enkel mand clarinet Moderato jeg or - lan - ger kun så lidt mit krav er li - ge- til at kun - ne

Læs mere

Hosted CRM Outlook client connector setup guide. Date: Version: 1. Author: anb. Target Level: Customer. Target Audience: End User

Hosted CRM Outlook client connector setup guide. Date: Version: 1. Author: anb. Target Level: Customer. Target Audience: End User Hosted CRM 2011 Outlook client connector setup guide Date: 2011-06-29 Version: 1 Author: anb Target Level: Customer Target Audience: End User Language: da-dk Page 1 of 16 LEGAL INFORMATION Copyright 2011

Læs mere

Bibliotheca Danica: Systematisk Fortegnelse Over Den Danske Literatur Fra 1482 Til 1830, Efter Samlingerne I Det Store Kongelige Bibliothek I...

Bibliotheca Danica: Systematisk Fortegnelse Over Den Danske Literatur Fra 1482 Til 1830, Efter Samlingerne I Det Store Kongelige Bibliothek I... Bibliotheca Danica: Systematisk Fortegnelse Over Den Danske Literatur Fra 1482 Til 1830, Efter Samlingerne I Det Store Kongelige Bibliothek I... Brahes Bibliothek I Odense (Danish Edition) By Kongelige

Læs mere

B # n # # # #

B # n # # # # 1 3Somm i Tyrol Teor 1 Teor aritoe q 0 3 0 3 Л 0 som - m - sol ved "De hvi - de hest" ag al - e - ro - s-es som - m - sol ved "De hvi - de hest" ag al - e - ro - s-es ass som - m - sol ved "De hvi - de

Læs mere

Where and why? - How to use welded branches

Where and why? - How to use welded branches O-LETS 1.1.6.1 Where and why? - How to use welded branches Welded Tee 1. Everywhere where welded branches are recommended O-let 2. O-lets replace the welded Tee coasing a reduction of material and labour

Læs mere

Fejlbeskeder i SMDB. Business Rules Fejlbesked Kommentar. Validate Business Rules. Request- ValidateRequestRegist ration (Rules :1)

Fejlbeskeder i SMDB. Business Rules Fejlbesked Kommentar. Validate Business Rules. Request- ValidateRequestRegist ration (Rules :1) Fejlbeskeder i SMDB Validate Business Rules Request- ValidateRequestRegist ration (Rules :1) Business Rules Fejlbesked Kommentar the municipality must have no more than one Kontaktforløb at a time Fejl

Læs mere

WT-1011RC Programmer User Guide

WT-1011RC Programmer User Guide WT-1011RC Programmer User Guide Firmware Version 1.9 Note: 1. Information in this manual is subject to change without notice and does not represent a commitment of manufacturer. 2. Manufacturer shall not

Læs mere

OCD DTU. Screening of aluminium in the offshore industry. Screening. DOC. NO. dokument 1 March 2007

OCD DTU. Screening of aluminium in the offshore industry. Screening. DOC. NO. dokument 1 March 2007 CVR: 27171877 VestJysk Bank: 7606 1064127 OCD DTU Screening of aluminium in the offshore industry Screening DOC. NO. dokument 1 March 2007 [email protected] Tel: +45 36973670 www.offshorecenter.dk../2

Læs mere

To the reader: Information regarding this document

To the reader: Information regarding this document To the reader: Information regarding this document All text to be shown to respondents in this study is going to be in Danish. The Danish version of the text (the one, respondents are going to see) appears

Læs mere

Løsning af skyline-problemet

Løsning af skyline-problemet Løsning af skyline-problemet Keld Helsgaun RUC, oktober 1999 Efter at have overvejet problemet en stund er min første indskydelse, at jeg kan opnå en løsning ved at tilføje en bygning til den aktuelle

Læs mere

ÅTOFTENS GRUNDEJERFORENING 20. se p t e mb e r 2006 I h e n h o l d t i l v e d t æ g t e rn e s 4 i n d k al d e s h e rme d t i l ORDINÆ R GENERA L FORSA M L ING t o rsd ag d e n 5. o k t o b e r 2006

Læs mere

Kosmetik Metoder til prøvning af solbeskyttelse In vivo-bestemmelse af UVA-beskyttelse

Kosmetik Metoder til prøvning af solbeskyttelse In vivo-bestemmelse af UVA-beskyttelse Dansk standard DS/EN ISO 24442 1. udgave 2012-02-01 Kosmetik Metoder til prøvning af solbeskyttelse In vivo-bestemmelse af UVA-beskyttelse Cosmetics Sun protection test methods In vivo determination of

Læs mere

Syddansk Universitet. Notat om Diabetes i Danmark Juel, Knud. Publication date: 2007. Document Version Også kaldet Forlagets PDF. Link to publication

Syddansk Universitet. Notat om Diabetes i Danmark Juel, Knud. Publication date: 2007. Document Version Også kaldet Forlagets PDF. Link to publication Syddansk Universitet Notat om Diabetes i Danmark Juel, Knud Publication date: 27 Document Version Også kaldet Forlagets PDF Link to publication Citation for pulished version (APA): Juel, K., (27). Notat

Læs mere

m² ARKIV/ LAGER. Rahbeks Alle 21, kld., 1801 Frederiksberg Sag (NRL)

m² ARKIV/ LAGER. Rahbeks Alle 21, kld., 1801 Frederiksberg Sag (NRL) 100 228 m² ARKIV/ LAGER Rahbeks Alle 21, kld., 1801 Frederiksberg Sag 129617 (NRL) EJENDOMMEN/ LEJEMÅLENE DK BELIGGENHED DK Flot fredet ejendom opført i 1862, med ydervæg af røde mursten, kalksandsten

Læs mere

WT-1011RC Programmer User Guide

WT-1011RC Programmer User Guide WT-1011RC Programmer User Guide Firmware Version 1.9 Note: 1. Information in this manual is subject to change without notice and does not represent a commitment of manufacturer. 2. Manufacturer shall not

Læs mere

LUL s Flower Power Vest dansk version

LUL s Flower Power Vest dansk version LUL s Flower Power Vest dansk version Brug restgarn i bomuld, bomuld/acryl, uld etc. 170-220 m/50 g One size. Passer str S-M. Brug større hæklenål hvis der ønskes en større størrelse. Hæklenål 3½ mm. 12

Læs mere

University Colleges. Sådan kan du hjælpe dit barn med lektierne! Kristensen, Kitte Søndergaard. Publication date: 2011

University Colleges. Sådan kan du hjælpe dit barn med lektierne! Kristensen, Kitte Søndergaard. Publication date: 2011 University Colleges Sådan kan du hjælpe dit barn med lektierne! Kristensen, Kitte Søndergaard Publication date: 2011 Document Version Tidlig version også kaldet pre-print Link to publication Citation for

Læs mere

Senest opdateret 10. juni 2009. DanBib søgekoder oversigt over søgekodehierarkier

Senest opdateret 10. juni 2009. DanBib søgekoder oversigt over søgekodehierarkier Senest opdateret 10. juni 2009 DanBib søgekoder oversigt over søgekodehierarkier Dette dokument viser sammenhængen mellem de søgekoder i DanBib der søger forfatter/ophav, titler, emneord, klassifikation

Læs mere