The Year Before Last

Alagi, G., & Weidenbach, C. (2015a). NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment. In Frontiers of Combining Systems (FroCoS 2015). Wrocław, Poland: Springer. doi:10.1007/978-3-319-24246-0_5
Alagi, G., & Weidenbach, C. (2015b). NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment. Retrieved from http://arxiv.org/abs/1502.05501
(arXiv: 1502.05501)
Barkatou, M. A., Jaroschek, M., & Maddah, S. S. (2015). Formal Solutions of Completely Integrable Pfaffian Systems With Normal Crossings. Retrieved from http://arxiv.org/abs/1511.00180
(arXiv: 1511.00180)
Baumgartner, P., Bax, J., & Waldmann, U. (2015). Beagle -- A Hierarchic Superposition Theorem Prover. In Automated Deduction -- CADE-25. Berlin, Germany: Springer. doi:10.1007/978-3-319-21401-6_25
Blanchette, J. C., Popescu, A., & Traytel, D. (2015a). Foundational Extensible Corecursion: A Proof Assistant Perspective. In ACM SIGPLAN Notices (Proc. ICFP 2015) (Vol. 50). Vancouver, BC, Canada: ACM. doi:10.1145/2784731.2784732
Blanchette, J. C., Popescu, A., & Traytel, D. (2015b). Foundational Extensible Corecursion. Retrieved from http://arxiv.org/abs/1501.05425
(arXiv: 1501.05425)
Blanchette, J. C., & Kosmatov, N. (Eds.). (2015). Tests and Proofs. Presented at the 9th International Conference on Tests & Proofs, L’Aquila, Italy: Springer. doi:10.1007/978-3-319-21215-9
Blanchette, J. C., Haslbeck, M., Matichuk, D., & Nipkow, T. (2015). Mining the Archive of Formal Proofs. In Intelligent Computer Mathematics (CICM 2015). Washington, DC, USA: Springer. doi:10.1007/978-3-319-20615-8_1
Blanchette, J. C., Popescu, A., & Traytel, D. (2015c). Witnessing (Co)datatypes. In Programming Languages and Systems (ESOP 2015). London, UK: Springer. doi:10.1007/978-3-662-46669-8_15
Bromberger, M., Sturm, T., & Weidenbach, C. (2015a). Linear Integer Arithmetic Revisited. In Automated Deduction -- CADE-25. Berlin, Germany: Springer. doi:10.1007/978-3-319-21401-6_42
Bromberger, M., Sturm, T., & Weidenbach, C. (2015b). Linear Integer Arithmetic Revisited. Retrieved from http://arxiv.org/abs/1503.02948
(arXiv: 1503.02948)
Brown, C. W., & Košta, M. (2015). Constructing a Single Cell in Cylindrical Algebraic Decomposition. Journal of Symbolic Computation, 70. doi:10.1016/j.jsc.2014.09.024
Damm, W., Horbach, M., & Sofronie-Stokkermans, V. (2015a). Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata. In Frontiers of Combining Systems (FroCoS 2015). Wrocław, Poland: Springer. doi:10.1007/978-3-319-24246-0_12
Damm, W., Horbach, M., & Sofronie-Stokkermans, V. (2015b). Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata (No. ATR111). SFB/TR 14 AVACS.
Errami, H., Eiswirth, M., Grigoriev, D., Seiler, W. M., Sturm, T., & Weber, A. (2015). Detection of Hopf Bifurcations in Chemical Reaction Networks Using Convex Coordinates. Journal of Computational Physics, 291. doi:10.1016/j.jcp.2015.02.050
Fontaine, P., Sturm, T., & Waldmann, U. (2015). Foreword to the Special Focus on Constraints and Combinations. Mathematics in Computer Science, 9(3). doi:10.1007/s11786-015-0239-8
Hagemann, W. (2015). Symbolic Orthogonal Projections: A New Polyhedral Representation for Reachability Analysis of Hybrid Systems. Universität des Saarlandes, Saarbrücken.
Hoeltgen, L., Mainberger, M., Hoffmann, S., Weickert, J., Tang, C. H., Setzer, S., … Doerr, B. (2015). Optimising Spatial and Tonal Data for PDE-based Inpainting. Retrieved from http://arxiv.org/abs/1506.04566
(arXiv: 1506.04566)
Jaroschek, M., Dobal, P. F., & Fontaine, P. (2015). Adapting Real Quantifier Elimination Methods for Conflict Set Computation. In Frontiers of Combining Systems (FroCoS 2015). Wrocław, Poland: Springer. doi:10.1007/978-3-319-24246-0_10
Junk, C., Rößger, R., Rock, G., Theis, K., Weidenbach, C., & Wischnewski, P. (2015). Model-Based Variant Management with v.control. In Transdisciplinary Lifecycle Analysis of Systems (ISPE CE 2015). Delft, The Netherlands: IOS Press. doi:10.3233/978-1-61499-544-9-194
Kauers, M., Jaroschek, M., & Johannson, F. (2015). Ore Polynomials in Sage. In Computer Algebra and Polynomials. Berlin: Springer. doi:10.1007/978-3-319-15081-9_6
Klein, F., & Zimmerman, M. (2015). What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead. In 24th EACSL Annual Conference on Computer Science Logic. Berlin, Germany: Wadern. doi:10.4230/LIPIcs.CSL.2015.519
Klein, F., & Zimmermann, M. (2015). How Much Lookahead is Needed to Win Infinite Games? In Automata, Languages, and Programming (ICALP 2015). Kyoto, Japan: Springer. doi:10.1007/978-3-662-47666-6_36
Košta, M., & Sturm, T. (2015). A Generalized Framework for Virtual Substitution. Retrieved from http://arxiv.org/abs/1501.05826
(arXiv: 1501.05826)
Košta, M., Sturm, T., & Dolzmann, A. (2015). Better Answers to Real Questions. Retrieved from http://arxiv.org/abs/1501.05098
(arXiv: 1501.05098)
Lamotte-Schubert, M. (2015). Automatic Authorization Analysis. Universität des Saarlandes, Saarbrücken. Retrieved from urn:nbn:de:bsz:291-scidok-62575
Reynolds, A., & Blanchette, J. C. (2015). A Decision Procedure for (Co)datatypes in SMT Solvers. In Automated Deduction -- CADE-25. Berlin, Germany: Springer. doi:10.1007/978-3-319-21401-6_13
Schmidt, R. A., & Waldmann, U. (2015a). Modal Tableau Systems with Blocking and Congruence Closure (No. uk-ac-man-scw:268816). Manchester: University of Manchester.
Schmidt, R. A., & Waldmann, U. (2015b). Modal Tableau Systems with Blocking and Congruence Closure. In Automated Reasoning with Analytic Tableaux and Related Methods. Wrocław, Poland: Springer. doi:10.1007/978-3-319-24312-2_4
Sofronie-Stokkermans, V. (2015). Hierarchical Reasoning in Local Theory Extensions and Applications. In SYNASC 2014. Timisoara, Romania: IEEE Computer Society. doi:10.1109/SYNASC.2014.13
Sturm, T. (2015a). Subtropical Real Root Finding. Retrieved from http://arxiv.org/abs/1501.04836
(arXiv: 1501.04836)
Sturm, T. (2015b). Subtropical Real Root Finding. In ISSAC’15, 40th International Symposium on Symbolic and Algebraic Computation. Bath, UK: ACM. doi:10.1145/2755996.2756677
Suda, M. (2015a). Variable and Clause Elimination for LTL Satisfiability Checking. Mathematics in Computer Science, 9(3). doi:10.1007/s11786-015-0240-2
Suda, M. (2015b). Resolution-based Methods for Linear Temporal Reasoning. Universität des Saarlandes, Saarbrücken. Retrieved from urn:nbn:de:bsz:291-scidok-62747
Teucke, A., & Weidenbach, C. (2015a). First-order Logic Theorem Proving and Model Building via Approximation and Instantiation. In Frontiers of Combining Systems (FroCoS 2015). Wrocław, Poland: Springer. doi:10.1007/978-3-319-24246-0_6
Teucke, A., & Weidenbach, C. (2015b). First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation. Retrieved from http://arxiv.org/abs/1503.02971
(arXiv: 1503.02971)
Voigt, M., & Weidenbach, C. (2015). Bernays-Schönfinkel-Ramsey with Simple Bounds is NEXPTIME-complete. Retrieved from http://arxiv.org/abs/1501.07209
(arXiv: 1501.07209)
Weidenbach, C. (2015). Automated Reasoning Building Blocks. In Correct System Design. Oldenburg, Germany: Springer. doi:10.1007/978-3-319-23506-6_12