Zobrazeno 1 - 10
of 65
pro vyhledávání: '"LONATI, Violetta"'
Autor:
Bellettini, Carlo, Lonati, Violetta, Malchiodi, Dario, Monga, Mattia, Morpurgo, Anna, Torelli, Mauro
Publikováno v:
Informatics in schools : local proceedings of the 6th International Conference ISSEP 2013 ; selected papers ; Oldenburg, Germany, February 26–March 2, 2013/Diethelm et al. (Eds.)/ Potsdam: Universitätsverlag Potsdam, 2013/ S. 139-147
In this paper we report on our experiments in teaching computer science concepts with a mix of tangible and abstract object manipulations. The goal we set ourselves was to let pupils discover the challenges one has to meet to automatically manipulate
Externí odkaz:
http://opus.kobv.de/ubp/volltexte/2013/6461/
Autor:
Brodnik, Andrej, Csizmadia, Andrew, Futschek, Gerald, Kralj, Lidija, Lonati, Violetta, Micheuz, Peter, Monga, Mattia
Computer programs are part of our daily life, we use them, we provide them with data, they support our decisions, they help us remember, they control machines, etc. Programs are made by people, but in most cases we are not their authors, so we have t
Externí odkaz:
http://arxiv.org/abs/2111.04887
Publikováno v:
Informatics in Education - An International Journal. 20(4):615-639
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=1002215
Autor:
Lonati, Violetta
Publikováno v:
Informatics in Education - An International Journal. 19(4):669-699
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=914761
\omega-languages are becoming more and more relevant nowadays when most applications are 'ever-running'. Recent literature, mainly under the motivation of widening the application of model checking techniques, extended the analysis of these languages
Externí odkaz:
http://arxiv.org/abs/1301.2476
Floyd languages (FL), alias Operator Precedence Languages, have recently received renewed attention thanks to their closure properties and local parsability which allow one to apply automatic verification techniques (e.g. model checking) and parallel
Externí odkaz:
http://arxiv.org/abs/1204.4639
Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the well-known visibly pushdown languages, and enjoy the same nice closure properti
Externí odkaz:
http://arxiv.org/abs/1012.2321
Publikováno v:
Mondo Digitale. nov2022, Issue 97, p1-12. 12p.
Publikováno v:
In Theoretical Computer Science 7 January 2017 658 Part A:105-121
Autor:
BEGUM, Marjahan, HAGLUND, Pontus, KORHONEN, Ari, LONATI, Violetta, MONGA, Mattia, STRÖMBÄCK, Filip, TILANTERÄ, Artturi
Publikováno v:
Informatics in Education; Mar2024, Vol. 23 Issue 1, p57-99, 43p