Department of Computer Science
Università degli Studi di Verona

Dr. Margherita Zorzi, Ph.D




Assistant Professor


Dipartimento di Informatica
- Università degli Studi di Verona
Strada Le Grazie 15,
37135 Verona

margherita.zorzi@univr.it

Office/Ufficio/Bureau 1.80 (Ca' Vignal 2)




About

Back to menu

Interests and Groups

Qualifications

Forthcoming and Recent Events



Publications

Labels, legenda: [Q] Quantum Computing, [TCS] Theoretical Computer Science-Logical Methods in Computer Science , [ALCS] Applied Logic in Computer Science, [NLP] Natural Language Processing, [DID] Didactic of Computer Science

Back to menu

Submitted papers

International Journals

  1. [Q] [TCS] A logic for quantum register measurements (with A. Masini), Axioms 2019, 8(1), 25; https://doi.org/10.3390/axioms8010025. PDF


  2. [Q] [TCS] qPCF: higher-order languages and quantum circuits (with Luca Paolini). Accepted for publication in JAR-Journal of Automated Reasoning, Springer, 2019, on line first view, DOI https://doi.org/10.1007/s10817-019-09518-y , Print ISSN 0168-7433, Online ISSN 1573-0670



  3. [ALCS] Diagnostics as a Reasoning Processes: from Logic structure to Software design (with M. Cristani, F. Olivieri, C. Tomazzoli, L. Viganò). Accepted for publication in CIT- Journal of Computing and Information Technology, in press, 2018.



  4. [NLP] Normalizing Spontanous Reports into MedDRA: some experiments with the NLP software MagiCoder (with Gabriele Pozzani, Carlo Combi, Ugo Moretti). Journal of Biomedical and Healthcare Informatics, in print, 2018.



  5. [NLP] From narrative descriptions to MedDRA: automagically encoding adverse drug reactions (with Gabriele Pozzani, Carlo Combi, Ugo Moretti). Journal of Biomedical Informatics 84, pp. 184-199, 2018.



  6. [ALCS] A Hybrid Logic for XML Reference constraints (with Carlo Combi, Andrea Masini and Barbara Oliboni). Data and Knowledge Engineering 115, pp. 94-115, 2018


  7. [Q] [TCS] A Branching Distributed Temporal Logic for Reasoning about Quantum State Transformations (with Marco Volpe and Luca Viganò). Information&Computation 255, pp. 311-333, 2017.

    The Distributed Temporal Logic DTL allows one to reason about temporal properties of a distributed system from the local point of view of the systemÕs agents, which are as- sumed to execute independently and to interact by means of event sharing. In this paper, we introduce the Quantum Branching Distributed Temporal Logic QBDTL, a variant of DTL able to represent quantum state transformations in an abstract, qualitative way. In QBDTL, each agent represents a distinct quantum bit (the unit of quantum information theory), which evolves by means of quantum transformations and possibly interacts with other agents, and n-ary quantum operators act as communication/synchronization points between agents. We endow QBDTL with a DTL-style semantics, which fits the intrinsically distributed nature of quantum computing, we formalize a labeled deduction system for QBDTL, and we prove the soundness and completeness of this deduction system with respect to the given semantics. Finally, we discuss possible extensions of our system in order to reason about entanglement phenomena.



  8. [TCS] Natural Deduction in Classical First-Order Logic: Exceptions, Strong Normalization and Herbrand's Theorem (with Federico Aschieri). Theoretical Computer Science, Vol. 625, pp. 125--146, 2016.

    We present a new Curry-Howard correspondence for classical first-order natural deduction. We add to the lambda calculus an operator which represents, from the viewpoint of programming, a mechanism for raising and catching multiple exceptions, and from the viewpoint of logic, the excluded middle over arbitrary prenex formulas. The machinery will allow to extend the idea of learning Ð originally developed in Arithmetic Ð to pure logic. We prove that our typed calculus is strongly normalizing and show that proof terms for simply existential statements reduce to a list of individual terms forming an Herbrand disjunction. A by-product of our approach is a natural-deduction proof and a computational interpretation of HerbrandÕs Theorem.



  9. [Q] [TCS] Quantum Lambda Calculi: a foundational perspective, Mathematical Structures in Computer Science, Volume 26, Issue 7, pp. 1107-119, 2016, doi:10.1017/S0960129514000425

    In this paper we propose an approach to quantum lambda-calculi. The quantum data-classical control paradigm is considered. Starting from a measurement-free untyped quantum lambdaÐcalculus called Q, we will study standard properties such as confluence and subject reduction and some good quantum properties. We will focus on the expressive power, analyzing the relationship with other quantum computational models. Successively, we will add an explicit measurement operator to Q. On the resulting calculus, called Q^{*} we will propose a complete study of reductions sequences regardless their finiteness, proving confluence results. Moreover, since the stronger motivation behind quantum computing is the research of new results in computational complexity, we will also propose a calculus which captures the three classes of quantum polytime complexity, showing an ICC-like approach in the quantum setting.



  10. [TCS] Probabilistic Operational Semantics for the Lambda Calculus (with Ugo Dal Lago),
    RAIRO - Theoretical Informatics and Applications, DOI 10.1051/ita/2012012, vol. 46 , n. 03 , 2012 , pp. 413-450, CUP, 2012.

    Probabilistic operational semantics for a nondeterministic extension of pure lambda calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics are both inductively and coinductively defined. Moreover, small-step and big-step semantics are shown to produce identical outcomes, both in call-by- value and in call-by-name. Plotkin's CPS translation is extended to accommodate the choice operator and shown correct with respect to the operational semantics. Finally, the expressive power of the obtained system is studied: the calculus is shown to be sound and complete with respect to computable probability distributions.


  11. [Q] [TCS] Modal Deduction Systems for Quantum State Transformations (with Andrea Masini and Luca Viganò. )
    Journal of Multiple-Valued Logic and Soft Computing, Volume 17, Number 5-6, pp 475-519. 2011.

    We introduce two modal natural deduction systems, MSQR and MSpQR, which are suitable to represent and reason about transformations of quantum states in an abstract, qualitative, way. Our systems provide a modal framework for reasoning about operations on quantum states (unitary transformations and measurements) in terms of possible worlds (as abstractions of quantum states) and accessibility relations between these worlds. We give a Kripke--style semantics that formally describes quantum state transformations, and prove the soundness and completeness of our systems with respect to this semantics. We also prove a normalization result for MSQR and MSpQR, showing that all derivations can be reduced to a normal form that satisfies a subformula property and yields a syntactic proof of the consistency of our deduction systems.


  12. [Q] [TCS] Confluence Results for A Quantum Lambda Calculus with Measurements. (with Andrea Masini and Ugo Dal Lago)
    Electronic Notes in Theoretical Computer Science, DOI 10.1016/j.entcs.2011.01.035, Volume 207, pp. 251-261, 2011.

    A strong confluence result for Q*, a quantum lambda-calculus with measurements, is proved. More precisely, confluence is shown to hold both for finite and infinite computations. The technique used in the confluence proof is syntactical but innovative. This makes Q* different from similar quantum lambda calculi, which are either measurement-free or provided with a reduction strategy.


  13. [Q] [TCS] Quantum Implicit Computational Complexity (with Andrea Masini and Ugo Dal Lago)
    Theoretical Computer Science, DOI:10.1016/j.tcs.2009.07.045, Volume 411, Issue 2, Pages 377-409, Elsevier, 2010.

    We introduce a quantum lambda calculus inspired by Lafont's Soft Linear Logic and capturing the polynomial quantum complexity classes EQP, BQP\ and ZQP. The calculus is based on the ``classical control and quantum data'' paradigm. This is the first example of a formal system capturing quantum complexity classes in the spirit of implicit computational complexity --- it is machine-free and no explicit bound (e.g., polynomials) appears in its syntax.


  14. [Q] [TCS] On a Measurement-Free Quantum Lambda Calculus with Classical Control (with Andrea Masini and Ugo Dal Lago )
    Mathematical Structures in Computer Science, ISSN: 0960-1295, EISSN: 1469-8072, DOI 10.1017/S096012950800741X,
    Volume 19, Issue 02, pp 297-335, Cambridge University Press, UK, 2009. and review

    We study a measurement-free, untyped lambda-calculus with quantum data and classical control. This work stems from previous proposals by Selinger and Valiron and by Van Tonder. We focus on operational and expressiveness issues, rather than (denotational) semantics. We prove subject reduction, confluence and a standardization theorem. Moreover, we prove the computational equivalence of the proposed calculus with a suitable class of quantum circuit families.


International Conferences and Workshops

  1. [ALCS] ''It could be worse, it could be raining'': reliable automatic meteorological forecasting for holiday planning (with M. Cristani, F. Domenichini, C. Tomazzoli, and Luca Viganò), accepted for publication in Proceedings of 32nd International Conference on Industrial, Engineering & Other Applications of Applied Intelligent Systems (IEA/AIE 2019), 2019, to appear. LONG VERSION PDF and SPINdle Implementation PDF


  2. [NLP] Automatic Generation of Dictionaries: the journalistic lexicon case (with M. Cristani and C. Tomazzoli),accepted for publication in Proceedings of 32nd International Conference on Industrial, Engineering & Other Applications of Applied Intelligent Systems (IEA/AIE 2019), 2019, to appear.


  3. [ALCS] Web Literature, Authorship Attribution and Editorial workflow Ontologies (with M. Cristani, F. Olivieri, L. Olivieri, C. Tomazzoli). Accepted for publication in Proceedings of KES-AMSTA 2019.


  4. [Q] [TCS] Quantum Programming Made Easy (with Luca Paolini and Luca Roversi). Proceedings Joint International Workshop on Linearity & Trends in Linear Logic and Applications Oxford, UK, 7-8 July 2018, Electronic Proceedings in Theoretical COmputer Science EPTCS 292, pp. 133--147 ArXiv




  5. [NLP] Making sentiment analysis algorithms scalable (with M. Cristani, M. Cristani, A. Pesarin, C. Tomazzoli). In Current Trends in Web Engineering - {ICWE} 2018 International Workshops, MATWEP, EnWot, KD-WEB, WEOD, TourismKG, C{\'{a}}ceres, Spain, June 5, 2018, Revised Selected Papers, 136--147, series Lecture Notes in Computer Science 11153, 2018.



  6. [ALCS] It could rain: weather forecasting as a reasoning process (with M. Cristani, F. Domenichini, F. Olivieri, C. Tomazzoli). Proceedings of 22nd International Conference on Knowledge-Based and Intelligent Information & Engineering Systems KES 2018, Procedia Computer Science 126, 850--859, Elsevier, 2018.



  7. [NLP] MORE: a simple algorithm for the lexical classification of comparable adjectives (with M. Cristani, I. Chito, C. Tomazzoli). Proceedings of 22nd International Conference on Knowledge-Based and Intelligent Information & Engineering Systems KES 2018, Procedia Computer Science 126, 626--635, Elsevier, 2018.



  8. [ALCS] Towards a Logical Framework for Diagnostic Reasoning (with M. Cristani, F. Olivieri, C. Tomazzoli). Proceedings of KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications-KES-AMSTA 2018, Smart Innovation, Systems and Technologies, vol 96, 144-155, Springer



  9. [NLP] Mapping Free Text into MedDRA by Natural Language Processing: a Modular Approach in Designing and Evaluating Software Extensions (with Gabriele Pozzani, Carlo Combi, Ugo Moretti). Proceedings of 8th ACM Conference on Bioinformatics, Computa- tional Biology, and Health Informatics (ACM-BCB 17), BCB 17, pp. 27-35, ACM New York, 2017. ISBN 978-1-4503-4722-8 DOI:10.1145/3107411.3107431 link: https://dl.acm.org/citation.cfm?id=3107431




  10. [NLP] A Co-occurrence Based MedDRA Lexicon Generation: Some Preliminary Results (with Gabriele Pozzani, Carlo Combi, Elena Arzenton, Ugo Moretti). 16th Conference on Artificial Intelligence In Medicine (AIME 17), Vienna, june 21-24, Lecture Notes in Computer Science, 10259, pp. 215-220, Springer, 2017. ISBN 978-3-319-59758-4 DOI 10.1007/978-3-319-59758-4 24 link: https://link.springer.com/chapter/10.1007/978-3-319-59758- 4 24




  11. [DID] Psychology of programming: the role of creativity, empathy and systemizing (with Ugo Solitro, Margherita Pasini, Margherita Brondino, Roberto Burro, Daniela Raccanello). Proceedings of 7th International Conference in Methodologies and intelligent Systems for Technology Enhanced Learning (MIS4TEL'17), University of Porto, June 21-23, 2017, Advances in Intelligent Sy- stems and Computing, Volume 617, pp. 82-89, Springer, 2017. ISBN: 978-3-319-60819-8 ISSN: 21945357 DOI: 10.1007/978-3-319-60819-8 10 link: https://link.springer.com/chapter/10.1007%2F978-3-319-60819- 8 10



  12. [Q] [TCS] qPCF: a language for quantum circuit computations (with Luca Paolini). n proceedings of Theory and Applications of Models of Computation 14th Annual Conference, TAMC 2017, Bern, Swi- tzerland, April 20-22, 2017, Lecture Notes in Computer Science 10185, pp. 455-469, Springer, 2017. ISBN: 978-3-319-55911-7 ISSN: 03029743 DOI: 10.1007/978-3-319-55911-7 33 link: https://link.springer.com/chapter/10.1007/978-3-319-55911- 7 33

    We propose qPCF , a functional language able to define and manipulate quantum circuits in an easy and intuitive way. qPCF follows the tradition of Òquantum data & classical controlÓ languages, inspired to the QRAM model. Ideally, qPCF computes finite circuit descriptions which are offloaded to a quantum co-processor (i.e. a quantum device) for the execution. qPCF extends PCF with a new kind of datatype: quantum circuits. The typing of qPCF is quite different from the mainstream of Òquantum data & classical controlÓ languages that involves linear/exponential modali- ties. qPCF uses a simple form of dependent types to manage circuits and an implicit form of monad to manage quantum states via a destructive- measurement operator. .



  13. [DID] Early training in programming: from high school to college (with Ugo Solitro, Margherita Pasini, Margherita Brondino).Proceedings of 2nd EAI International Conference on Smart Objects and Technologies for Social Good, GOODTECHS 2016, Venice, Italy, 30 November -1 December 2016, GoodTechs 2016, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunica- tions Engineering, LNICST 195, pp. 325-332, Springer Verlag, 2017.

    Informatics is recognized as a fundamental discipline in education at all levels. Also, it is an indispensable subject for scientific and technical studies. In Italy, many scien- tific degree courses offer in the first year at least an introductory course in programming. Digital skills and a basic attitude to computational thinking are in general expected. In the present study, conducted at the University of Verona, in the context of the course Pro- gramming with laboratory of Applied Mathematics curriculum, we analyze the first period of lessons, when the fundamentals of programming are introduced. Most of the students come from secondary schools, in particular Liceo, a secondary school with emphasis science or humanities, where the role of informatics is in general not central. So an academic course in programming can be a difficult task for students. In this paper, we analyze how the ÓculturalÓ background influences the learning of programming and the performance of students.



  14. [DID] A "light" application of Blended Extreme Apprenticeship in teaching Programming to Students of Mathematics (with Ugo Solitro, Margherita Pasini, Margherita Brondino). Proceedings of 6th International Conference in Methodologies and intelligent Systems for Technology Enhanced Learning (MIS4TEL'16), University of Sevilla, Sevilla (Spain) ,1st-3rd June, 2016. Advances in Intelligent Systems and Computing 478, pp. 73-80. PDF

    In this paper we analyze an application of eXtreme Apprenticeship (XA) methodology, in a blended form with a reduced set of software and human resources. The study was conducted at University of Verona, in the context of the course ÒProgramming with LaboratoryÓ with 170 participants enrolled at the first degree in Applied Mathematics, throughout three different academic years. We analyze the very first period of lessons, when the fundamentals of programming are introduced. During the first two years, students were trained with a traditional teach- ing method; the lasts group was trained using the XA teaching model. Results showed a real improvement of learning outcomes in students trained with XA compared with the traditional teaching method. Possible refinements of XA method in our case study and in other educational contexts are discussed.



  15. [NLP] Automagically Encoding Adverse Drug Reactions in MedDRA (with Carlo Combi, Riccardo Lora, Ugo Moretti, Marco Pagliarini), IEEE International Conference on Healthcare Informatics 2015 (ICHI 2015), Dallas, TX, USA, 21-24 October, 2015.

    Pharmacovigilance is the field of science devoted to the collection, analysis, and prevention of Adverse Drug Reac- tions (ADRs). Efficient strategies for the extraction of information about ADRs from free text sources are essential to support the important task of detecting and classifying unexpected pathologies, possibly related to (therapy-related) drug use. Narrative ADR descriptions may be collected in different ways, e.g., either by monitoring social networks or through the so called Òspontaneous reporting, the main method pharmacovigilance adopts in order to identify ADRs. The encoding of free-text ADR descriptions according to MedDRA standard terminology is central for report analysis. It is a complex work, which has to be manually implemented by the pharmacovigilance experts. The manual encoding is expensive (in terms of time). Moreover, a problem about the accuracy of the encoding may occur, since the number of reports is growing up day by day. In this paper, we propose MagiCoder, an efficient Natural Language Processing algorithm able to automatically derive MedDRA terminologies from free- text ADR descriptions. MagiCoder is part of VigiWork, a web application for online ADR reporting and analysis. From a practical point of view, MagiCoder reduces the encoding time of ADR reports. Pharmacologists have simply to review and validate the MedDRA terms proposed by MagiCoder, instead of choosing the right terms among the 70K terms of MedDRA. Such improvement in the efficiency of pharmacologistsÕ work has a relevant impact also on the quality of the following data analysis. Our proposal is based on a general approach, not depending on the considered language. Indeed, we developed MagiCoder for the Italian pharmacovigilance language, but preliminarily analyses show that it is robust to language and dictionary changes. I

  16. [NLP] A Logical Framework for XML Reference Specification (with Carlo Combi, Andrea Masini and Barbara Oliboni). LECTURE NOTES IN COMPUTER SCIENCE, Springer Verlag Germany , Atti di "26th International Conference on Database and Expert Systems Applications - DEXA 2015" , Valencia (Spain) , 1-4 september 2015 , 9262 , pp. 258--267.

    In this paper we focus on a (as much as possible) simple logic, called XHyb, expressive enough to allow the specification of the most common integrity constraints in XML documents. In particular we will deal with constraints on ID and IDREF(S) attributes, which are the common way of logically connecting parts of XML documents, besides the usual containment relation of XML elements.

  17. [Q] [TCS] Wave-Style Token Machines and Quantum Lambda Calculi (with Ugo Dal Lago). Electronic Proceedings in Theoretical Computer Science (EPTCS), Vol. 176, 64--78, 2015. Post-proceedings of LINEARITY 2014, Vienna Summer of Logic. Extended Version:

    Particle-style token machines are a way to interpret proofs and programs, when the latter are written following the principles of linear logic. In this paper, we show that token machines also make sense when the programs at hand are those of a simple quantum lambda-calculus with implicit qubits. This, however, requires generalizing the concept of a token machine to one in which more than one particle travel around the term at the same time. The presence of multiple tokens is intimately related to entanglement and allows to give a simple operational semantics to the calculus, coherently with the principles of quantum computation.



  18. [Q] [TCS] Quantum State Transformations and Branching Distributed Temporal Logic (with Marco Volpe and Luca Viganò). In proceedings of 21st International Workshop on Logic, Language, Information and Computation (Wollic'14), (U. Kohlenbach, P. Barcel, R. de Quei- roz Eds.), Lecture Notes in Computer Science, Vol. 8652, ISBN 978-3-662-44145-9, 1-19, 2014.

    The Distributed Temporal Logic DTL allows one to reason about tem-poral properties of a distributed system from the local point of view of the system's agents, which are assumed to execute independently and to interact by means of event sharing. In this paper, we introduce the Quantum Branching Distributed Temporal Logic QBDTL, a variant of DTL able to represent quantum state transformations in an abstract, qualitative way. In QBDTL, each agent rep- resents a distinct quantum bit (the unit of quantum information theory), which evolves by means of quantum transformations and possibly interacts with other agents, and n-ary quantum operators act as communication/synchronization points between agents. We endow QBDTL with a DTL-style semantics, which fits the intrinsically distributed nature of quantum computing, we formalize a labeled de- duction system for QBDTL, and we prove the soundness of this deduction system with respect to the given semantics. Finally, we discuss possible extensions of our system in order to reason about entanglement phenomena.



  19. [TCS] An Intuitionistic Game Semantical Realizability Validating Markov's Principle (with Federico Aschieri). Post-proceedings of TYPES 2013, Leibniz International Proceedings in Informatics 26, 24-44, DOI: 10.4230/LIPIcs.TYPES.2013.24, 2014. Also Presented at Classical Logic and Computation 2014 (CL&C'14), Vienna Summer of Logic.

    We propose a very simple modification of Kreisel's modified realizability in order to computationally realize Markov's Principle in the context of Heyting Arithmetic. Intuitively, realizers correspond to arbitrary strategies in Hintikka-Tarski games, while in Kreisel's realizability they can only represent winning strategies. Our definition, however, does not employ directly game semantical concepts and remains in the style of functional interpretations. As term calculus, we employ a purely functional language, which is Goedel's System T enriched with some syntactic sugar.




  20. [TCS] Non-Determinism, Non-Termination and the Strong Normalization of System T (with Federico Aschieri). TLCA'13 (Typed Lambda Calculi and Applications, parts of International Conference on Rewriting, Deduction, and Programming June 23 to June 28, 2013, Eindhoven (The Netherlands ). LNCS 7941, 31--47. Springer, Heidelberg, 2013.

    We consider a deLiguoro-Piperno-style extension of the pure lambda calculus with a non-deterministic choice operator as well as a non-deterministic iterator construct, with the aim of studying its normalization properties. We provide a simple characterization of non-strongly normalizable terms by means of the so called zoom-in perpetual reduction strategy. We then show that this characterization implies the strong normalization of the simply typed version of the calculus. As straightforward corollary of these results we obtain a new proof of strong normalization of Goedel's System T by a simple translation of this latter system into the former.




  21. [TCS] Interactive Realizability and the Elimination of Skolem Functions in Peano Arithmetic (with Federico Aschieri). Proceeding of 4th Classical Logic and Computation - ( CL&C'12 Icalp 2012), Warwick - England, 8th July, Electronic Proceedings in Theoretical Computer Science, vol. 97, pp. 1-18, 2012.

    We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservative over Peano Arithmetic alone for arithmetical formulas. This result - which shows that the Excluded Middle principle can be used to eliminate Skolem functions - has been previously proved by other techniques, among them the epsilon substitution method and forcing. In this paper, we employ Interactive Realizability, a computational semantics for Peano Arithmetic which extends Kreisel's modified realizability to the classical case.



  22. [TCS] General Ramified Recursion is Sound for Polynomial Time. (with Ugo Dal Lago and Simone Martini)
    In Electronic Proceedings in Theoretical Computer Science (EPTCS), proceedings of Developments in Implicit Computational complExity (DICE 2010, part of ETAPS),
    Cipro, March 27-28, 2010, vol. 23, pp 47-62, 2010.

    Leivant's ramified recurrence is one of the earliest examples of an implicit characterization of the polytime functions as a subalgebra of the primitive recursive functions. Leivant's result, however, is originally stated and proved only for word algebras, i.e.\ free algebras whose constructors take at most one argument. This paper presents an extension of these results to ramified functions on any free algebras, provided the underlying terms are represented as graphs rather than trees, so that sharing of identical subterms can be exploited.


  23. [Q] [TCS] A Qualitative Modal Representation of Quantum Register Transformations (with Andrea Masini e Luca Viganò )
    Atti della conferenza 38th International Symposium on Multiple Valued Logic, 22-24 maggio 2008, Dallas TX, USA, curatore Gerhard Dueck,
    IEEE computer society, ISBN 978-0-7695-3155-7, ISSN Number 0195-623X, DOI 10.1109/ISM- VL.2008.36, USA, pp 131-137, 2008.

    We introduce two modal natural deduction systems that are suitable to represent and reason about transformations of quantum registers in an abstract, qualitative, way. Quantum registers represent quantum systems, and can be viewed as the structure of quantum data for quantum operations. Our systems provide a modal framework for reasoning about operations on quantum registers (unitary trans- formations and measurements) in terms of possible worlds (as abstractions of quantum registers) and accessibility relations between these worlds. We give a KripkeÐstyle semantics that formally describes quantum register transformations, and prove the soundness and completeness of our systems with respect to this semantics.



Miscellanea


Theses


Teaching activities (at University of Verona)

Back to menu

Anno Accademico 2018-2019


Anno Accademico 2017-2018


Anno Accademico 2016-2017


Anno Accademico 2015-2016


Anno Accademico 2014-2015


Anno Accademico 2013-2014


Anno Accademico 2010-2011

Anno Accademico 2009-2010




adopt your own virtual pet!



Contatore siti