Stephan Spengler
Doktorand vid Institutionen för informationsteknologi; Datorteknik
- Telefon:
- 018-471 10 51
- E-post:
- stephan.spengler@it.uu.se
- Besöksadress:
- Hus 10, Regementsvägen 10
- Postadress:
- Box 524
751 20 UPPSALA
Publikationer
Senaste publikationer
-
On the Verification Problem of Remote Direct Memory Access Programs
Ingår i Computer Aided Verification, s. 113-135, 2026
- DOI för On the Verification Problem of Remote Direct Memory Access Programs
- Ladda ner fulltext (pdf) av On the Verification Problem of Remote Direct Memory Access Programs
-
Ingår i Logical Methods in Computer Science, 2025
- DOI för TSO Games: On the decidability of safety games under the total store order semantics (extended LMCS version with appendix)
- Ladda ner fulltext (pdf) av TSO Games: On the decidability of safety games under the total store order semantics (extended LMCS version with appendix)
-
Reachability and Safety Games under TSO Semantics
Ingår i Proceedings Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2024), s. 154-171, 2024
-
Parameterized Verification under TSO with Data Types
Ingår i Tools and Algorithms for the Construction and Analysis of Systems, s. 588-606, 2023
- DOI för Parameterized Verification under TSO with Data Types
- Ladda ner fulltext (pdf) av Parameterized Verification under TSO with Data Types
-
TSO Games: On the decidability of safety games under the total store order semantics
Ingår i Electronic Proceedings in Theoretical Computer Science, s. 82-98, 2023
- DOI för TSO Games: On the decidability of safety games under the total store order semantics
- Ladda ner fulltext (pdf) av TSO Games: On the decidability of safety games under the total store order semantics
Alla publikationer
Artiklar i tidskrift
-
Ingår i Logical Methods in Computer Science, 2025
- DOI för TSO Games: On the decidability of safety games under the total store order semantics (extended LMCS version with appendix)
- Ladda ner fulltext (pdf) av TSO Games: On the decidability of safety games under the total store order semantics (extended LMCS version with appendix)
-
TSO Games: On the decidability of safety games under the total store order semantics
Ingår i Electronic Proceedings in Theoretical Computer Science, s. 82-98, 2023
- DOI för TSO Games: On the decidability of safety games under the total store order semantics
- Ladda ner fulltext (pdf) av TSO Games: On the decidability of safety games under the total store order semantics
Konferensbidrag
-
On the Verification Problem of Remote Direct Memory Access Programs
Ingår i Computer Aided Verification, s. 113-135, 2026
- DOI för On the Verification Problem of Remote Direct Memory Access Programs
- Ladda ner fulltext (pdf) av On the Verification Problem of Remote Direct Memory Access Programs
-
Reachability and Safety Games under TSO Semantics
Ingår i Proceedings Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2024), s. 154-171, 2024
-
Parameterized Verification under TSO with Data Types
Ingår i Tools and Algorithms for the Construction and Analysis of Systems, s. 588-606, 2023
- DOI för Parameterized Verification under TSO with Data Types
- Ladda ner fulltext (pdf) av Parameterized Verification under TSO with Data Types