The development of political science in Central and Eastern Europe : bibliometric perspective, 1996–2013

This research aims to develop a deeper insight into the development of political science from the bibliometric perspective by analysing peer-reviewed journal articles (n = 1117) indexed in the Scopus database and published by authors from fifteen Central and Eastern European (CEE) countries in the period 1996–2013. Results indicate that the majority of articles (84%) by CEE authors have been published in international journals and in the English language. The visibility of these articles in international journals, measured by the mean number of citations, is 5.2 per paper, while the same indicator for CEE journal articles amounts to 0.2. Authorship analysis indicates a gradual but continuous increase in co-authorships. Additionally, there are significant differences in citations between single-authored and co-authored articles, both in international and CEE journals. Co-authorship among CEE authors is present in only 1% of the analysed articles, confirming weak collaboration between political scientists in CEE countries

Mechanically proving determinacy of hierarchical block diagram translations

| openaire: EC/H2020/730080/EU//ESROCOSHierarchical block diagrams (HBDs) are at the heart of embedded system design tools, including Simulink. Numerous translations exist from HBDs into languages with formal semantics, amenable to formal verification. However, none of these translations has been proven correct, to our knowledge. We present in this paper the first mechanically proven HBD translation algorithm. The algorithm translates HBDs into an algebra of terms with three basic composition operations (serial, parallel, and feedback). In order to capture various translation strategies resulting in different terms achieving different tradeoffs, the algorithm is nondeterministic. Despite this, we prove its semantic determinacy: for every input HBD, all possible terms that can be generated by the algorithm are semantically equivalent. We apply this result to show how three Simulink translation strategies introduced previously can be formalized as determinizations of the algorithm, and derive that these strategies yield semantically equivalent results (a question left open in previous work). All results are formalized and proved in the Isabelle theorem-prover and the code is publicly available.Peer reviewe

Mechanically proving determinacy of hierarchical block diagram translations

| openaire: EC/H2020/730080/EU//ESROCOSHierarchical block diagrams (HBDs) are at the heart of embedded system design tools, including Simulink. Numerous translations exist from HBDs into languages with formal semantics, amenable to formal verification. However, none of these translations has been proven correct, to our knowledge. We present in this paper the first mechanically proven HBD translation algorithm. The algorithm translates HBDs into an algebra of terms with three basic composition operations (serial, parallel, and feedback). In order to capture various translation strategies resulting in different terms achieving different tradeoffs, the algorithm is nondeterministic. Despite this, we prove its semantic determinacy: for every input HBD, all possible terms that can be generated by the algorithm are semantically equivalent. We apply this result to show how three Simulink translation strategies introduced previously can be formalized as determinizations of the algorithm, and derive that these strategies yield semantically equivalent results (a question left open in previous work). All results are formalized and proved in the Isabelle theorem-prover and the code is publicly available.Peer reviewe