2024W

• Bachelor Thesis for Informatics and Business Informatics / 185.A26 / PR
• Fundamentals of Digital Systems / 192.134 / VU
• Orientation Bachelor with Honors of Informatics and Business Informatics / 180.767 / SE
• Project in Computer Science 1 / 192.021 / PR
• Project in Computer Science 2 / 192.022 / PR
• Research Seminar for Master and PhD students / 185.A39 / SE
• Scientific Research and Writing / 193.052 / SE
• Seminar in Security (Smart Contracts) / 192.128 / SE
• Seminar in Software Engineering (Smart Contracts) / 192.127 / SE
• Theoretical Computer Science / 192.017 / VU

2025S

• Bachelor Thesis for Informatics and Business Informatics / 185.A26 / PR
• Orientation Bachelor with Honors of Informatics and Business Informatics / 180.767 / SE
• Project in Computer Science 1 / 192.021 / PR
• Project in Computer Science 2 / 192.022 / PR
• Research Seminar for Master and PhD students / 185.A39 / SE
• Smart Contracts / 192.078 / VU

• Proof analysis and autom. deduction for recursive structures
  2022 – 2025 / Austrian Science Fund (FWF)
  Publications: 202367 / 202188 / 202606 / 202369 / 206166 / 210870 / 210866
• A novel decision support system for training and diagnosis in dermatology
  2013 – 2015 / Austrian Research Promotion Agency (FFG)
• Algorithms and Complexity of Constraint Languages
  2012 – 2016 / Austrian Science Fund (FWF)
• A graphical editor for object-oriented, constraint-based knowledge bases
  2010 – 2011 / Siemens AG Österreich

2024

• Systematic Study of Compilers and Vulnerability Scanners Using the Example of Integer Bugs / DiAngelo, M., Mohr, R., & Salzer, G. (2024). Systematic Study of Compilers and Vulnerability Scanners Using the Example of Integer Bugs. In 2024 IEEE International Conference on Blockchain (Blockchain) (pp. 243–251). https://doi.org/10.1109/Blockchain62396.2024.00039
• Evolution of automated weakness detection in Ethereum bytecode: a comprehensive study / di Angelo, M., Durieux, T., Ferreira, J. F., & Salzer, G. (2024). Evolution of automated weakness detection in Ethereum bytecode: a comprehensive study. Empirical Software Engineering, 29(2), Article 41. https://doi.org/10.1007/s10664-023-10414-8
• Bytecode Skeletons for Sample Selection in the Analysis of Blockchain Programs / di Angelo, M., & Salzer, G. (2024). Bytecode Skeletons for Sample Selection in the Analysis of Blockchain Programs. In Proceedings 2024 IEEE International Conference on Blockchain and Cryptocurrency (ICBC) (pp. 531–539). https://doi.org/10.1109/ICBC59979.2024.10634441

2023

• Consolidation of Ground Truth Sets for Weakness Detection in Smart Contracts / di Angelo, M., & Salzer, G. (2023). Consolidation of Ground Truth Sets for Weakness Detection in Smart Contracts. In A. Essex, S. Matsuo, & O. Kulyk (Eds.), Financial Cryptography and Data Security. FC 2023 International Workshops : Voting, CoDecFin, DeFi, WTSC, Bol, Brač, Croatia, May 5, 2023, Revised Selected Papers (pp. 439–455). Springer. https://doi.org/10.1007/978-3-031-48806-1_28
• SmartBugs 2.0: An Execution Framework for Weakness Detection in Ethereum Smart Contracts / Monika di Angelo, Durieux, T., Ferreira João F., & Gernot Salzer. (2023). SmartBugs 2.0: An Execution Framework for Weakness Detection in Ethereum Smart Contracts. In 2023 38th IEEE/ACM International Conference on Automated Software Engineering (ASE) (pp. 2102–2105). IEEE. https://doi.org/10.1109/ASE56229.2023.00060

2022

• Review of Automated Vulnerability Analysis of Smart Contracts on Ethereum / Rameder, H., di Angelo, M., & Salzer, G. (2022). Review of Automated Vulnerability Analysis of Smart Contracts on Ethereum. Frontiers in Blockchain, 5. https://doi.org/10.3389/fbloc.2022.814977

