Proceedings of CSAW'04 - FTP Directory Listing - University of Malta

More documents

Recommendations

Info

32 Joseph Cordina memory location, allowing SMV to verify the algorithm for all possible values. Note that concurrent algorithms should ensure that values are always deterministic, and SMV clearly shows where these restrictions have to be applied. 3 Pre-Processing While SMV presents a language that is easily-understandable, it can quickly become a daunting task to re-write complex algorithms using this language. To aid in the process of verification, we have created a description language that would enable the user to specify a concurrent algorithm which is then used to create an SMV specification. Implementing several common concurrent algorithms in SMV, we have pinpointed several elements that such a description should contain. Apart from the algorithm itself, written in assembly format, the user should be able to provide general assumptions for the model in addition to properties that need to be proven. These assumptions and properties should be stated in temporal logic, a simple yet powerful construct. Additionally, we have provided the facility to create certain logical assertions depending on the algorithm’s line number, thus enabling logical properties to be based on these assertions. We have made use of FLEX [11] to generate a parser and scanner for the algorithm description that is then able to generate a specification in SMV. Figure 1 shows the data flow in the process of verification. We envisage to create a parser for the SMV counter example output, allowing visual representation of the execution trace leading to the occurrence of the false assertion of a particular property. Description Language Concurrent Algorithm Specification SMV Specification Flex-based Generator Algorithm Specification + SMP Specification SMV Output SMV System Counter Example or Verified Property Fig. 1. Data Flow in the Verification Process 3.1 Results What follows is a sample description file showing all characteristics making up an algorithm description together with all properties to be proven. This example is targeted to be used for SMP
The Use of Model-Checking for the Verification of Concurrent Algorithms 33 systems. In this description we have specified a trivial yet valid concurrent algorithm, namely the basic spin-lock algorithm with cache-invalidation [3]. CPU 2 REGISTERS carry:boolean; MEMORY lock:boolean; STATEVARS lockacquired:boolean; LABELS LABEL1 1 LABEL2 4 LABEL3 5 CODE btsl lock jne LABEL2 jmp LABEL1 nop ASSERTIONS 4:lockacquired:=1; TRIGGER getlock:boolean; CODE btrl lock nop ASSERTIONS 2:lockacquired:=0; TRIGGER releaselock:boolean; START lock:=0; lockacquired:=0; PERCPUASSUMPTIONS norelease: G(releaselock->lockacquired) EXCLUSIVEINSTRUCTIONS LABEL1 LABEL3
Page 1: TECHNICAL REPORT Report No. CSAI200
Page 5: Preface Last year, the Department o
Page 8 and 9: IV Non-Monotonic Search Strategies
Page 10 and 11: 2 Ernest Cachia and Mark Micallef 2
Page 14 and 15: 6 Ernest Cachia and Mark Micallef W
Page 18 and 19: 10 Andrew Calleja phenomenon which
Page 20 and 21: 12 Andrew Calleja of a hydrological
Page 22 and 23: 14 Andrew Calleja will take longer
Page 24 and 25: 16 Andrew Calleja volume of water t
Page 26 and 27: 18 Andrew Calleja as a thin sheet o
Page 28 and 29: 20 Michel Camilleri where a is the
Page 30 and 31: 22 Michel Camilleri If separation o
Page 32 and 33: 24 Michel Camilleri be high. One mu
Page 34 and 35: 26 Michel Camilleri 7 Prediction Te
Page 36 and 37: 28 Michel Camilleri References 1. H
Page 38 and 39: 30 Joseph Cordina 2 Model-Checking
Page 42 and 43: 34 Joseph Cordina PROVE mutex: G ~(
Page 44 and 45: TTS Pre-processing Issues for Mixed
Page 46 and 47: 38 Paulseph-John Farrugia of affair
Page 48 and 49: 40 Paulseph-John Farrugia corpora a
Page 50 and 51: Low-Latency Message Passing Over Gi
Page 52 and 53: 44 Keith Fenech Servicing these int
Page 54 and 55: 46 Keith Fenech 2.4 Short messaging
Page 56 and 57: 48 Keith Fenech 4. Joseph Cordina.
Page 58 and 59: 50 Matthew Montebello - Discovery:
Page 60 and 61: Automatic Document Clustering Using
Page 62 and 63: 54 Robert Muscat Average-Link The d
Page 64 and 65: 56 Robert Muscat 3.1 Clustering Met
Page 66 and 67: 58 Robert Muscat The most critical
Page 68 and 69: Monadic Compositional Parsing with
Page 70 and 71: 62 Gordon J. Pace one :: Parser a a
Page 72 and 73: 64 Gordon J. Pace Indefinite nouns
Page 74 and 75: 66 Gordon J. Pace case (parse (star
Page 76 and 77: 68 Gordon J. Pace setAttribute :: (
Page 78 and 79: 70 Gordon J. Pace The work presente
Page 80 and 81: 72 Derrick Pisani The rank of a mat
Page 82 and 83: 74 Derrick Pisani 4 Applications in
Page 84 and 85: 76 Derrick Pisani Exposing Componen
Page 86 and 87: Corpus-Driven Bilingual Lexicon Ext
Page 88 and 89: 80 Michael Rosner Interlingua inter
Page 90 and 91:
82 Michael Rosner - Subsegments are
Page 92 and 93:
84 Michael Rosner 3.3 Word Alignmen
Page 94 and 95:
Visual Modeling of OWL-S Services J
Page 96 and 97:
88 James Scicluna, Charlie Abela an
Page 98 and 99:
Page 100 and 101:
Page 102 and 103:
Page 104 and 105:
96 Sandro Spina and John Abela 2.1
Page 106 and 107:
98 Sandro Spina and John Abela Both
Page 108 and 109:
100 Sandro Spina and John Abela 2.
Page 110 and 111:
102 Kenneth J. Spiteri possibility
Page 112 and 113:
104 Kenneth J. Spiteri 22. Romin Ir
Page 114 and 115:
Expanding Query Terms in Context Ch
Page 116 and 117:
108 Chris Staff and Robert Muscat w
Page 118 and 119:
110 Nikolai Sultana by another rema
Page 120 and 121:
112 Nikolai Sultana Source code Sou
Page 122 and 123:
114 Nikolai Sultana A variety of to
Page 124 and 125:
116 Nikolai Sultana This visualisat
Page 126 and 127:
118 Nikolai Sultana Dealing with wi
Page 128 and 129:
120 Christine Vella 1. SharpHDL, wh
Page 130 and 131:
122 Christine Vella 3 Generic Circu
Page 132 and 133:
124 Christine Vella Empty String, w
Page 134 and 135:
126 Christine Vella Fig. 7. Circuit
Page 136 and 137:
128 Christine Vella also used Sharp
Page 138 and 139:
130 Wallace Wadge Grid technologies
Page 141:
Author Index Abela, Charlie, 86 Abe
show all

Proceedings of CSAW'04 - FTP Directory Listing - University of Malta

Create successful ePaper yourself

Delete template?

Save as template?