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.

Bodil Biering

dblp:47/6794 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2025
0009-0000-0830-2968ORCID · reported

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

Software engineering, systems software and programming languages · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 since 2021Theory 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.

Network and information security
1 paper
Systems and software security · 100%
Software engineering, system software, and programming languages
2 papers
Empirical software engineering · 64% Program verification · 18% Programming languages and type systems · 18%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Systems and software security
secure software development
0.912025
No Silver Bullet: Towards Demonstrating Secure Software Development for Small and Medium Enterprises in a Business-to-Business Model · CHI 2025
Empirical software engineering
practitioner studies
0.312025
No Silver Bullet: Towards Demonstrating Secure Software Development for Small and Medium Enterprises in a Business-to-Business Model · CHI 2025
Programming languages and type systems
abstract data types
0.112007
BI-hyperdoctrines, higher-order separation logic, and abstraction · ACM Trans. Program. Lang. Syst. 2007
Program verification
correctness proof
0.112007
BI-hyperdoctrines, higher-order separation logic, and abstraction · ACM Trans. Program. Lang. Syst. 2007
Logic in computer science › program logic
separation logic
0.112007
BI-hyperdoctrines, higher-order separation logic, and abstraction · ACM Trans. Program. Lang. Syst. 2007

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

workshop validation · 1.7semi-structured interviews · 1.7separation logic · 0.1hyperdoctrine · 0.1
YearPublicationVenuePosition
2025 No Silver Bullet: Towards Demonstrating Secure Software Development for Small and Medium Enterprises in a Business-to-Business Model
abstract
Software developing small and medium enterprises (SMEs) play a crucial role as suppliers to larger corporations and public administration.It is therefore necessary for them to be able to demonstrate that their products meet certain security criteria, both to gain trust of their customers and to comply to standards that demand such a demonstration.In this study we have investigated ways for SMEs to demonstrate their security when operating in a business-tobusiness model, conducting semi-structured interviews (𝑁 = 16) with practitioners from different SMEs in Denmark and validating our findings in a follow-up workshop (𝑁 = 6).Our findings indicate five distinctive security demonstration approaches, namely: Certifications, Reports, Questionnaires, Interactive Sessions and Social Proof.We discuss the challenges, benefits, and recommendations related to these approaches, concluding that none of them is a one-size-fits all solution and that more research into relative advantages of these approaches and their combinations is needed. CCS Concepts• Security and privacy → Social aspects of security and privacy.
Raha Asadi, Bodil Biering, Vincent van Dijk, Oksana Kulyk, Elda Paja
CHI2
2008 Cartesian closed Dialectica categories
Bodil Biering
Ann. Pure Appl. Log.1
2007 BI-hyperdoctrines, higher-order separation logic, and abstraction
abstract
We present a precise correspondence between separation logic and a simple notion of predicate BI, extending the earlier correspondence given between part of separation logic and propositional BI. Moreover, we introduce the notion of a BI hyperdoctrine, show that it soundly models classical and intuitionistic first- and higher-order predicate BI, and use it to show that we may easily extend separation logic to higher-order . We also demonstrate that this extension is important for program proving, since it provides sound reasoning principles for data abstraction in the presence of aliasing.
Bodil Biering, Lars Birkedal, Noah Torp-Smith
ACM Trans. Program. Lang. Syst.1
2005 BI Hyperdoctrines and Higher-Order Separation Logic
Bodil Biering, Lars Birkedal, Noah Torp-Smith
ESOP1