SearcharxivSearch

arXiv · 2607.26110

A literature review of recent advances in software design and architecture

Abstract

Software architecture has evolved considerably in response to the increasing complexity of modern software systems, particularly those based on cloud computing, microservices, artificial intelligence (AI), and distributed computing environments. This literature review synthesizes recent studies published between 2024 and 2025 to examine emerging trends, challenges, and future directions in software design and architecture. The review adopts a thematic synthesis approach to analyse contemporary research across five major areas: architectural modelling and representation, software quality attributes and self-adaptive architectures, architectural evolution and complexity management, artificial intelligence-assisted architectural decision-making, and existing research gaps. The findings indicate that modern software architecture extends beyond traditional structural design to support continuous architectural governance, stakeholder communication, runtime observability, resilience, and intelligent decision support throughout the software lifecycle. Furthermore, the reviewed studies demonstrate that multiple architectural views, continuous monitoring, domain-driven decomposition, and AI-assisted design techniques contribute significantly to improving scalability, maintainability, adaptability, and long-term software sustainability. Despite these advances, several research gaps remain, including limited empirical validation of proposed approaches, insufficient integration of security and privacy into architectural decision-making, inadequate exploration of emerging paradigms such as edge and serverless computing, and the absence of standardized frameworks for trustworthy AI-assisted architecture.

Explore related subjects

Keep this discovery

BibTeXRIS

Malach Obisa Amonga. 2026-07-28. A literature review of recent advances in software design and architecture. https://arxiv.org/abs/2607.26110

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC