default search action
Mihai Herda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [b1]Mihai Herda:
Combining Static and Dynamic Program Analysis Techniques for Checking Relational Properties. Karlsruhe Institute of Technology, Germany, 2020 - [p2]Bernhard Beckert
, Mihai Herda
Integration of Static and Dynamic Analysis Techniques for Checking Noninterference. 20 Years of KeY 2020: 287-312
2010 – 2019
- 2019
- [c11]Mihai Herda
Verification-based test case generation for information-flow properties. SAC 2019: 2231-2238 - [c10]Bernhard Beckert
Using Relational Verification for Program Slicing. SEFM 2019: 353-372 - [c9]Mihai Herda
Understanding Counterexamples for Relational Properties with DIbugger. HCVS/PERR@ETAPS 2019: 6-13 - 2018
- [c8]Bernhard Beckert
Using Theorem Provers to Increase the Precision of Dependence Analysis for Information Flow Control. ICFEM 2018: 284-300 - [c7]Bernhard Beckert
Towards a Notion of Coverage for Incomplete Program-Correctness Proofs. ISoLA (2) 2018: 53-63 - [c6]Tobias Hamann, Mihai Herda
A Uniform Information-Flow Security Benchmark Suite for Source Code and Bytecode. NordSec 2018: 437-453 - [c5]Mihai Herda
Using Dependence Graphs to Assist Verification and Testing of Information-Flow Properties. TAP@STAF 2018: 83-102 - 2017
- [c4]Bernhard Beckert
SemSlice: Exploiting Relational Verification for Automatic Program Slicing. IFM 2017: 312-319 - 2016
- [c3]Tianhai Liu
Computing Specification-Sensitive Abstractions for Program Verification. SETTA 2016: 101-117 - [p1]Wolfgang Ahrendt, Christoph Gladisch, Mihai Herda
Proof-based Test Case Generation. Deductive Software Verification 2016: 415-451 - 2015
- [c2]Aboubakr Achraf El Ghazi
First-Order Transitive Closure Axiomatization via Iterative Invariant Injections. NFM 2015: 143-157 - 2014
- [c1]Wolfgang Ahrendt
The KeY Platform for Verification and Analysis of Java Programs. VSTTE 2014: 55-71 - [i1]Aboubakr Achraf El Ghazi, Mattias Ulbrich, Mana Taghdiri, Mihai Herda:
Reducing the Complexity of Quantified Formulas via Variable Elimination. CoRR abs/1408.0700 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: