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

Thomas Santen

dblp:79/4203 · DBLP profile ↗
← Back
14ranked-venue papers
5as first author
1since 2021 · last 2022
—ORCID · none

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

Software engineering, systems software and programming languages · 7 · 1 first-author · 1 since 2021Security and privacy · 5 · 3 first-authorTheory of computation · 3 · 1 first-authorSystems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1

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.

Software engineering, system software, and programming languages
2 papers
Program verification · 81% Operating systems · 19%
Network and information security
1 paper
Systems and software security · 100%

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

TopicWeightPapersLastEvidence papers
Program verification › system verification › systems code verification
hypervisor verification
0.112009
Verifying the Microsoft Hyper-V Hypervisor with VCC · FM 2009
Systems and software security
information flow control
0.112008
Preservation of probabilistic information flow under refinement · Inf. Comput. 2008
Operating systems › virtualization
hypervisor
0.012009
Verifying the Microsoft Hyper-V Hypervisor with VCC · FM 2009
Program verification
refinement
0.012008
Preservation of probabilistic information flow under refinement · Inf. Comput. 2008

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

deductive verification · 0.1VCC · 0.1
YearPublicationVenuePosition
2022 On the Pragmatics of Moving from System Models to Program Contracts
Thomas Santen
ISoLA (1)1
2013 Model-based energy optimization of automotive control systems
abstract
Reducing the energy consumption of controllers in vehicles requires sophisticated regulation mechanisms. Better power management can be enabled by allowing the controller to shut down sensors, actuators or embedded control units in a way that keeps the car safe and comfortable for the user, with the goal of optimizing the (average or maximal) energy consumption. This paper proposes an approach to systematically explore the design space of SW/HW mappings to determine energy-optimal deployments. It employs constraint-solving techniques for generating deployment candidates and probabilistic analyses for computing the expected energy consumption of the respective deployment. The feasibility and scalability of the method is demonstrated by several case studies.
Joost-Pieter Katoen, Thomas Noll 0001, Hao Wu 0013, Thomas Santen, Dirk Seifert
DATE4
2010 Components, platforms and possibilities: towards generic automation for MDA
abstract
Model-driven architecture (MDA) is a model-based approach for engineering complex software systems. MDA is particularly attractive for designing embedded systems because models can be easily evolved as hardware and software requirements evolve. However, efforts to apply MDA in industrial settings expose several open problems surrounding tooling: Engineers need automated techniques that are scalable, general, and extensible. In this paper we describe the formula framework as a novel approach towards general automation for MDA. We develop a running example and benchmarks to compare our tools with other state-of-theart approaches.
Ethan K. Jackson, Eunsuk Kang, Markus Dahlweid, Dirk Seifert, Thomas Santen
EMSOFT5
2010 A comparison of security requirements engineering methods
Benjamin Fabian, Seda Gurses, Maritta Heisel, Thomas Santen, Holger Schmidt 0001
Requir. Eng.4
2009 Verifying the Microsoft Hyper-V Hypervisor with VCC
Dirk Leinenbach, Thomas Santen
FM2
2008 Preservation of probabilistic information flow under refinement
Thomas Santen
Inf. Comput.1
2006 A Formal Framework for Confidentiality-Preserving Refinement
Thomas Santen
ESORICS1
2006 Stepwise Development of Secure Systems
Thomas Santen
SAFECOMP1
2002 Confidentiality-Preserving Refinement is Compositional - Sometimes
Thomas Santen, Maritta Heisel, Andreas Pfitzmann
ESORICS1
2002 Toward a Formal Model of Software Components
Maritta Heisel, Thomas Santen, Jeanine Souquières
ICFEM2
2001 Confidentiality-Preserving Refinement
abstract
Abstract: We develop a condition for confidentiality-preserving refinement which is both necessary and sufficient. Using a slight extension of CSP as notation, we give a toy example to illustrate the usefulness of our condition. Systems are specified by their behavior and a window. For an abstract system, the window specifies what information is allowed to be observed by its environment. For a concrete system, the window specifies what information cannot be hidden from its environment. A concrete system is a confidentiality-preserving refinement of an abstract system, if it behaviorally refines the abstract system and if the information revealed by the concrete window is allowed to be revealed according to the abstract window.
Maritta Heisel, Andreas Pfitzmann, Thomas Santen
CSFW3
2000 Behavioral Conformance Verification in an Integrated Approach Using UML and B
Eric Meyer, Thomas Santen
IFM2
1998 An Agenda for Specifying Software Components with Complex Data Models
Kirsten Winter, Thomas Santen, Maritta Heisel
SAFECOMP2
1997 Searching for a Global Search Algorithm
Sabine Dick, Thomas Santen
Autom. Softw. Eng.2