Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Verification of Directed Acyclic Ad Hoc Networks
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. (Algorithmic Program Verification)
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. (Algorithmic Program Verification)
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. (Algorithmic Program Verification)
2013 (Engelska)Ingår i: Formal Techniques for Distributed Systems: FORTE 2013, Springer Berlin/Heidelberg, 2013, s. 193-208Konferensbidrag, Publicerat paper (Refereegranskat)
Ort, förlag, år, upplaga, sidor
Springer Berlin/Heidelberg, 2013. s. 193-208
Serie
Lecture Notes in Computer Science, ISSN 0302-9743 ; 7892
Nationell ämneskategori
Datorsystem
Forskningsämne
Datavetenskap
Identifikatorer
URN: urn:nbn:se:uu:diva-211409DOI: 10.1007/978-3-642-38592-6_14ISBN: 978-3-642-38591-9 (tryckt)OAI: oai:DiVA.org:uu-211409DiVA, id: diva2:667794
Konferens
Formal Techniques for Distributed Systems (FORTE 2013), June 3-5, 2013, Florence, Italy
Projekt
ProFuN
Forskningsfinansiär
Stiftelsen för strategisk forskning (SSF)Tillgänglig från: 2013-11-27 Skapad: 2013-11-22 Senast uppdaterad: 2017-11-27Bibliografiskt granskad
Ingår i avhandling
1. Verification of networks of communicating processes: Reachability problems and decidability issues
Öppna denna publikation i ny flik eller fönster >>Verification of networks of communicating processes: Reachability problems and decidability issues
2017 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

Computer systems are used in almost all aspects of our lives and our dependency on them keeps on increasing. When computer systems are used to handle critical tasks, any software failure can cause severe human and/or material losses. Therefore, for such applications, it is important to detect software errors at an early stage of software development. Furthermore, the growing use of concurrent and distributed programs exponentially increases the complexity of computer systems, making the problem of detecting software errors even harder (if not impossible). This calls for defining systematic and efficient techniques to evaluate the safety and the correctness of programs. The aim of Model-Checking is to analyze automatically whether a given program satisfies its specification. Early applications of Model-Checking were restricted to systems whose behaviors can be captured by finite graphs, so called finite-state systems. Since many computer systems cannot be modeled as finite-state machines, there has been a growing interest in extending the applicability of Model-Checking to infinite-state systems.

The goal of this thesis is to extend the applicability of Model Checking for three instances of infinite-state systems: Ad-Hoc Networks, Dynamic Register Automata and Multi Pushdown Systems. Each one of these instances models challenging types of networks of communicating processes. In both Ad-Hoc Networks and Dynamic Register Automata, communication is carried through message passing. In each type of network, a graph topology models the communication links between processes in the network. The graph topology is static in the case of Ad-Hoc Networks while it is dynamic in the case of Dynamic Register Automata. The number of processes in both types of networks is unbounded. Finally, we consider Multi Pushdown Systems, a model used to study the behaviors of concurrent programs composed of sequential recursive sequential programs communicating through a shared memory.

Ort, förlag, år, upplaga, sidor
Uppsala: Acta Universitatis Upsaliensis, 2017. s. 148
Serie
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 1605
Nyckelord
program verification, model checking, infinite-state systems, distributed programs, concurrent programs, networks of communicating processes, reachability, termination, decidability
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Datavetenskap
Identifikatorer
urn:nbn:se:uu:diva-334788 (URN)978-91-513-0169-3 (ISBN)
Disputation
2018-01-12, ITC/2446, Polacksbacken, Lägerhyddsvägen 2,, Uppsala, 13:15 (Engelska)
Opponent
Handledare
Tillgänglig från: 2017-12-21 Skapad: 2017-11-27 Senast uppdaterad: 2018-03-08

Open Access i DiVA

fulltext(400 kB)142 nedladdningar
Filinformation
Filnamn FULLTEXT02.pdfFilstorlek 400 kBChecksumma SHA-512
d5fa1b8d744913846b25e511d3706f0060bae142ae0043ef292834647cda5aa9db3eb0d20750595c6bb8d72ff068ee9276d9ffe4581f891b8868015113a06089
Typ fulltextMimetyp application/pdf

Övriga länkar

Förlagets fulltext

Sök vidare i DiVA

Av författaren/redaktören
Abdulla, Parosh AzizAtig, Mohamed FaouziRezine, Othmane
Av organisationen
Datorteknik
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 142 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 787 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf