Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Bäumler, Simon"'
Autor:
Bäumler, Simon1 baeumler@informatik.uni-augsburg.de, Balser, Michael1 balser@informatik.uni-augsburg.de, Nafz, Florian1 nafz@informatik.uni-augsburg.de, Reif, Wolfgang1 reif@informatik.uni-augsburg.de, Schellhorn, Gerhard1 schellhorn@informatik.uni-augsburg.de
Publikováno v:
AI Communications. 2010, Vol. 23 Issue 2/3, p285-307. 23p. 2 Color Photographs, 7 Diagrams, 13 Charts, 1 Graph.
Autor:
Bäumler, Simon
Infolge der zunehmenden Vernetzung und des Einsatzes von Mehrkernprozessoren gewinnt die Verifikation von parallelen Programmen zunehmend an Bedeutung. Mit dem Theorembeweiser KIV und der temporalen Logik ITL+ steht für solche Programme ein intuitiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::bfc7777992d313620f8a3ec889711945
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/1913
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/1913
The combination of temporal logic and rely-guarantee reasoning is a solid approach for the verification of concurrent programs. We describe a formalization of rely-guarantee reasoning within the temporal logic framework of the interactive prover KIV.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::c112ede29259870bfbf0b3e1e66d6cd3
https://opus.bibliothek.uni-augsburg.de/opus4/files/1435/TR_2010_07.pdf
https://opus.bibliothek.uni-augsburg.de/opus4/files/1435/TR_2010_07.pdf
The development and analysis of efficient concurrent algorithms is currently an active field of research. Lock-free implementations try to better utilize the capacity of modern multi-core computers, by increasing the potential to run in parallel. Thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::c4f8d02fb2ee90e4b31197fd21f6e1ab
https://opus.bibliothek.uni-augsburg.de/opus4/files/1340/TR_2009_20.pdf
https://opus.bibliothek.uni-augsburg.de/opus4/files/1340/TR_2009_20.pdf
Model checking is known as an automatic verification technique which can be applied very efficiently. Formalisation of medical guidelines in Asbru enables us to apply formal verification on medical guidelines. In this deliverable we show, how model c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::92fdeddef969c565623ef360b32b876a
https://opus.bibliothek.uni-augsburg.de/opus4/files/1286/TR_2009_14.pdf
https://opus.bibliothek.uni-augsburg.de/opus4/files/1286/TR_2009_14.pdf
Linearizability is a correctness criterion for concurrent systems. In this report, we describe how temporal logic can be used to prove linearizability of a concurrent lock-free stack implementation. The logic used is an extended variant of Interval T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::135b305284c0e332f2582ed404765367
https://opus.bibliothek.uni-augsburg.de/opus4/files/1214/TR_2008_19.pdf
https://opus.bibliothek.uni-augsburg.de/opus4/files/1214/TR_2008_19.pdf
In this paper we present an embedding of the most common branching time logics (CTL/CTL*) in an extension of interval temporal logic (ITL+). The significance of this result is threefold: first the theoretical aspect is, that branching time and linear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::9dc0e85cb778608873cb2cf4dec5c94e
https://opus.bibliothek.uni-augsburg.de/opus4/files/1187/TR_2008_16.pdf
https://opus.bibliothek.uni-augsburg.de/opus4/files/1187/TR_2008_16.pdf
Autor:
Bäumler, Simon
Verification of medical guidelines by model checking : a case study / S. Bäumler ... - In: Model checking software : proceedings / 13th International SPIN Workshop, Vienna, Austria, March 30 - April 1, 2006. Antti Valmar (ed.]. - Berlin u. a. : Spri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::99aa0648356d05082391b46d71253b4b
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/35695
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/35695