2021

• Identification of token contracts on Ethereum: standard compliance and beyond / di Angelo, M., & Salzer, G. (2021). Identification of token contracts on Ethereum: standard compliance and beyond. International Journal of Data Science and Analytics. https://doi.org/10.1007/s41060-021-00281-1
  Download: PDF (915 KB)
• Towards the Identification of Security Tokens on Ethereum / Di Angelo, M., & Salzer, G. (2021). Towards the Identification of Security Tokens on Ethereum. In 3rd International Workshop on Blockchains and Smart Contracts (BSC 2020-2021) (p. 5). https://doi.org/10.1109/NTMS49979.2021.9432663
• Empirical Evaluation of MakerDAO's Resilience / Kjäer, M., Di Angelo, M., & Salzer, G. (2021). Empirical Evaluation of MakerDAO’s Resilience. In Proc. Conference on Blockchain Research & Applications for Innovative Networks and Services (p. 8). https://doi.org/10.1109/BRAINS52497.2021.9569811
• MCP: Capturing Big Data by Satisfiability (Tool Description) / Hermann, M., & Salzer, G. (2021). MCP: Capturing Big Data by Satisfiability (Tool Description). In Theory and Applications of Satisfiability Testing – SAT 2021 (pp. 207–215). Springer LNCS. https://doi.org/10.1007/978-3-030-80223-3_14

2020

• Assessing the Similarity of Smart Contracts by Clustering their Interfaces / di Angelo, M., & Salzer, G. (2020). Assessing the Similarity of Smart Contracts by Clustering their Interfaces. In 2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom). 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), Guangzhou, China. IEEE. https://doi.org/10.1109/trustcom50675.2020.00261
• Wallet Contracts on Ethereum / Di Angelo, M., & Salzer, G. (2020). Wallet Contracts on Ethereum. In International Conference on Blockchain and Cryptocurrency (pp. 1–2). IEEE. http://hdl.handle.net/20.500.12708/58164
• Characterizing Types of Smart Contracts in the Ethereum Landscape / di Angelo, M., & Salzer, G. (2020). Characterizing Types of Smart Contracts in the Ethereum Landscape. In Financial Cryptography and Data Security (pp. 389–404). Springer. https://doi.org/10.1007/978-3-030-54455-3_28
• Tokens, Types, and Standards: Identification and Utilization in Ethereum / di Angelo, M., & Salzer, G. (2020). Tokens, Types, and Standards: Identification and Utilization in Ethereum. In 2020 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS). International Conference on Decentralized Applications and Infrastructures (IEEE DAPPS 2020), Oxford, United Kingdom of Great Britain and Northern Ireland (the). IEEE. https://doi.org/10.1109/dapps49028.2020.00001
• Functional Differences of Neo and Ethereum as Smart Contract Platforms / Bareis, M., di Angelo, M., & Salzer, G. (2020). Functional Differences of Neo and Ethereum as Smart Contract Platforms. In J. Prieto (Ed.), Advances in Intelligent Systems and Computing (pp. 13–23). Springer. https://doi.org/10.1007/978-3-030-52535-4_2
• SoK: Development of Secure Smart Contracts – Lessons from a Graduate Course / di Angelo, M., Sack, C., & Salzer, G. (2020). SoK: Development of Secure Smart Contracts – Lessons from a Graduate Course. In Financial Cryptography and Data Security (pp. 91–105). Springer. https://doi.org/10.1007/978-3-030-43725-1_8
• Characteristics of Wallet Contracts on Ethereum / di Angelo, M., & Salzer, G. (2020). Characteristics of Wallet Contracts on Ethereum. In 2020 2nd Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS). 2nd Conference on Blockchain Research & Applications for Innovative Networks and Services, Paris, France. IEEE. https://doi.org/10.1109/brains49436.2020.9223287

2019

