VLDB 2026 Research / reviewers in the wild / expert
Kim Solin
dblp:74/3165
· DBLP profile ↗
8ranked-venue papers
6as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6 · 4 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 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.
| Theoretical computer science
1 paper |
Logic in computer science · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science › epistemic logic
dynamic epistemic logic |
0.1 | 1 | 2010 | A sketch of a dynamic epistemic semiring · Inf. Comput. 2010 |
Logic in computer science › semantics
semiring semantics |
0.1 | 1 | 2010 | A sketch of a dynamic epistemic semiring · Inf. Comput. 2010 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Encoding and Decoding in Refinement Algebra
Kim Solin |
RAMiCS | 1 |
| 2013 | Modal Semirings with Operators for Knowledge Representation
Kim Solin |
ICAART (2) | 1 |
| 2012 | Towards an Algebra for Real-Time Programs
Brijesh Dongol, Ian J. Hayes, Larissa Meinicke, Kim Solin |
RAMiCS | 4 |
| 2010 | Refinement algebra for probabilistic programsabstractAbstract We identify a refinement algebra for reasoning about probabilistic program transformations in a total-correctness setting. The algebra is equipped with operators that determine whether a program is enabled or terminates respectively. As well as developing the basic theory of the algebra we demonstrate how it may be used to explain key differences and similarities between standard (i.e. non-probabilistic) and probabilistic programs and verify important transformation theorems for probabilistic action systems. Larissa Meinicke, Kim Solin |
Formal Aspects Comput. | 2 |
| 2010 | A sketch of a dynamic epistemic semiring
Kim Solin |
Inf. Comput. | 1 |
| 2009 | Enabledness and termination in refinement algebra
Kim Solin, Joakim von Wright |
Sci. Comput. Program. | 1 |
| 2007 | A Sketch of a Dynamic Epistemic Semiring
Kim Solin |
WoLLIC | 1 |
| 2006 | Refinement Algebra with Operators for Enabledness and Termination
Kim Solin, Joakim von Wright |
MPC | 1 |