Institution profile

Alexandru Ioan Cuza University

Academic institutioneurope · ro
Official website
Research library23linked papers
Opportunities0open roles
Selected work

Representative Papers

Verifying Graceful Degradation in a Distributed Malware-Detection System with SPIN

Sep 24, 2026Electronic Proceedings in Theoretical Computer Science

This study addresses the vulnerability of distributed malware detection systems to endpoint misclassification caused by server failures. To mitigate this, we construct a Promela model based on Bitdefender’s production architecture and formally verify its graceful degradation fallback chain mechanism using the SPIN model checker combined with Linear Temporal Logic (LTL). This work presents the first formal verification of the fault-handling layer within a production-grade security system, thereby bridging a significant research gap in the field. Experimental results demonstrate that the system is free from deadlocks and false positives while guaranteeing unique verdicts, ensuring that degradation behaviors remain orderly and controllable under failure conditions.

0 citationsRead paper

Formalizing the Omega Test in Dafny

Sep 24, 2026Electronic Proceedings in Theoretical Computer Science

This study addresses the challenge of formally verifying satisfiability decision algorithms for systems of inequalities by presenting a rigorous formal specification and verification of the Omega test using the Dafny programming language. The research defines executable representations and semantic models for rational numbers and linear constraints, integrating formal methods with theorem proving techniques to achieve fully automated verification of the algorithm's core logic. This work not only ensures the logical correctness and trustworthiness of the Omega test but also reveals novel insights into the algorithm through the rigorous formalization process. Ultimately, it establishes a reliable methodological foundation for constructing verifiable decision procedures in linear integer arithmetic.

0 citationsRead paper

The Formalization of two Computational Models in Dafny

Sep 24, 2026Electronic Proceedings in Theoretical Computer Science

This study addresses the longstanding absence of unified formal verification support for Turing machines and the lambda calculus, two foundational pillars of computation theory. Leveraging the Dafny programming language, this work presents the first unified formal modeling of both classical computational models and employs automated theorem proving techniques to resolve core theoretical problems. Specifically, the research successfully achieves termination proofs for Turing machines, mechanized verification of Church encoding, and a rigorous machine-checked proof of the Church-Rosser theorem. By bridging the gap between computational models and program verification, this work establishes a novel paradigm for the mechanized verification of classical computation theory.

0 citationsRead paper

Fewer Assumptions by Design: A Reusable Skill for LLM-Assisted Verus Verification

Sep 24, 2026Electronic Proceedings in Theoretical Computer Science

This study addresses the limitations of weak specifications and excessive reliance on unproven assumptions when using large language models (LLMs) to assist Verus in verifying doubly linked lists (DLLs). To overcome these challenges, this work proposes a specialized, reusable verification skill tailored for DLLs. The proposed method encodes domain knowledge and task decomposition strategies into structured prompts, guiding LLM agents to automatically generate strong formal specifications in Rust. Consequently, this approach significantly reduces the verification process's dependence on trusted computing bases such as axioms and lemmas. By successfully producing robust specifications for doubly linked lists with minimal trust assumptions, the project effectively enhances the rigor and reliability of LLM-assisted formal verification.

0 citationsRead paper
Recent publications

Latest Papers

Verifying Graceful Degradation in a Distributed Malware-Detection System with SPIN

Sep 24, 2026Electronic Proceedings in Theoretical Computer Science

This study addresses the vulnerability of distributed malware detection systems to endpoint misclassification caused by server failures. To mitigate this, we construct a Promela model based on Bitdefender’s production architecture and formally verify its graceful degradation fallback chain mechanism using the SPIN model checker combined with Linear Temporal Logic (LTL). This work presents the first formal verification of the fault-handling layer within a production-grade security system, thereby bridging a significant research gap in the field. Experimental results demonstrate that the system is free from deadlocks and false positives while guaranteeing unique verdicts, ensuring that degradation behaviors remain orderly and controllable under failure conditions.

0 citationsRead paper

Formalizing the Omega Test in Dafny

Sep 24, 2026Electronic Proceedings in Theoretical Computer Science

This study addresses the challenge of formally verifying satisfiability decision algorithms for systems of inequalities by presenting a rigorous formal specification and verification of the Omega test using the Dafny programming language. The research defines executable representations and semantic models for rational numbers and linear constraints, integrating formal methods with theorem proving techniques to achieve fully automated verification of the algorithm's core logic. This work not only ensures the logical correctness and trustworthiness of the Omega test but also reveals novel insights into the algorithm through the rigorous formalization process. Ultimately, it establishes a reliable methodological foundation for constructing verifiable decision procedures in linear integer arithmetic.

0 citationsRead paper

The Formalization of two Computational Models in Dafny

Sep 24, 2026Electronic Proceedings in Theoretical Computer Science

This study addresses the longstanding absence of unified formal verification support for Turing machines and the lambda calculus, two foundational pillars of computation theory. Leveraging the Dafny programming language, this work presents the first unified formal modeling of both classical computational models and employs automated theorem proving techniques to resolve core theoretical problems. Specifically, the research successfully achieves termination proofs for Turing machines, mechanized verification of Church encoding, and a rigorous machine-checked proof of the Church-Rosser theorem. By bridging the gap between computational models and program verification, this work establishes a novel paradigm for the mechanized verification of classical computation theory.

0 citationsRead paper

Fewer Assumptions by Design: A Reusable Skill for LLM-Assisted Verus Verification

Sep 24, 2026Electronic Proceedings in Theoretical Computer Science

This study addresses the limitations of weak specifications and excessive reliance on unproven assumptions when using large language models (LLMs) to assist Verus in verifying doubly linked lists (DLLs). To overcome these challenges, this work proposes a specialized, reusable verification skill tailored for DLLs. The proposed method encodes domain knowledge and task decomposition strategies into structured prompts, guiding LLM agents to automatically generate strong formal specifications in Rust. Consequently, this approach significantly reduces the verification process's dependence on trusted computing bases such as axioms and lemmas. By successfully producing robust specifications for doubly linked lists with minimal trust assumptions, the project effectively enhances the rigor and reliability of LLM-assisted formal verification.

0 citationsRead paper