• Performance and Scalability of Private Ethereum Blockchains / Schäffer, M., di Angelo, M., & Salzer, G. (2019). Performance and Scalability of Private Ethereum Blockchains. In Business Process Management: Blockchain and Central and Eastern Europe Forum (pp. 103–118). Springer. https://doi.org/10.1007/978-3-030-30429-4_8
• Smart contracts in view of the civil code / di Angelo, M., Soare, A., & Salzer, G. (2019). Smart contracts in view of the civil code. In Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing. SAC ’19: The 34th ACM/SIGAPP Symposium on Applied Computing, Limassol, Cyprus. ACM. https://doi.org/10.1145/3297280.3297321
• Mayflies, Breeders, and Busy Bees in Ethereum / di Angelo, M., & Salzer, G. (2019). Mayflies, Breeders, and Busy Bees in Ethereum. In Proceedings of the Third ACM Workshop on Blockchains, Cryptocurrencies and Contracts  - BCC ’19. BCC 2019 : The Third ACM Workshop on Blockchains, Cryptocurrencies and Contracts, Auckland, New Zealand. ACM. https://doi.org/10.1145/3327959.3329537
• A Survey of Tools for Analyzing Ethereum Smart Contracts / di Angelo, M., & Salzer, G. (2019). A Survey of Tools for Analyzing Ethereum Smart Contracts. In 2019 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPCON). IEEE International Conference on Decentralized Applications and Infrastructures, San Francisco, United States of America (the). IEEE. https://doi.org/10.1109/dappcon.2019.00018
• Collateral Use of Deployment Code for Smart Contracts in Ethereum / di Angelo, M., & Salzer, G. (2019). Collateral Use of Deployment Code for Smart Contracts in Ethereum. In 2019 10th IFIP International Conference on New Technologies, Mobility and Security (NTMS). 2019 10th IFIP International Conference on New Technologies, Mobility and Security (NTMS), Gran Canaria, Spain. IEEE. https://doi.org/10.1109/ntms.2019.8763828
• Minimal Distance of Propositional Models / Behrisch, M., Hermann, M., Mengel, S., & Salzer, G. (2019). Minimal Distance of Propositional Models. Theory of Computing Systems, 63(6), 1131–1184. https://doi.org/10.1007/s00224-018-9896-8

2018

• Minimal Distance of Propositional Models / Behrisch, M., Hermann, M., Mengel, S., & Salzer, G. (2018). Minimal Distance of Propositional Models. Theory of Computing Systems. https://doi.org/10.1007/s00224-018-9896-8
  Download: PDF (1.72 MB)

2016

• As Close as It Gets / Salzer, G., Behrisch, M., & Hermann, M. (2016). As Close as It Gets. In M. Kaykobad (Ed.), {WALCOM:} Algorithms and Computation - 10th International Workshop, {WALCOM} 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings (pp. 222–235). http://hdl.handle.net/20.500.12708/56476
• The Next Whisky Bar / Salzer, G., & Hermann, M. (2016). The Next Whisky Bar. In Computer Science – Theory and Applications (pp. 41–56). Springer. https://doi.org/10.1007/978-3-319-34171-2_4

2015

• Why Computer Science Can't Get Enough of Clones / Salzer, G. (2015). Why Computer Science Can’t Get Enough of Clones. AAA89, Dresden, Germany. http://hdl.handle.net/20.500.12708/86034
• Minimal Distance of Propositional Models / Salzer, G., Behrisch, M., & Hermann, M. (2015). Minimal Distance of Propositional Models. arXiv. https://doi.org/10.48550/arXiv.1502.06761
• Give Me Another One! / Behrisch, M., & Salzer, G. (2015). Give Me Another One! In I. Elbassioni (Ed.), Algorithms and Computation (pp. 664–676). Springer LNCS. https://doi.org/10.1007/978-3-662-48971-0_56

2014

• Numeric semantics of class diagrams with multiplicity and uniqueness constraints / Feinerer, I., & Salzer, G. (2014). Numeric semantics of class diagrams with multiplicity and uniqueness constraints. Software and Systems Modeling, 13(3), 1167–1187. https://doi.org/10.1007/s10270-012-0294-4

2013

• Class Diagrams with Equated Association Chains / Feinerer, I., Salzer, G., & Sisel, T. (2013). Class Diagrams with Equated Association Chains. In 2013 International Symposium on Theoretical Aspects of Software Engineering. 7th International Symposium on Theoretical Aspects of Software Engineering, Birmingham, EU. https://doi.org/10.1109/tase.2013.35

