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.

Albert Dietl

dblp:34/2235 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none

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

Security and privacy · 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
1 paper
Program verification · 50% Requirements engineering and software design · 50%

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

TopicWeightPapersLastEvidence papers
Requirements engineering and software design
constructive program development
0.011990
Formal Construction of Provably Secure Systems with Cartesiana · S&P 1990

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

proof rules · 0.0formal requirements · 0.0
YearPublicationVenuePosition
1990 Formal Construction of Provably Secure Systems with Cartesiana
abstract
Cartesiana is a system to support the construction of software on the basis of formal methods. It is currently being used for the development of a provably secure system in a pilot project in West Germany. The quality criteria applied go beyond A1 and include program level verification. The Cartesiana approach to meet these criteria emphasizes constructive techniques. Proof rules are used to derive a solution in such a way that development and verification are closely combined. Rules and specified formal requirements guide the development process. Some of the methodological aspects are illustrated by way of example. A concise overview over the main functionalities of the system is given.>
H. Brix, Albert Dietl
S&P2