Wolfgang Schreiner is an associate professor at the Research Institute for Symbolic Computation (RISC) of the Johannes Kepler University Linz in Austria. His research areas are formal methods; concurrency; and parallel, distributed, and grid computing.

Wolfgang Schreiner was born in 1967 in Austria. In 1994, he earned his PhD at the Johannes Kepler University Linz under the auspices of the federal president with a thesis on parallel functional programming for computer algebra. In 2001, he earned habilitation in practical computer science for his work on parallel software and algorithms for symbolic computation. From 2001 to 2004, he was the director of the degree program "Engineering for Computer-based Learning" at the Upper Austria University of Applied Sciences campus Hagenberg, where he still serves as a lecturer. Since 2004, he has been an associate professor at the RISC institute, where he served as vice-chair from 2004 to 2007.

During his career, Schreiner has participated in and directed various research projects funded by the Austrian Science Foundation, the Austrian Ministry for Science and Research, and the European Union. These projects include "Distributed Supercomputing in the Grid," "MathBroker I+II: Brokering Distributed Mathematical Services," and "HPGP: High-Performance Generic Programming." He has developed various software systems such as the para-functional language compiler pD, the parallel computer algebra software Distributed Maple, and the proving assistant RISC ProofNavigator.

Currently, Schreiner is participating in the doctoral program for computational mathematics at the Johannes Kepler University with a project on formally specified computer algebra software. He is also building the RISC ProgramExplorer, a software environment for program specification, exploration, and verification.

Learning Bayesian network parameters from small data sets Guo Z., Gao X., Ren H., Yang Y., Di R., Chen D. International Journal of Approximate Reasoning 91 22-35, 2017. Type: Article Bayesian networks (BNs) represent a powerful statistical tool for uncertainty analysis with applications in many areas, for example, medical diagnosis. Since data is often not sufficiently available to accurately learn the parameters of a BN by th...

Mar 12 2018

Software engineering: specification, implementation, verification Alagić S., Springer International Publishing, New York, NY, 2017. 178 pp. Type: Book (978-3-319615-17-2) Many introductions to software engineering focus on the high-level aspects of large-scale software development, for example, requirements analysis, architecture design, configuration management, quality control, software maintenance, documentation...

Feb 1 2018

Incremental bounded model checking for embedded software Schrammel P., Kroening D., Brain M., Martins R., Teige T., Bienmüller T. Formal Aspects of Computing 29(5): 911-931, 2017. Type: Article Bounded model checking is employed in tools for the formal verification of C programs such as the C bounded model checker (CBMC). The key idea of this technique is to unwind unbounded program loops to a fixed depth and to translate the resulting p...

Dec 4 2017

A general approximation method for bicriteria minimization problems Halffmann P., Ruzika S., Thielen C., Willems D. Theoretical Computer Science 695 1-15, 2017. Type: Article Many applications in operations research require the simultaneous optimization of multiple (typically mutually opposing) objective functions. Since the general problem is usually computationally intractable, bicriteria optimization restricts itsel...

Nov 9 2017

Uncertainty and reduction of variable precision multigranulation fuzzy rough sets based on three-way decisions Feng T., Fan H., Mi J. International Journal of Approximate Reasoning 85(C): 36-58, 2017. Type: Article To formalize decision making in information systems with incomplete data, object attributes may be represented as fuzzy sets. Rough sets abstract such systems by two sets that represent the lower and the upper approximation of which objects satisf...

Jul 27 2017

Proof checking and logic programming Miller D. Formal Aspects of Computing 29(3): 383-399, 2017. Type: Article A proof checker is a program that takes a claimed proof of a logic formula and decides whether this claim is true; in applications such as program verification and automated reasoning, it is thus not necessary to trust the (potentially big) prover...

Jun 27 2017

Model checking learning agent systems using Promela with embedded C code and abstraction Kirwan R., Miller A., Porr B. Formal Aspects of Computing 28(6): 1027-1056, 2016. Type: Article Model checking is a formal method that decides whether a system satisfies a property formulated in temporal logic. While model checking is typically applied to hardware/software systems, it may be used to analyze any system that reaches only finit...

Mar 29 2017

On multiaspect graphs Wehmuth K., Fleury É., Ziviani A. Theoretical Computer Science 651(C): 50-61, 2016. Type: Article Many application domains require generalizations of the classical definition of directed graphs, for example, systems whose structures evolve over time (time-varying networks); systems that can be represented as conjunctions of interdependent netw...

Mar 1 2017

Nondeterministic modal interfaces Bujtor F., Fendrich S., Lüttgen G., Vogler W. Theoretical Computer Science 642(C): 24-53, 2016. Type: Article Concurrent systems consist of multiple components; the design of such a system must: allow its specification to be composed from the component requirements; allow its implementation to be composed from the component capabilities; and support a pro...

Nov 17 2016

A high performance QDWH-SVD solver using hardware accelerators Sukkari D., Ltaief H., Keyes D. ACM Transactions on Mathematical Software 43(1): 1-25, 2016. Type: Article To make effective use of modern computer hardware, algorithms have to be carefully designed with concurrency in mind: in particular, they need to efficiently utilize the multiple cores provided by the computer’s general-purpose central proce...