- Sebastian Junges, Dennis Guck, Joost-Pieter Katoen, Arend Rensink, Mariëlle Stoelinga. Fault trees on a diet: automated reduction by graph rewriting. Formal Asp. Comput., 29(4):651-703, 2017.
- Dale Miller. Proof checking and logic programming. Formal Asp. Comput., 29(3):383-399, 2017.
- Vincent Nys, Danny De Schreye. Abstract conjunctive partial deduction for the analysis and compilation of coroutines. Formal Asp. Comput., 29(1):125-153, 2017.
- Wlodzimierz Drabent. Proving completeness of logic programs with the cut. Formal Asp. Comput., 29(1):155-172, 2017.
- Sergio Antoy, Michael Hanus. Transforming Boolean equalities into constraints. Formal Asp. Comput., 29(3):475-494, 2017.
- Hassan Hatefi, Ralf Wimmer, Bettina Braitling, Luis María Ferrer Fioriti, Bernd Becker 0001, Holger Hermanns. Cost vs. time in stochastic games and Markov automata. Formal Asp. Comput., 29(4):629-649, 2017.
- Henning Christiansen, Maja H. Kirkeby. On proving confluence modulo equivalence for Constraint Handling Rules. Formal Asp. Comput., 29(1):57-95, 2017.
- Hirohisa Seki. On dual programs in co-logic programming and the Horn μ -calculus. Formal Asp. Comput., 29(3):401-421, 2017.
- Dines Bjørner. Manifest domains: analysis and description. Formal Asp. Comput., 29(2):175-225, 2017.
- Xuandong Li, Zhiming Liu 0001. Editorial. Formal Asp. Comput., 29(4):581-582, 2017.