Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hannah Arndt

dblp:200/7994 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 2 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automated reasoning and model checking · 100%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program verification
pointer program verification
0.312018
Let this Graph Be Your Witness! - An Attestor for Verifying Java Pointer Programs · CAV (2) 2018
Automated reasoning and model checking › model checking › temporal logic model checking
LTL model checking
0.312018
Let this Graph Be Your Witness! - An Attestor for Verifying Java Pointer Programs · CAV (2) 2018
Automated reasoning and model checking › model checking
temporal logic model checking
0.312018
Let this Graph Be Your Witness! - An Attestor for Verifying Java Pointer Programs · CAV (2) 2018

Methods — techniques the papers use, named apart from their topics

graph grammar · 0.7abstract state space generation · 0.7
YearPublicationVenuePosition
2018 Let this Graph Be Your Witness! - An Attestor for Verifying Java Pointer Programs
abstract
We present a graph-based tool for analysing Java programs operating on dynamic data structures. It involves the generation of an abstract state space employing a user-defined graph grammar. LTL model checking is then applied to this state space, supporting both structural and functional correctness properties. The analysis is fully automated, procedure-modular, and provides informative visual feedback including counterexamples in the case of property violations. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Hannah Arndt, Christina Jansen, Joost-Pieter Katoen, Christoph Matheja, Thomas Noll 0001
CAV (2)1
2018 Graph-Based Shape Analysis Beyond Context-Freeness
Hannah Arndt, Christina Jansen, Christoph Matheja, Thomas Noll 0001
SEFM1