Leonid Kof

dblp:83/2687 · DBLP profile ↗
← Back
13ranked-venue papers
9as first author
0since 2021 · last 2011
—ORCID · none

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

Software engineering, systems software and programming languages · 8 · 6 first-authorDatabases, data management, data science and information retrieval · 4 · 4 first-authorArtificial intelligence and machine learning · 3 · 3 first-authorTheory of computation · 2Human-computer interaction and ubiquitous 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
1 paper
Program verification · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

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

TopicWeightPapersLastEvidence papers
Program verification
distributed system verification
0.112006
Towards Modularized Verification of Distributed Time-Triggered Systems · FM 2006
Program verification
modular verification
0.112006
Towards Modularized Verification of Distributed Time-Triggered Systems · FM 2006
Embedded and real-time systems › real-time embedded systems
time-triggered systems
0.012006
Towards Modularized Verification of Distributed Time-Triggered Systems · FM 2006

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

model checking · 0.1assume-guarantee reasoning · 0.1
YearPublicationVenuePosition
2011 From Requirements to Models: Feedback Generation as a Result of Formalization
Leonid Kof, Birgit Penzenstadler
CAiSE1
2010 From Requirements Documents to System Models: A Tool for Interactive Semi-Automatic Translation
abstract
Natural language is the main presentation means in industrial requirements documents. This leads to the fact that requirements documents are often incomplete and inconsistent. Despite the fact that documents are mostly written in natural language, natural language processing (NLP) is barely used in industrial requirements engineering. The presented paper shows, how a natural language processing (NLP) approach can be integrated in a CASE tool. This enables the integrated tool to learn on the fly, which grammatical construction represents which model element. A valuable side effect of the proposed integration is tracing between the textual document and the constructed model. The presented integrated tool was evaluated in several case studies that have shown practical applicability of the tool.
Leonid Kof
RE1
2010 Ambiguity Detection: Towards a Tool Explaining Ambiguity Sources
Benedikt Gleich, Oliver Creighton, Leonid Kof
REFSQ3
2009 Requirements Analysis: Concept Extraction and Translation of Textual Specifications to Executable Models
Leonid Kof
NLDB1
2009 Translation of Textual Specifications to Automata by Means of Discourse Context Modeling
Leonid Kof
REFSQ1
2008 From Textual Scenarios to Message Sequence Charts: Inclusion of Condition Generation and Actor Extraction
abstract
Natural language is the main presentation means in industrial requirements documents. In such documents, system behavior is specified in the form of scenarios, with every scenario written as a sequence of sentences in natural language. To translate scenarios to executable models, message sequence charts (MSCs), we proposed an approach that analyzes textual scenarios by means of computational linguistics by L. Kof (2007). The presented paper shows that (1) a more differentiated treatment of certain sentence types than in our previous work results in better precision of the text-to-MSC translation and (2) it is possible to automate agent identification, performed semiautomatically in our previous work.
Leonid Kof
RE1
2008 On the correctness of upper layers of automotive systems
abstract
Abstract Formal verification of software systems is a challenge that is particularly important in the area of safety-critical automotive systems. Here, approaches like direct code verification are far too complicated, unless the verification is restricted to small textbook examples. Furthermore, the verification of application logic is of limited use in industrial context, unless the underlying operating system and the hardware are verified, too. This paper introduces a generic model stack, allowing the verification of all system layers as well as the concrete application models being used in the upper layers. The presented models and proofs close the gap between the correctness proof for the lower layers of car electronics developed at the Saarland University and the verification procedure for distributed applications developed at the Technische Universität München.
Jewgenij Botaschanjan, Manfred Broy, Alexander Gruler, Alexander Harhurin, Steffen Knapp, Leonid Kof, Wolfgang J. Paul, Maria Spichkova
Formal Aspects Comput.6
2007 Treatment of Passive Voice and Conjunctions in Use Case Documents
Leonid Kof
NLDB1
2007 Scenarios: Identifying Missing Objects and Actions by Means of Computational Linguistics
abstract
In industrial requirements documents natural language is the main presentation means. In such documents, system behavior is specified in the form of scenarios, written as a sequence of sentences in natural language. The scenarios are often incomplete: For the authors of requirements documents some facts are so obvious that they forget to mention them. This surely causes problems for the requirements analyst. This paper presents an approach that analyzes textual scenarios with the means of computational linguistics, identifies where communicating objects or whole actions are missing in the text, completes the missing information, and creates a message sequence chart (MSC) including the information missing in the textual scenario. Finally, this MSC is presented to the requirements analyst for validation. The paper presents also a case study in which scenarios from a requirement document based on industrial specifications were translated to MSCs. The case study shows the feasibility of the approach.
Leonid Kof
RE1
2006 Towards Modularized Verification of Distributed Time-Triggered Systems
Jewgenij Botaschanjan, Alexander Gruler, Alexander Harhurin, Leonid Kof, Maria Spichkova, David Trachtenherz
FM4
2005 Natural Language Processing: Mature Enough for Requirements Documents Analysis?
Leonid Kof
NLDB1
2005 Validating Documentation with Domain Ontologies
Leonid Kof, Markus Pizka
SoMeT1
2003 A Practical Approach of Teaching Software Engineering
abstract
In today's software industry a software engineer is not only expected to successfully cope with technical challenges, but also to deal with non-technical issues arising from difficult project situations. These issues typically include understanding the customer's domain and requirements, working in a team, organizing the division of work, and coping with time pressure and hard deadlines. Thus, in our opinion teaching Software Engineering, (SE) not only requires studying theory using text books, but also providing students with the experience of typical non-technical issues in a software project. This article reports experiences with the concept of a course focusing on providing practical know-how.
Michael Gnatz, Leonid Kof, Franz Prilmeier, Tilman Seifert
CSEE&T2