Timo Lang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Timo Lang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Agata Ciabattoni
TU Wien
2 shared publications - David Pym
University College London
2 shared publications - Didier Galmiche
Université de Lorraine CNRS LORIA F-54000 Nancy France
2 shared publications - Revantha Ramanayake
University of Groningen
2 shared publications - Alexandra Pavlova
TU Wien Austria
1 shared publication - Ananth Shrinivas Srinath
Huawei Technologies Co., Ltd, Ireland, Dublin, Ireland
1 shared publication
Latest Publications
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2223-2238
Lessons Learned from Incorporating Formal Methods in Huawei Cloud Reliability
Formal methods are increasingly adopted in systems where reliability and correctness are critical, enabled by improvements in tool usability, speed, and automation. This industrial experience report presents three projects at Huawei Cloud showcasing different trade-offs in investment and assurance levels. We applied probabilistic concurrency testing, model checking, and deductive verification to two foundational services in the database and networking domains: the K2 transactional key-value store and the Global Server Load Balancer (GSLB). Our work discovered bugs across different system layers—from design to implementation—which led to enhanced reliability, protocol simplifications, improved understanding, and generally higher developer confidence. To support practical adoption, we provide empirical and anecdotal data—including person-month effort metrics, tool comparisons, and success patterns—enabling engineering teams to make informed decisions about which approaches to invest in, when to apply lightweight versus heavyweight techniques, and how to budget for formal methods adoption in their organisation.
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2223-2238
Open AccessLessons Learned from Incorporating Formal Methods in Huawei Cloud Reliability
Formal methods are increasingly adopted in systems where reliability and correctness are critical, enabled by improvements in tool usability, speed, and automation. This industrial experience report presents three projects at Huawei Cloud showcasing different trade-offs in investment and assurance levels. We applied probabilistic concurrency testing, model checking, and deductive verification to two foundational services in the database and networking domains: the K2 transactional key-value store and the Global Server Load Balancer (GSLB). Our work discovered bugs across different system layers—from design to implementation—which led to enhanced reliability, protocol simplifications, improved understanding, and generally higher developer confidence. To support practical adoption, we provide empirical and anecdotal data—including person-month effort metrics, tool comparisons, and success patterns—enabling engineering teams to make informed decisions about which approaches to invest in, when to apply lightweight versus heavyweight techniques, and how to budget for formal methods adoption in their organisation.
- Open Access
- 27 November 2025
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 437, 365-378
Bifurcation Logic: Separation Through Ordering
We introduce Bifurcation Logic, BL, which combines a basic classical modality with separating conjunction, * , together with its naturally associated multiplicative implication,-* , that is defined using the modal ordering. Specifically, a formula φ 1 * φ 2 is true at a world w if and only if each φ i holds at worlds w i that are each above w, on separate branches of the order, and have no common upper bound. We provide a labelled tableaux calculus for BL and establish soundness and completeness relative to its relational semantics. The standard finite model property fails for BL. However, we show that, in the absence of-* , but in the presence of * , every model has an equivalent finite representation and that this is sufficient to obtain decidability. We illustrate the use of BL through an example of modelling multi-agent access control that is quite generic in its form, suggesting many applications.
- 27 November 2025
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 437, 365-378
Open AccessBifurcation Logic: Separation Through Ordering
We introduce Bifurcation Logic, BL, which combines a basic classical modality with separating conjunction, * , together with its naturally associated multiplicative implication,-* , that is defined using the modal ordering. Specifically, a formula φ 1 * φ 2 is true at a world w if and only if each φ i holds at worlds w i that are each above w, on separate branches of the order, and have no common upper bound. We provide a labelled tableaux calculus for BL and establish soundness and completeness relative to its relational semantics. The standard finite model property fails for BL. However, we show that, in the absence of-* , but in the presence of * , every model has an equivalent finite representation and that this is sufficient to obtain decidability. We illustrate the use of BL through an example of modelling multi-agent access control that is quite generic in its form, suggesting many applications.
- Open Access
- 25 September 2025
- Published by Springer Nature
- p. 220-237
Analytic Proofs for Tense Logic
The first algorithm to transform a proof in Nishimura’s sequent calculus $$\textbf{GKt}$$ for tense logic $$\textbf{Kt}$$ into an analytic proof of the same sequent is presented. In an analytic proof, every rule instance is analytic i.e., each formula in every premise is a subformula of some formula in its conclusion. We call this algorithm analytic restriction to convey that it extends analytic cut-restriction where just the cut-rule instances are made analytic. This distinction is essential in tense logic since cut and modal rules can both cause non-analyticity. Analytic cut-restriction is itself an extension of cut-elimination so our work contributes to a broader program of transforming arbitrary sequent proofs into ones constructed from a designated set of formulas—not necessarily subformulas. As with cut-elimination, the aim is to limit the proof search space and support proof-theoretic and meta-logical investigations.- 25 September 2025
- Published by Springer Nature
- p. 220-237
Open AccessAnalytic Proofs for Tense Logic
The first algorithm to transform a proof in Nishimura’s sequent calculus $$\textbf{GKt}$$ for tense logic $$\textbf{Kt}$$ into an analytic proof of the same sequent is presented. In an analytic proof, every rule instance is analytic i.e., each formula in every premise is a subformula of some formula in its conclusion. We call this algorithm analytic restriction to convey that it extends analytic cut-restriction where just the cut-rule instances are made analytic. This distinction is essential in tense logic since cut and modal rules can both cause non-analyticity. Analytic cut-restriction is itself an extension of cut-elimination so our work contributes to a broader program of transforming arbitrary sequent proofs into ones constructed from a designated set of formulas—not necessarily subformulas. As with cut-elimination, the aim is to limit the proof search space and support proof-theoretic and meta-logical investigations. - 29 April 2025
- Published by Springer Nature
- p. 48-71
Minimalistic System Modelling: Behaviours, Interfaces, and Local Reasoning
- 29 April 2025
- Published by Springer Nature
- p. 48-71
Minimalistic System Modelling: Behaviours, Interfaces, and Local Reasoning
- Open Access
- 14 September 2023
- Published by Springer Nature
- p. 94-111
Some Analytic Systems of Rules
We define two simple systems of rules, i.e. calculi with a global condition on the order of rule instances in a proof, for the modal logics of shift-reflexive and Euclidean frames respectively. Cut-elimination, and therefore the subformula property, can be derived directly from the cut-elimination property of adjacent logics. We compare our system to the calculus of grafted hypersequents, which has previously been used to capture both logics.We then discuss an attempt to obtain similar ‘modular’ cut-elimination proofs in other systems of rules. This general attempt is carried out for two more logics, namely the modal logic of serial frames and the intermediate logic axiomatised by the law of the weak excluded middle.
- 14 September 2023
- Published by Springer Nature
- p. 94-111
Open AccessSome Analytic Systems of Rules
We define two simple systems of rules, i.e. calculi with a global condition on the order of rule instances in a proof, for the modal logics of shift-reflexive and Euclidean frames respectively. Cut-elimination, and therefore the subformula property, can be derived directly from the cut-elimination property of adjacent logics. We compare our system to the calculus of grafted hypersequents, which has previously been used to capture both logics.We then discuss an attempt to obtain similar ‘modular’ cut-elimination proofs in other systems of rules. This general attempt is carried out for two more logics, namely the modal logic of serial frames and the intermediate logic axiomatised by the law of the weak excluded middle.
- Open Access
Cut-restriction: from cuts to analytic cuts
Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important meta-theoretical investigations including decidability, complexity, disjunction property, and interpolation. Unfortunately cut-elimination does not hold for the sequent calculi of most non-classical logics. It is well-known that the key to applications is the subformula property (a typical consequence of cut-elimination) rather than cut-elimination itself. With this in mind we introduce cut-restriction, a procedure to restrict arbitrary cuts to analytic cuts (when elimination is not possible). The algorithm applies to all sequent calculi satisfying language-independent and simple-to-check conditions, and it is obtained by adapting age-old cut-elimination. Our work encompasses existing results in a uniform way, and establishes novel analytic subformula properties.
Open AccessCut-restriction: from cuts to analytic cuts
Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important meta-theoretical investigations including decidability, complexity, disjunction property, and interpolation. Unfortunately cut-elimination does not hold for the sequent calculi of most non-classical logics. It is well-known that the key to applications is the subformula property (a typical consequence of cut-elimination) rather than cut-elimination itself. With this in mind we introduce cut-restriction, a procedure to restrict arbitrary cuts to analytic cuts (when elimination is not possible). The algorithm applies to all sequent calculi satisfying language-independent and simple-to-check conditions, and it is obtained by adapting age-old cut-elimination. Our work encompasses existing results in a uniform way, and establishes novel analytic subformula properties.
- Open Access
- 25 October 2021
- Published by Springer Nature in Studia Logica
- Vol. 110 (2) , 429-456
From Semantic Games to Provability: The Case of Gödel Logic
We present a semantic game for Gödel logic and its extensions, where the players’ interaction stepwise reduces arbitrary claims about the relative order of truth degrees of complex formulas to atomic ones. The paper builds on a previously developed game for Gödel logic with projection operator in Fermülleret al. (in: M.-J. Lesot, S. Vieira, M.Z. Reformat, J.P. Carvalho, A. Wilbik, B. Bouchon-Meunier, and R.R. Yager, (eds.),Information processing and management of uncertainty in knowledge-based systems, Springer, Cham, 2020, pp. 257–270). This game is extended to cover Gödel logic with involutive negations and constants, and then lifted to a provability game using the concept of disjunctive strategies. Winning strategies in the provability game, with and without constants and involutive negations, turn out to correspond to analytic proofs in a version of $$\text{ SeqGZL } $$ (A. Ciabattoni, and T. Vetterlein,Fuzzy Sets and Systems161(14):1941–1958, 2010) and in a sequent-of-relations calculus (M. Baaz, and Ch.G. Fermüller, in: N.V. Murray, (ed.),Automated reasoning with analytic tableaux and related methods, Springer, Berlin, 1999, pp. 36–51) respectively.- 25 October 2021
- Published by Springer Nature in Studia Logica
- Vol. 110 (2) , 429-456
Open AccessFrom Semantic Games to Provability: The Case of Gödel Logic
We present a semantic game for Gödel logic and its extensions, where the players’ interaction stepwise reduces arbitrary claims about the relative order of truth degrees of complex formulas to atomic ones. The paper builds on a previously developed game for Gödel logic with projection operator in Fermülleret al. (in: M.-J. Lesot, S. Vieira, M.Z. Reformat, J.P. Carvalho, A. Wilbik, B. Bouchon-Meunier, and R.R. Yager, (eds.),Information processing and management of uncertainty in knowledge-based systems, Springer, Cham, 2020, pp. 257–270). This game is extended to cover Gödel logic with involutive negations and constants, and then lifted to a provability game using the concept of disjunctive strategies. Winning strategies in the provability game, with and without constants and involutive negations, turn out to correspond to analytic proofs in a version of $$\text{ SeqGZL } $$ (A. Ciabattoni, and T. Vetterlein,Fuzzy Sets and Systems161(14):1941–1958, 2010) and in a sequent-of-relations calculus (M. Baaz, and Ch.G. Fermüller, in: N.V. Murray, (ed.),Automated reasoning with analytic tableaux and related methods, Springer, Berlin, 1999, pp. 36–51) respectively.