2012

• Configuration Repair via Flow Networks / Salzer, G., Feinerer, I., & Sisel, T. (2012). Configuration Repair via Flow Networks. In C. Li & A. Felfernig (Eds.), Foundations of Intelligent Systems 20th International Symposium, ISMIS 2012, Macau, China, December 4-7, 2012, Proceedings (pp. 321–330). https://doi.org/10.1007/978-3-642-34624-8_37

2011

• Reducing Multiplicities in Class Diagrams / Feinerer, I., Salzer, G., & Sisel, T. (2011). Reducing Multiplicities in Class Diagrams. In Model Driven Engineering Languages and Systems (pp. 379–393). https://doi.org/10.1007/978-3-642-24485-8_27

2010

• The Helly Property and Satisfiability of Boolean Formulas Defined on Set Families / Chepoi, V., Creignou, N., Hermann, M., & Salzer, G. (2010). The Helly Property and Satisfiability of Boolean Formulas Defined on Set Families. European Journal of Combinatorics, 31(2), 502–516. https://doi.org/10.1016/j.ejc.2009.03.022
• Computing Product Configurations via UML and Integer Linear Programming / Falkner, A., Feinerer, I., Salzer, G., & Schenner, G. (2010). Computing Product Configurations via UML and Integer Linear Programming. International Journal of Mass Customisation, 3(4), 351. https://doi.org/10.1504/ijmassc.2010.037650

2009

• A Comparison of Tools for Teaching Formal Software Verification / Feinerer, I., & Salzer, G. (2009). A Comparison of Tools for Teaching Formal Software Verification. Formal Aspects of Computing, 21(3), 293–301. https://doi.org/10.1007/s00165-008-0084-5
• Description Problems over Finite Totally-Ordered Domains / Salzer, G. (2009). Description Problems over Finite Totally-Ordered Domains. Moscow-Vienna Workshop on Logic and Computation 2009, Wien, Austria. http://hdl.handle.net/20.500.12708/84952
• Constraint Satisfaction Problems & Many-Valued Logics / Salzer, G. (2009). Constraint Satisfaction Problems & Many-Valued Logics. Collegium Logicum 2009 (CL2009), Wien, Austria. http://hdl.handle.net/20.500.12708/84951
• Algebraic foundation of a data model for an extensible space-based collaboration protocol / Craß, S., Kühn, E., & Salzer, G. (2009). Algebraic foundation of a data model for an extensible space-based collaboration protocol. In B. C. Desai, D. Saccà, & S. Greco (Eds.), Proceedings of the 2009 International Database Engineering & Applications Symposium on - IDEAS ’09. ACM. https://doi.org/10.1145/1620432.1620466

2008

• Complexity of Clausal Constraints Over Chains / Creignou, N., Hermann, M., Krokhin, A., & Salzer, G. (2008). Complexity of Clausal Constraints Over Chains. Theory of Computing Systems, 42(2), 239–255. https://doi.org/10.1007/s00224-007-9003-z
• Efficient Algorithms for Description Problems over Finite Totally Ordered Domains / Gil, Á. J., Hermann, M., Salzer, G., & Zanuttini, B. (2008). Efficient Algorithms for Description Problems over Finite Totally Ordered Domains. SIAM Journal on Computing, 38(3), 922–945. https://doi.org/10.1137/050635900
• Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics / Salzer, G., Chepoi, V., Creignou, N., & Hermann, M. (2008). Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. In G. Dueck (Ed.), 38th International Symposium on Multiple Valued Logic (ismvl 2008). IEEE Computer Society. https://doi.org/10.1109/ismvl.2008.41
• Solving Practical Configuration Problems using UML / Falkner, A., Feinerer, I., Salzer, G., & Schenner, G. (2008). Solving Practical Configuration Problems using UML. In Proceedings of ECAI 2008 Workshop on Configuration Systems (p. 6). http://hdl.handle.net/20.500.12708/52363

2007

