Silvia Crafa

logo Pd
Dipartimento di Matematica Pura e Applicata
Università di Padova
Via Trieste 63, 35121 Padova, Italy

Phone: +39-049-827.1490
Fax: +39-049-827.1499
Email:
   


Research  Interests

   True Concurrency.
   Mobile Concurrent Systems: semantics, type systems, security issues.
   Types for Object Oriented Languages.


Didattica

          Linguaggi Di Programmazione Avanzati



Journal Papers


  • Typed Interpretations of Extensible Objects.
    • V. Bono, M. Bugliesi and S. Crafa.
    ACM Transactions on Computational Logic 3(4) 562-603, August 2002.

  • Access Control for Mobile Agents: the Calculus of Boxed Ambients.
    • M. Bugliesi, G. Castagna, S. Crafa.
    ACM Transactions on Programming Languages and Systems 26(1):57-124, Jan. 2004.

  • Communication and Mobility Control in Boxed Ambients.
    • M. Bugliesi, S. Crafa, M. Merro and V. Sassone.
    Information and Computation 202 (2005):39-86.

  • Controlling Information Release in the pi-calculus.
    • S. Crafa and S. Rossi.
    Information and Computation 205 (2007):1235-1273.

  • A Type System for Discretionary Access Control.
    • M.Bugliesi, D. Colazzo, S. Crafa, and D. Macedonio.
    Mathematical Structures in Computer Science, 19(4): 839-875 (2009)

  • Saving space in a time efficient simulation algorithm.
    • S. Crafa, F. Ranzato and F.Tapparo.
    Fundamenta Informaticae, 108(1-2):23-42,2011.

  • Bisimulation and Simulation Algorithms on Probabilistic Transition Systems by Abstract Interpretation.
    • S. Crafa and F. Ranzato.
    Formal Methods in System Design. Volume 40(3):356-376 (2012)



    Conference Papers


  • Event Structure Semantics of Parallel Extrusion in the Pi-calculus.
    • S. Crafa, D. Varacca and N. Yoshida.
    FoSSaCS'12 - 15th International Conference on Foundations of Software Science and Computation Structures Tallin, Estonia. LNCS, Springer, 2012

  • A spectrum of behavioral relations over LTSs on probability distributions.
    • S. Crafa, F. Ranzato.
    CONCUR'11 - 22nd International Conference on Concurrency Theory Aachen, Germany. LNCS vol. 6901, pages 124-139, Springer, 2011

  • Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation
    • S. Crafa, F. Ranzato.
    ICALP'11 - 38th International Colloquium on Automata, Languages, and Programming Zurich, Switzerland. LNCS n.6756, pag 295-306, Springer, 2011.

  • A logic for true concurrency
    • P. Baldan, S. Crafa.
    CONCUR'10 - Concurrency Theory. LNCS 6269, pag 147-161, Sept. 2010.[Slides.pptx] [Slides.pdf]

  • Saving space in a time efficient simulation algorithm
    • S. Crafa, F. Ranzato, and F. Tapparo.
    In Proc. of the 9th Int. Conf. on Application of Concurrency to System Design (ACSD'09), pag 60-69. IEEE Press. Augsburg, Germany, 2009.

  • Compositional Event Structure Semantics for the Internal pi-calculus
    • S. Crafa, D. Varacca, N. Yoshida.
    CONCUR'07 - Concurrency Theory. LNCS 4703, pag 317-332, Sept 2007.

  • P-Congruences as Noninterference for the pi-calculus.
    • S. Crafa and S. Rossi.
    Proc. of the 4th ACM Workshop on Formal Methods in Security Engineering, FMSE 2006. ACM Press pag 13-22. [Slides]

  • A Theory of Noninterference for the pi-calculus.
    • S. Crafa and S. Rossi.
    Proc. of the Symposium on Trustworthy Global Computing, TGC 2005, LNCS 3705, pag. 2-18, 2005.

  • Type Based Discretionary Access Control
    • M. Bugliesi, D. Colazzo, S. Crafa.
    CONCUR'04 - Concurrency Theory. LNCS n.3170, pages 225-239, Sept 2004.[Slides]

  • Secrecy in Untrusted Networks
    • M. Bugliesi, S. Crafa, A. Prelic and V. Sassone.
    ICALP'03. LNCS n.2719, pages 969-983, July 2003.

  • Communication Interference in Mobile Boxed Ambients
    • M.Bugliesi, S. Crafa, M. Merro and V. Sassone.
    In FSTTCS 2002. LNCS n.2556, pages 71-84, Dec. 2002

  • Information Flow Security in Boxed Ambients.
    • S. Crafa, M.Bugliesi and G. Castagna.
    In FWAN: Int. Workshop on Found. of WAN Computing, ENTCS, 66 (3). Elsevier, 2002.

  • Boxed Ambients.
    • M.Bugliesi, G. Castagna and S. Crafa.
    In TACS 2001, LNCS n. 2215, pages 38-63, Springer 2001.

  • Reasoning about security in Mobile Ambients.
    • M.Bugliesi, G. Castagna and S. Crafa.
    In CONCUR 2001, LNCS n. 2154, pages 102-120, Springer 2001.

  • Matching and Subtyping for Mobile Objects.
    • M.Bugliesi, G. Castagna and S. Crafa.
    In ICTCS '01, LNCS n. 2202, pages 235--255

  • Typed Mobile Objects.
    • Michele Bugliesi, Giuseppe Castagna and  Silvia Crafa.
    In C.Palamidessi ed. Proc. CONCUR2000, volume 1877 of LNCS, pages 504-520 Springer,2000.

  • Object Calculi with Dynamic Messages.
    • M. Bugliesi and Silvia Crafa.
    FOOL'6 Proc. of the 6th Int. Workshop on Foundations of OO Languages. Electronic Proceedings.


    Software

    PicNIc: a tool for verifying non-interference properties of processes in the Pi-calculs.
  • PicNIc Web Page
  • PicNic - Pi-calculus Non-Interference checker. (Tool paper)
    • S. Crafa, M. Mio, M. Miculan, C. Piazza, and S. Rossi.
    Proc. of the 8th International Conference on Application of Concurrency to System Design (ACSD'08), pag. 33-38, IEEE Press, 2008.


    Ph D Thesis

    Models and Types for Wide Area Computing: The calculus of Boxed Ambients
    Dottorato di Ricerca in Informatica del consorzio delle Universita' di Bologna, Padova, Venezia.
    Winner of the award for the two best italian PhD theses in theoretical computer science in the year 2003,
    assigned by the Italian Chapter of the European Association for Theoretical Computer Science.






    canova6


    canova4