EDBT 2026 Demo / reviewers in the wild / expert
Juha Kortelainen
dblp:20/948
· DBLP profile ↗
18ranked-venue papers
9as first author
1since 2021 · last 2023
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 12 · 8 first-authorSecurity and privacy · 3Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1Applied, 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% | |
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program verification
modular verification |
0.2 | 1 | 2015 | Multi-parameterised compositional verification of safety properties · Inf. Comput. 2015 |
Program verification
safety properties |
0.2 | 1 | 2015 | Multi-parameterised compositional verification of safety properties · Inf. Comput. 2015 |
Cryptographic primitives and cryptanalysis
hash functions |
0.2 | 1 | 2013 | On Diamond Structures and Trojan Message Attacks · ASIACRYPT (2) 2013 |
Program verification › concurrent program verification
parameterized verification |
0.1 | 1 | 2015 | Multi-parameterised compositional verification of safety properties · Inf. Comput. 2015 |
Automata and formal languages
context-free languages |
0.0 | 1 | 1989 | The conjecture of Fliess on commutative context-free languages · J. ACM 1989 |
Automata and formal languages
regular languages |
0.0 | 1 | 1985 | Every Commutative Quasirational Language is Regular · ICALP 1985 |
Methods — techniques the papers use, named apart from their topics
model checking · 0.2assume-guarantee reasoning · 0.2counterexample · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | A microservices-based architecture for data and software management of heavy equipment digital twinsabstractDigital twins improve the performance of heavy equipment and decrease its operational costs. To be effective, they must run along decades of a real machine lifecycle. Ensuring coherence between a real machine and its digital twin over such a long period is a challenging task that has not yet been well-studied. This task involves preserving the design and operational data and periodic execution of digital twin software that processes such data. The circumstances of heavy equipment operation complicate the task. This paper considers the problem of digital twin data and software management in light of the unique challenges related to heavy equipment. It presents an experimental case study for running digital twins of mobile log cranes using a data model and a microservices-based architecture developed by the authors. The results demonstrate the capability of the architecture for running physics-based digital twins of heavy equipment in a heterogeneous execution environment consisting of local, edge, and cloud computing resources. Victor Zhidchenko, Egor Startcev, Juha Kortelainen, Akhtar Zeb, Leo Torvikoski, Saeid Torkabadi, Heikki Handroos |
INDIN | 3 |
| 2015 | Multi-parameterised compositional verification of safety properties
Antti Siirtola, Juha Kortelainen |
Inf. Comput. | 2 |
| 2015 | On simple generators of recursively enumerable languages
Juha Kortelainen |
J. Comput. Syst. Sci. | 1 |
| 2014 | New Second Preimage Attack Variants against the MD-Structure
Tuomas Kortelainen, Juha Kortelainen |
CANS | 2 |
| 2013 | On Diamond Structures and Trojan Message Attacks
Tuomas Kortelainen, Juha Kortelainen |
ASIACRYPT (2) | 2 |
| 2011 | Unavoidable Regularities in Long Words with Bounded Number of Symbol Occurrences
Juha Kortelainen, Tuomas Kortelainen, Ari Vesanen |
COCOON | 1 |
| 2011 | There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages
Juha Kortelainen, Tuukka Salmi |
Developments in Language Theory | 1 |
| 2010 | Variants of Multicollision Attacks on Iterated Hash Functions
Tuomas Kortelainen, Juha Kortelainen, Kimmo Halunen |
Inscrypt | 2 |
| 2009 | Algorithmic Verification with Multiple and Nested Parameters
Antti Siirtola, Juha Kortelainen |
ICFEM | 2 |
| 2007 | On systems of word equations with simple loop sets
Stepan Holub, Juha Kortelainen |
Theor. Comput. Sci. | 2 |
| 2005 | Polynomial Generators of Recursively Enumerable Languages
Juha Kortelainen |
Developments in Language Theory | 1 |
| 1999 | On the System of Word Equations x0ui1x1ui2x2ui3x3=y0vi1y1vi2y2vi3y3(i=0, 1, 2, ...) in a Free Monoid
Ismo Hakala, Juha Kortelainen |
Theor. Comput. Sci. | 2 |
| 1998 | Remarks about Commutative Context-Free Languages
Juha Kortelainen |
J. Comput. Syst. Sci. | 1 |
| 1997 | On the System of word equations x^i_1 x^i_2 ... x^i_m = y^i_1 y^i_2 ...y^i_n (i=1, 2, ...) in a Free Monoid
Ismo Hakala, Juha Kortelainen |
Acta Informatica | 2 |
| 1989 | The conjecture of Fliess on commutative context-free languagesabstractThe conjecture of Fliess concerning commutative context-free languages is disproved using a counterexample. Juha Kortelainen |
J. ACM | 1 |
| 1985 | Every Commutative Quasirational Language is Regular
Juha Kortelainen |
ICALP | 1 |
| 1982 | A result concerning the trios generated by commutative slip-languages
Juha Kortelainen |
Discret. Appl. Math. | 1 |
| 1981 | Some Properties of Language Families Generated by Commutative Languages
Juha Kortelainen |
FCT | 1 |