• Consistency and Minimality of UML Class Specifications with Multiplicities and Uniqueness Constraints / Salzer, G., & Feinerer, I. (2007). Consistency and Minimality of UML Class Specifications with Multiplicities and Uniqueness Constraints. In J. He & J. Sanders (Eds.), Proceedings 1st IEEE/IFIP International Symposium on Theoretical Aspects of Software Engineering (pp. 411–420). http://hdl.handle.net/20.500.12708/52120

2006

• Basic Rewriting via Logic Programming, with an Application to the Reachability Problem / Salzer, G., & Limet, S. (2006). Basic Rewriting via Logic Programming, with an Application to the Reachability Problem. Journal of Automata, Languages and Combinatorics, 11(1), 107–142. http://hdl.handle.net/20.500.12708/173469
• Tree Tuple Languages from the Logic Programming Point of View / Salzer, G., & Limet, S. (2006). Tree Tuple Languages from the Logic Programming Point of View. Journal of Automated Reasoning, 37(4), 323–349. http://hdl.handle.net/20.500.12708/173468
• Automated Tools for Teaching Formal Software Verification / Feinerer, I., & Salzer, G. (2006). Automated Tools for Teaching Formal Software Verification. In P. Boca (Ed.), Proceedings of Teaching Formal Methods 2006 (p. 5). BCS. http://hdl.handle.net/20.500.12708/51752

2005

• The τ model, fomalizing topic maps / Salzer, G., & Barta, R. (2005). The τ model, fomalizing topic maps. In Proceedings of the 2nd-Asia-Pacific conference on Conceptual modelling (pp. 37–42). Australian Computer Society. http://hdl.handle.net/20.500.12708/51781

2004

• Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains / Gil, A., Hermann, M., Salzer, G., & Zanuttini, B. (2004). Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains (D. Basin & M. Rusinowitch, Eds.). http://hdl.handle.net/20.500.12708/84666
• Proving Properties of Term Rewrite Systems via Logic Programs / Salzer, G., & Limet, S. (2004). Proving Properties of Term Rewrite Systems via Logic Programs (V. Oostrom van, Ed.). http://hdl.handle.net/20.500.12708/84651

2002

• Excursions of a computer scientist into the realm of logic / Salzer, G. (2002). Excursions of a computer scientist into the realm of logic. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84120

2025

