• Non ci sono risultati.

Ph. D. in Computer Science (XVII Ciclo) 2nd Year Report: Performed Activities

N/A
N/A
Protected

Academic year: 2021

Condividi "Ph. D. in Computer Science (XVII Ciclo) 2nd Year Report: Performed Activities"

Copied!
3
0
0

Testo completo

(1)

Ph. D. in Computer Science (XVII Ciclo) 2nd Year Report: Performed Activities

Damiano Macedonio

Dipartimento di Informatica, Universit`a Ca’ Foscari di Venezia via Torino 155, 30172 Venezia, Italy

mace@dsi.unive.it

Talks and Courses

December 5, 2002. Venice. Presentation at Department of Computer Sci- ence: Secure Contexts for Confidential Data, joint work with A. Bossi, C.

Piazza, and S. Rossi.

January 30, 2003. Venice. Presentation at Department of Computer Science:

Synchronization Methods on Distributed Simulation, final exam of the course Simulazione by S.Balsamo.

February 20, 2003. Venice. Presentation at Department of Computer Sci- ence: Shape Analysis for Mobile Ambients (by H.R. Nielson and F. Nielson), final exam of the course Analisi e Verifica di Programmi by A.Cortesi.

April 6, 2003. Warsaw. Presentation at Workshop on Issues in the Theory of Security (WITS’03) April 5 - 6, 2003: Secure Contexts, joint work with A.

Bossi, C. Piazza, and S. Rossi.

May 16, 2003. Milan. Presentation at Department of Computer Science: Con- trol Methods for Resource Access, final exam of the course Access Control Models (BISS02) by E.Bertino.

June 5, 2003. Brighton. Presentation at project meeting of MyThs June 5 - 6, 2003: Secure Contexts for Confidential Data.

September 1-27, 2003. Pisa. Attendance at First advance School on Mobile Computing, organized by Scuola Normale Superiore di Pisa and List Group.

October 1, 2003. Brighton. Beginning of my 6 mounts studentship at Uni- versity of Sussex (UK) visiting V. Sassone.

October 13, 2003. Bertinoro. Presentation at Eighth Italian Conference on Theoretical Computer Science (ICTCS’03) 13-15 October 2003: Information Flow Security and Recursive Systems, joint work with A. Bossi, C. Piazza, and S. Rossi.

Exams

I have attended and passed all the exams included in my study workplan.

Fault-tolerance in Distributed Applications (D. Dolev), BISS2002.

Passed, June 6, 2002.

(2)

Concurrency, Types and Categories (U. Montanari), BISS2002.

Passed, August 31, 2002.

Simulazione (S. Balsamo, L. Donatiello), Venice.

Passed, January 30, 2002.

Analisi e Verifica di Programmi (A.Cortesi), Venice.

Passed, February 20, 2003.

Access Control Models (E. Bertino), BISS2002.

Passed May 16, 2003.

First Advanced School on Mobile Computing , Pisa.

The school was four weeks long and it offered two courses of 10 hours each per week. Every course provided a final assessment. I attended all the as- sessments.

I.F. Akyildiz (Georgia Institute of Technology, U.S.A.) A Journey Through Research Challenges for Next Generation Wireless Systems.

F. Stajano (University of Cambridge, U.K.) Security for Ubiquitous Com- puting.

D. Sangiorgi (Universit`a di Bologna, Italy) Models and Calculi for Mobil- ity.

F.B. Schneider (Cornell University, U.S.A.) Excursion To Two New Fron- tiers In Computer Security Research.

G.P. Picco (Politecnico di Milano, Italy) An Introduction to Logical and Physical Mobility.

A. Murphy (University of Rochester, U.S.A.) Software Development for Mobile Environments.

M. Gerla (UCLA, U.S.A.) Ad Hoc Wireless Networks: Protocols and Ap- plications.

P. Lee (Carnegie Mellon University, U.S.A.) Certified Code for Mobile Com- puting.

Publications

Conference Proceedings

– A. Bossi, D. Macedonio, C. Piazza, and S. Rossi. Secure Contexts (Extended Abstract). In Electronic Proceedings of the Workshop on Issue in the Theory of Security (WITS’03), April 2003.

– A. Bossi, D. Macedonio, C. Piazza, S. Rossi. Secure Contexts for Confidential Data. In Proc. of the 16th IEEE Computer Security Foundations Workshop (CSFW ’03), September 2003.

– A. Bossi, D. Macedonio, C. Piazza, and S. Rossi. Information Flow Security and Recursive Systems. In Proc. of the Italian Conference on Theoretical Computer Science (ICTCS ’03). October 2003.

(3)

Technical Reports

– A. Bossi, D. Macedonio, C. Piazza, and S. Rossi. Secure Contexts for Infor- mation Flow Security. Technical Report CS-2002-18, Dipartimento di Infor- matica, Universit`a Ca’ Foscari di Venezia, December 2002. Extended version of the paper that has appeared in Proc. WITS’03.

– A. Bossi, D. Macedonio, C. Piazza, and S. Rossi. P BNDC and Replica- tion. Technical Report CS-2003-6, Dipartimento di Informatica, Universit`a Ca’ Foscari di Venezia, April 2003. Extended version of the paper that has appeared in Proc. ICTCS’03

– A. Bossi, D. Macedonio, C. Piazza, and S. Rossi Compositional Action Re- finement and Information Flow Security. Technical Report CS-2003-13, Di- partimento di Informatica, Universit`a Ca’ Foscari di Venezia, August 2003.

Riferimenti

Documenti correlati

Basically, our approach transforms the tree automaton A Γ into a weighted tree automaton working on infinite trees, 2 whose so-called behaviour yields a pinpointing formula, i.e.,

Examples of challenging real financial time series will be given and we will show how to use the simulation methodology offered by a variety of software agents optimized by a GA

This year the 9th International Conference on Computer Engineering and Applications (CEA '15) was held in Dubai, United Arab Emirates, February 22-24, 2015. The conference provided a

● Abduction then emerges as an important computational paradigm that would be needed for certain problem solving tasks within a declarative representation of the problem

Automatic Inductive and Analogical Reasoning on Concept Networks: a Forensic Application. Candidate: Fabio Leuzzi –

Essi contengono materiale originale di proprietà dell'Università degli Studi di Bari e/o figure di proprietà di altri autori, società e organizzazioni di cui e' riportato

● Control unit (also known as CU) reads data from the instruction memory and data executes the instructions and copies the results to memory or

Our main results are as follows: (a) exponential memory is sufficient and may be necessary for winning strategies in energy parity games; (b) the problem of deciding the winner