Stefan Ciobaca

Orcid: 0009-0000-4082-570X

According to our database1, Stefan Ciobaca authored at least 29 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Securing Verified IO Programs Against Unverified Code in F.
Proc. ACM Program. Lang., January, 2024

Implementing, Specifying, and Verifying the QOI Format in Dafny: A Case Study.
Proceedings of the Integrated Formal Methods - 19th International Conference, 2024

2023
Operationally-based program equivalence proofs using LCTRSs.
J. Log. Algebraic Methods Program., October, 2023

2021
An Extended Account of Trace-relating Compiler Correctness and Secure Compilation.
ACM Trans. Program. Lang. Syst., 2021

A Note on the Performance of Algorithms for Solving Linear Diophantine Equations in the Naturals.
CoRR, 2021

Verifying the Conversion into CNF in Dafny.
Proceedings of the Logic, Language, Information, and Computation, 2021

2020
Who Verifies the Verifiers? A Computer-Checked Implementation of the DPLL Algorithm in Dafny.
CoRR, 2020

A Typo in the Paterson-Wegman-de Champeaux algorithm.
CoRR, 2020

Trace-Relating Compiler Correctness and Secure Compilation.
Proceedings of the Programming Languages and Systems, 2020

2019
All-Path Reachability Logic.
Log. Methods Comput. Sci., 2019

Verifying the DPLL Algorithm in Dafny.
Proceedings of the Proceedings Third Symposium on Working Formal Methods, 2019

Trace-Relating Compiler Correctness and Secure Compilation.
CoRR, 2019

2018
Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics.
Proceedings of the Proceedings Fifth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2018

Unification Modulo Builtins.
Proceedings of the Logic, Language, Information, and Computation, 2018

A Coinductive Approach to Proving Reachability Properties in Logically Constrained Term Rewriting Systems.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017
A Comparison of Open-Source Static Analysis Tools for Vulnerability Detection in C/C++ Code.
Proceedings of the 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2017

2016
Automated Verification of Equivalence Properties of Cryptographic Protocols.
ACM Trans. Comput. Log., 2016

A language-independent proof system for full program equivalence.
Formal Aspects Comput., 2016

2014
A Theoretical Foundation for Programming Languages Aggregation.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2014

Reducing Partial Equivalence to Partial Correctness.
Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2014

A Language-Independent Proof System for Mutual Program Equivalence.
Proceedings of the Formal Methods and Software Engineering, 2014

2013
One-Path Reachability Logic.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

From Small-Step Semantics to Big-Step Semantics, Automatically.
Proceedings of the Integrated Formal Methods, 10th International Conference, 2013

2012
Computing Knowledge in Security Protocols Under Convergent Equational Theories.
J. Autom. Reason., 2012

Automated Verification of Equivalence Properties of Cryptographic Protocols.
Proceedings of the Programming Languages and Systems, 2012

2011
Verification and composition of security protocols with applications to electronic voting. (Vérification et composition des protocoles de securité avec des applications aux protocoles de vote electronique).
PhD thesis, 2011

Computing finite variants for subterm convergent rewrite systems.
Proceedings of the 25th International Workshop on Unification, 2011

2010
Protocol Composition for Arbitrary Primitives.
Proceedings of the 23rd IEEE Computer Security Foundations Symposium, 2010

2008
Compartmented Threshold RSA Based on the Chinese Remainder Theorem.
IACR Cryptol. ePrint Arch., 2008


  Loading...