• Reentrancy in Ethereum Smart Contracts : methods and tools for detection / Fürst, L. (2025). Reentrancy in Ethereum Smart Contracts : methods and tools for detection [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2025.110824
  Download: PDF (1.31 MB)

2024

• Analysis of front running vulnerabilities in solidity smart contracts / Zecirovic, H. (2024). Analysis of front running vulnerabilities in solidity smart contracts [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.117646
  Download: PDF (1.22 MB)
• Advancing symbolic execution tools with a transient storage model for vulnerability detection in smart contracts / Weyrich, J. (2024). Advancing symbolic execution tools with a transient storage model for vulnerability detection in smart contracts [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.117649
  Download: PDF (584 KB)
• Using state changes to detect and simulate transaction order dependency in ethereum / Lechner, O. (2024). Using state changes to detect and simulate transaction order dependency in ethereum [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.118942
  Download: PDF (859 KB)

2023

• Erkennung von Mustern in EVM-Bytecode durch XQuery-Abfragen auf Ausführungspfaden im Kontrollflussgraphen / Sack, C. (2023). Erkennung von Mustern in EVM-Bytecode durch XQuery-Abfragen auf Ausführungspfaden im Kontrollflussgraphen [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.98507
  Download: PDF (1.15 MB)
• Identifying semantic properties in the bytecode of smart contracts using symbolic execution / Loz, D. (2023). Identifying semantic properties in the bytecode of smart contracts using symbolic execution [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.111980
  Download: PDF (854 KB)

2022

• Identifying related smart contracts by their bytecode / Yücel, T. (2022). Identifying related smart contracts by their bytecode [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.96144
  Download: PDF (17.3 MB)

2021

• Systematic review of ethereum smart contract security vulnerabilities, analysis methods and tools / Rameder, H. (2021). Systematic review of ethereum smart contract security vulnerabilities, analysis methods and tools [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.86784
  Download: PDF (3.66 MB)
• Identifying administrators of smart contracts from transaction data / Gorgoris, P. (2021). Identifying administrators of smart contracts from transaction data [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.77989
  Download: PDF (1.25 MB)

2020

• Language properties for smart contracts / Rizvanović, A. (2020). Language properties for smart contracts [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.55148
  Download: PDF (1.01 MB)
• Privacy enhancing technologies for distributed ledgers / Wolf, M. (2020). Privacy enhancing technologies for distributed ledgers [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.74343
  Download: PDF (1.05 MB)
• Decompilation of EVM bytecode / Kurzmann, M. (2020). Decompilation of EVM bytecode [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.66186
  Download: PDF (1.26 MB)
• Smart contracts in a DAG ledger : Blockchain 5.0 / Hetzenecker, L. (2020). Smart contracts in a DAG ledger : Blockchain 5.0 [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2020.62445
  Download: PDF (2.82 MB)

2018

• Ein generisches Framework für entscheidungsunterstützende Systeme im medizinischen Bereich / Gepp, D. (2018). Ein generisches Framework für entscheidungsunterstützende Systeme im medizinischen Bereich [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.56238
  Download: PDF (1.04 MB)

2017

• Making Object-Z Perfect : Verifaktion von Object-Z Spezifikationen unter Verwendung von Perfect Developer / Swoboda, S. (2017). Making Object-Z Perfect : Verifaktion von Object-Z Spezifikationen unter Verwendung von Perfect Developer [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.50685
  Download: PDF (1.95 MB)
• Programmanalyse und Verifikation von SPS-Programmen / Kucera, G. (2017). Programmanalyse und Verifikation von SPS-Programmen [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.50347
  Download: PDF (3.12 MB)

2016

• Parallelizing the commutation property for functions over small domains / Scherer, M. (2016). Parallelizing the commutation property for functions over small domains [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.36321
  Download: PDF (708 KB)
• Formal ontology-based quantum security requirements engineering by Petri nets / Dissauer, G. (2016). Formal ontology-based quantum security requirements engineering by Petri nets [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2016.37110
  Download: PDF (1.66 MB)

2014

• Transformational approaches for conditional term rewrite systems / Gmeiner, K. (2014). Transformational approaches for conditional term rewrite systems [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.24420
  Download: PDF (832 KB)

2013

• Numeric methods for configuration management / Sisel, T. (2013). Numeric methods for configuration management [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2013.22242
  Download: PDF (1.8 MB)

2012

• Securing IPv6 by quantum key distribution for wide area networks / Dißauer, G. (2012). Securing IPv6 by quantum key distribution for wide area networks [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-57727
  Download: PDF (1.64 MB)

2011

• Methods and tools for the formal verification of software : an analysis and comparison / Rainer-Harbach, M. (2011). Methods and tools for the formal verification of software : an analysis and comparison [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-45918
  Download: PDF (865 KB)
• Ein grafischer Editor für objektorientierte, constraintbasierte Wissensbasen / Szolarz, C. (2011). Ein grafischer Editor für objektorientierte, constraintbasierte Wissensbasen [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160508

2010

• A formal model of the Extensible Virtual Shared Memory (XVSM) and its implementation in Haskell : design and specification / Craß, S. (2010). A formal model of the Extensible Virtual Shared Memory (XVSM) and its implementation in Haskell : design and specification [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-30890
  Download: PDF (1.62 MB)
• A numeric semantics for UML class diagrams : semantics and tools / Niederbrucker, G. (2010). A numeric semantics for UML class diagrams : semantics and tools [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/160860

2006

• Verdeckte Kommunikation : ein Problembereich des Securitymanagements / Schuster, M. (2006). Verdeckte Kommunikation : ein Problembereich des Securitymanagements [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/186889
• Log file processing by machine learning and information extraction / Robinson, P. (2006). Log file processing by machine learning and information extraction [Master Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/185580

2003

• Steganographische und kryptographische Grundlagen digitaler Wasserzeichen / Schuster, M. (2003). Steganographische und kryptographische Grundlagen digitaler Wasserzeichen [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183648

2002

• eContracting : foundations and applications / Ploninger, C. (2002). eContracting : foundations and applications [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/185220