Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Home Topics Titles Quotes Blog Featured Help
Search
 
Wolfgang Schreiner
Johannes Kepler University
Linz, Austria
 

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.

--

Read our Q&A with Wolfgang Schreiner here.


     

Decidability and independence of conjugacy problems in finitely presented monoids
Araújo J., Kinyon M., Konieczny J., Malheiro A.  Theoretical Computer Science 731(C): 88-98, 2018. Type: Article

In a group, two elements a and b are conjugate if there is some g with gag-1 = b. Conjugacy is an equivalence relation and can be used to par...

 

Automatic synthesis of logical models for order-sorted first-order theories
Lucas S., Gutiérrez R.  Journal of Automated Reasoning 60(4): 465-501, 2018. Type: Article

Many problems in formal program analysis and verification can be reduced to determining whether a logical theory (a set of logic formulas) derived from the program has a model, that is, whether there exists a structure that provides definitions fo...

 

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...

 

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...

 

 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...

 
  more...

 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2018 ThinkLoud, Inc.
Terms of Use
| Privacy Policy