Computational models of argumentation are approaches that deal with the representation and interaction of arguments and counterarguments. These models can be applied in all areas that benefit from automatic decision-support such as medicine, accounting, chemistry, and law. Many of these models were inspired by works within the fields of nonmonotonic reasoning and logic programming and therefore share the sometimes considerable computational complexity of these approaches. Algorithmic aspects of computational models of argumentation have recently gained attention within the community, in particular due to the International Competition on Computational Models of Argumentation (ICCMA), which ran for the first time in 2015. This volume collects papers from the First International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2016) which aims at complementing the competition by providing a forum to present and discuss both systems and algorithms dealing with all aspects of computational argumentation, in particular those approaches addressing the tracks of the competition. The workshop received six submissions which have all been accepted as regular papers for this volume. Additionally, this volume contains an extended abstract of the invited keynote speech “Advanced Systems for Abstract Argumentation - Trends and Challenges” by Stefan Woltran and a paper entitled “Introducing the Second International Competition on Computational Models of Argumentation” by Sarah Alice Gaggl, Thomas Linsbichler, Marco Maratea, and Stefan Woltran which presents the next argumentation competition that is scheduled for 2017.