Matthias Daum
Researcher
Contact Details
| Phone: | +61 (02) 9376 2339 |
|---|---|
| Email: | Matthias.Daum@nicta.com.au |
More contact information is available at the SSRG Contact page.
Research Interests
Matthias' research interest is in Formal Methods, more specifically in interactive theorem proving, software verification, and concurrency.
Projects
Current |
Matthias works in the formal verification team of NICTA's Software Systems Research Group (SSRG). He is currently involved in the Trustworthy Systems project.
Career Summary
Prior to joining NICTA, Matthias has worked for more than 6 years in the Verisoft and Verisoft XT projects at the Saarland University.
Qualifications
Matthias holds a PhD in Computer Science from Saarland University.
Affiliations
Matthias is a Conjoint Lecturer at the School of Computer Science and Engineering of the University of New South Wales.
Publications
NICTA Papers
2012
Non-NICTA Papers
2010
|
 |
Matthias Daum On the formal foundation of a verification approach for system-level concurrent programs PhD Thesis, Saarland University, Saarbrüucken, 2010 You can find the corresponding theory files in release vlibvamos-trunk-r31570.tar.gz (5.2M) of the Verisoft Repository. |
|
|
|
Matthias Daum, Norbert W. Schirmer and Mareike Schmidt From operating-system correctness to pervasively verified applications International Conference on Integrated Formal Methods, pp. 105–120, Nancy, France, 2010 The original publication is available at www.springerlink.com. |
2009
|
|
|
Matthias Daum, Jan Dörrenbächer and Burkhart Wolff Proving fairness and implementation correctness of a microkernel scheduler Journal of Automated Reasoning: Special Issue on Operating System Verification, Volume 42, Number 2–4, pp. 349–388, 2009 The original publication is available at www.springerlink.com. |
|
|
|
Matthias Daum, Norbert W. Schirmer and Mareike Schmidt Implementation correctness of a real-time operating system IEEE International Conference on Software Engineering and Formal Methods, pp. 23–32, Hanoi, Vietnam, 2009 The original publication is available at www.computer.org. |