Follow
Mihai Herda
Title
Cited by
Cited by
Year
The KeY platform for verification and analysis of Java programs
W Ahrendt, B Beckert, D Bruns, R Bubel, C Gladisch, S Grebing, R Hähnle, ...
Working Conference on Verified Software: Theories, Tools, and Experiments, 55-71, 2014
782014
Formal Specification and Verification of Hyperledger Fabric Chaincode
B Beckert, M Herda, M Kirsten, J Schiffl
The 3rd Symposium on Distributed Ledger Technology, 2018
202018
First-order transitive closure axiomatization via iterative invariant injections
AA El Ghazi, M Taghdiri, M Herda
NASA Formal Methods Symposium, 143-157, 2015
142015
Proof-based Test Case Generation
W Ahrendt, C Gladisch, M Herda
Deductive Software Verification–The KeY Book, 415-451, 2016
82016
Generating Bounded Counterexamples for KeY Proof Obligations
M Herda
Karlsruhe Institute of Technology, 2014
72014
A uniform information-flow security benchmark suite for source code and bytecode
T Hamann, M Herda, H Mantel, M Mohr, D Schneider, M Tasch
Nordic Conference on Secure IT Systems, 437-453, 2018
62018
SemSlice: Exploiting Relational Verification for Automatic Program Slicing
B Beckert, T Bormer, S Gocht, M Herda, D Lentzsch, M Ulbrich
International Conference on Integrated Formal Methods, 312-319, 2017
62017
Towards a Notion of Coverage for Incomplete Program-correctness Proofs
B Beckert, M Herda, S Kobischke, M Ulbrich
International Symposium on Leveraging Applications of Formal Methods, 53-63, 2018
42018
Using Dependence Graphs to Assist Verification and Testing of Information-flow Properties
M Herda, S Tyszberowicz, B Beckert
International Conference on Tests and Proofs, 83-102, 2018
42018
RIFL 1.1: A Common Specification Language for Information-flow Requirements
T Bauereiß, S Greiner, M Herda, M Kirsten, X Li, H Mantel, M Mohr, ...
Technical report TUD-CS-2017-0225, TU Darmstadt, 2017
42017
CoCoME with Security
S Greiner, M Herda
42017
Poster: Security in E-voting
D Bruns, HQ Do, S Greiner, M Herda, M Mohr, E Scapin, T Truderung, ...
36th IEEE Symposium on Security and Privacy, Poster Session 18, 15, 2015
42015
Reducing the Complexity of Quantified Formulas via Variable Elimination
AAE Ghazi, M Ulbrich, M Taghdiri, M Herda
arXiv preprint arXiv:1408.0700, 2014
42014
Using relational verification for program slicing
B Beckert, T Bormer, S Gocht, M Herda, D Lentzsch, M Ulbrich
International Conference on Software Engineering and Formal Methods, 353-372, 2019
32019
Verification-based Test Case Generation for Information-flow Properties
M Herda, S Tyszberowicz, J Müssig, B Beckert
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2231-2238, 2019
32019
Computing specification-sensitive abstractions for program verification
T Liu, S Tyszberowicz, M Herda, B Beckert, D Grahl, M Taghdiri
International Symposium on Dependable Software Engineering: Theories, Tools …, 2016
32016
Understanding counterexamples for relational properties with dibugger
M Herda, M Kirsten, E Brunner, J Plewnia, U Scheler, C Staudenmaier, ...
arXiv preprint arXiv:1907.03996, 2019
22019
Using theorem provers to increase the precision of dependence analysis for information flow control
B Beckert, S Bischof, M Herda, M Kirsten, M Kleine Büning
International Conference on Formal Engineering Methods, 284-300, 2018
22018
Combining Graph-based and Deduction-based Information-flow Analysis
B Beckert, S Bischof, M Herda, M Kirsten, MK Büning
Security Principles and Trust Hotspot 2017, 2017
22017
Combining Static and Dynamic Program Analysis Techniques for Checking Relational Properties
M Herda
Karlsruhe Institute of Technology, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20