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

Franz Weitl

dblp:60/4323 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2015
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorTheory of computation · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Software engineering, system software, and programming languages
1 paper
Program verification · 100%

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

TopicWeightPapersLastEvidence papers
Program verification › model checking › software model checking
distributed system model checking
0.212013
Software model checking for distributed systems with selector-based, non-blocking communication · ASE 2013
Program verification › model checking
software model checking
0.212013
Software model checking for distributed systems with selector-based, non-blocking communication · ASE 2013

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

selector-based i/o modeling · 0.2net-iocache · 0.2
YearPublicationVenuePosition
2015 Cardinality of UDP Transmission Outcomes
Franz Weitl, Nazim Sebih, Cyrille Artho, Masami Hagiya, Yoshinori Tanabe, Yoriyuki Yamagata, Mitsuharu Yamamoto
SETTA1
2013 Software model checking for distributed systems with selector-based, non-blocking communication
abstract
Many modern software systems are implemented as client/server architectures, where a server handles multiple clients concurrently. Testing does not cover the outcomes of all possible thread and communication schedules reliably. Software model checking, on the other hand, covers all possible outcomes but is often limited to subsets of commonly used protocols and libraries. Earlier work in cache-based software model checking handles implementations using socket-based TCP/IP networking, with one thread per client connection using blocking input/output. Recently, servers using non-blocking, selector-based input/output have become prevalent. This paper describes our work extending the Java PathFinder extension net-iocache to such software, and the application of our tool to modern server software.
Cyrille Artho, Masami Hagiya, Richard Potter, Yoshinori Tanabe, Franz Weitl, Mitsuharu Yamamoto
ASE5
2011 Verifying the consistency of web-based technical documentations
Christian Schönberg, Franz Weitl, Burkhard Freitag
J. Symb. Comput.2
2010 Structured Counterexamples for the Temporal Description Logic ALCCTL
abstract
A new algorithm for generating counterexamples for the temporal description logic ALCCTL is presented. ALCCTL is a decidable combination of the description logic ALC and computation tree logic CTL. It extends CTL by first order quantified expressions over unary and binary predicates. Predicates and quantified expressions are required for representing properties in application domains such as structured web documents and they are frequently used in software and hardware specifications which are verified by model checking. In the case of a specification violation, existing algorithms generate counterexamples that tend to be complex yet imprecise if specifications range over sets of objects. The presented algorithm is the first algorithm for generating counterexamples for a temporal description logic that considers first order predicates and quantification. The algorithm is sound and semi-complete for ALCCTL. The generated counterexamples are both more precise and comprehensible than counterexamples generated by the previous algorithms.
Franz Weitl, Shin Nakajima 0001, Burkhard Freitag
SEFM1
2009 Logic-based verification of technical documentation
abstract
Checking the content coherence of digital documents is the purpose of the Verdikt system which can be applied to different domains and document types including technical documentation, e-learning documents, and web pages. An expressive temporal description logic allows for the specification of content consistency criteria along document paths. Whether the document conforms to the specification can then be verified by applying a model checker. In case of specification violations, the model checker provides counterexamples, locating errors in the document precisely. Based on a sample technical documentation in the form of a web document, the general verification process and its effectiveness, efficiency, and usability are demonstrated.
Christian Schönberg, Franz Weitl, Mirjana Jaksic, Burkhard Freitag
ACM Symposium on Document Engineering2
2009 Towards the automated verification of semi-structured documents
Franz Weitl, Mirjana Jaksic, Burkhard Freitag
Data Knowl. Eng.1
2006 Checking Content Consistency of Integrated Web Documents
Franz Weitl, Burkhard Freitag
J. Comput. Sci. Technol.1