Mihai Herda

Orcid: 0000-0002-0142-1718

According to our database1, Mihai Herda authored at least 15 papers between 2014 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Integration of Static and Dynamic Analysis Techniques for Checking Noninterference.
Proceedings of the Deductive Software Verification: Future Perspectives, 2020

Combining Static and Dynamic Program Analysis Techniques for Checking Relational Properties.
PhD thesis, 2020

2019
Understanding Counterexamples for Relational Properties with DIbugger.
Proceedings of the Sixth Workshop on Horn Clauses for Verification and Synthesis and Third Workshop on Program Equivalence and Relational Reasoning, 2019

Using Relational Verification for Program Slicing.
Proceedings of the Software Engineering and Formal Methods - 17th International Conference, 2019

Verification-based test case generation for information-flow properties.
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019

2018
Using Dependence Graphs to Assist Verification and Testing of Information-Flow Properties.
Proceedings of the Tests and Proofs - 12th International Conference, 2018

A Uniform Information-Flow Security Benchmark Suite for Source Code and Bytecode.
Proceedings of the Secure IT Systems - 23rd Nordic Conference, NordSec 2018, Oslo, Norway, 2018

Towards a Notion of Coverage for Incomplete Program-Correctness Proofs.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Verification, 2018

Using Theorem Provers to Increase the Precision of Dependence Analysis for Information Flow Control.
Proceedings of the Formal Methods and Software Engineering, 2018

2017
SemSlice: Exploiting Relational Verification for Automatic Program Slicing.
Proceedings of the Integrated Formal Methods - 13th International Conference, 2017

2016
Proof-based Test Case Generation.
Proceedings of the Deductive Software Verification - The KeY Book, 2016

Computing Specification-Sensitive Abstractions for Program Verification.
Proceedings of the Dependable Software Engineering: Theories, Tools, and Applications, 2016

2015
First-Order Transitive Closure Axiomatization via Iterative Invariant Injections.
Proceedings of the NASA Formal Methods - 7th International Symposium, 2015

2014
Reducing the Complexity of Quantified Formulas via Variable Elimination.
CoRR, 2014

The KeY Platform for Verification and Analysis of Java Programs.
Proceedings of the Verified Software: Theories, Tools and Experiments, 2014


  Loading...