Florin Manea

Prof. Dr. Florin Manea


Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 May 2020
Verified
Book Chapter
Closed access
PDF file
LBLaura Barker
Laura Barker
PFPamela Fleischmann
Pamela Fleischmann
KHKatharina Harwardt
Katharina Harwardt
FMFlorin Manea
Florin Manea
DNDirk Nowotka
Dirk Nowotka

6 September 2019
Verified
Book Chapter
Closed access
PDF file
JDJoel D. Day
Joel D. Day
TEThorsten Ehlers
Thorsten Ehlers
MKMitja Kulczynski
Mitja Kulczynski
FMFlorin Manea
Florin Manea
DNDirk Nowotka
Dirk Nowotka
DPDanny Bøgsted Poulsen
Danny Bøgsted Poulsen

22 October 2021
Verified
Book Chapter
Closed access
PDF file
MKMaria Kosche
Maria Kosche
TKTore Koß
Tore Koß
FMFlorin Manea
Florin Manea
SSStefan Siemer
Stefan Siemer

25 June 2008 in Theory of Computing Systems
Verified
Journal Article
Closed access
PDF file
FMFlorin Manea
Florin Manea
MMMaurice Margenstern
Maurice Margenstern
Victor MitranaVictor Mitrana
Victor Mitrana
Mario J. Pérez-JiménezMario J. Pérez-Jiménez
Mario J. Pérez-Jiménez

5 October 2023
Verified
Book Chapter
Closed access
PDF file
PFPamela Fleischmann
Pamela Fleischmann
SKSungmin Kim
Sungmin Kim
TKTore Koß
Tore Koß
FMFlorin Manea
Florin Manea
DNDirk Nowotka
Dirk Nowotka
MWMax Wiedenhöft
Max Wiedenhöft

9 January 2023 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
JDJoel D. Day
Joel D. Day
VGVijay Ganesh
Vijay Ganesh
NGNathan Grewal
Nathan Grewal
FMFlorin Manea
Florin Manea
We investigate properties of strings which are expressible by canonical types of string constraints. Specifically, we consider a landscape of 20 logical theories, whose syntax is built around combinations of four common elements of string constraints: language membership (e.g. for regular languages), concatenation, equality between string terms, and equality between string-lengths. For a variable x and formula f from a given theory, we consider the set of values for which x may be substituted as part of a satisfying assignment, or in other words, the property f expresses through x. Since we consider string-based logics, this set is a formal language. We firstly consider the relative expressive power of different combinations of string constraints by comparing the classes of languages expressible in the corresponding theories, and are able to establish a mostly complete picture in this regard. Secondly, we consider the question of deciding whether the language or property expressed by a variable/formula in one theory can be expressed in another theory. We establish several negative results which are relevant to preprocessing and normalisation of string constraints in practice. Some of our results have strong connections to important open problems regarding word equations and the theory of string solving.