Projects

This page lists by category projects I am interested in supervising. The topics range from problems feasible for study within a Master Course, to problems to be developed as a Master Thesis.  Each topic is listed with one or more  references. These topics can be further developed for PhD Projects.

 

  • Formal Models of Trust
    a) G. Primiero, J. Boender, Negative trust for conflict resolution in software management, Journal of Web Intelligence, vol. 16, no. 4, pp. 251-271, (2018). DOI: 10.3233/WEB-180393.
    b) G.Primiero,  M. Bottone, F. Raimondi, J. Tagliabue, Trust and Distrust in Contradictory Information Transmission. Applied Network Science, 2:12. DOI: 10.1007/s41109-017-0029-0 (2017).
    c) G. Primiero, A. Martorana and J. Tagliabue, Simulation of a Trust and Reputation based Mitigation Protocol for a Black Hole Style Attack on VANETs, in 2018 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW), pp.127–135, 2018. doi:10.1109/EuroSPW.2018.00025
    d) G.Primiero, T. Chen, F. Raimondi and R. Nagarajan, A Proof-theoretic Trust and Reputation Model for VANET, in 2017 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW), IEEE 2017, DOI:10.1109/EuroSPW.2017.64.

 

  • Logics of Design
    a) G.Primiero, A Logic of Efficient and Optimal Designs, Journal of Logic and Computation (2019).

 

  • Logic and Turing Machines
    a) Boolos, Burgess, Jeffrey, Computability and Logic, ch.8
    b) Turing, A.M., “Computability and λ-Definability”, Journal of Symbolic Logic, 2(4): 153–163. doi:10.2307/2268280
    c) Dershowitz, Nachum and Yuri Gurevich, 2008, “ A Natural Axiomatization of Computability and Proof of Church’s Thesis”, Bulletin of Symbolic Logic, 14(3): 299–350.

 

  • Logic and Provability
    a) Boolos, Burgess, Jeffrey, Computability and Logic, ch.27

 

  • Proofs as Programs
    a) H.B. Curry. Functionality in combinatory logic. Proceedings of the National Academy of Sciences of the United States of America, 20(11):584–590, 1934.
    b) W. A. Howard. The formulae-as-types notion of construction. In J. P. Seldin and J. R. Hendlin, editors, Essays on Combinatory Logic, Lambda Calculus, and Formalism, pages 479–491. Academic Press, NY, 1980.
    c) N.G. de Bruijn. A survey of the project automath. In J. R. Hindley, J. P. Seldin, editor, To H.B. Curry: Essays on combinatory logic, lambda calculus and formalism, pages 579–606. Academic Press, 1980.

 

  • Theory of Algorithms
    a) Y. Gurevich. What is an algorithm? In M. Bieliková, G. Friedrich, G. Gottlob, S. Katzenbeisser, and G. Turán, editors, SOFSEM 2012: Theory and Practice of Computer Science – 38th Conference on Current Trends in Theory and Practice of Computer Science, volume 7147 of Lecture Notes in Computer Science, pages 31–42. Springer, 2012.  doi: 10.1007/978-3-642-27660-6/ 3.
    b) Y.N. Moschovakis. What is an algorithm? In B. Engquist and W. Schmid, editors, Mathematics Unlimited — 2001 and beyond, pages 919–936. Springer, 2001, (Part II). April 24, 2001.

 

  • Correctness
    a) C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576–580, 1969.
    b) E.W. Dijkstra. Correctness concerns and, among other things, why they are resented. In Proceedings of the 1975 International Conference on Reliable Software, pages 546–550. ACM SIGPLAN Notices, Los Angeles, California U.S.A, April 1975.
    c) P.W. O’Hearn and D.J. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5:02, 1999.
    d) B. Cantwell Smith. The limits of correctness. In R. Kling, editor, Computerization and Controversy, pages 18–26. ACM SIGCAS Computers and Society, 2nd edition, Morgan Kaufmann, Academic Press, San Diego, 1996.
    e) R.L. De Millo, R.J. Lipton, and A.J. Perlis. Social processes and proofs of theorems and programs. Communications of the ACM, 22(5):271–281, 1979.
    f) S. Bringsjord. A vindication of program verification. History & Philosophy of Logic, 36(3):262–277, 2015.

 

  • Abstraction, Specification and Implementation
    a) T. Colburn and G. Shute. Abstraction in computer science. Minds & Machines, 17:169–184, 2007.
    b) W.J. Rapaport. Implementation is semantic interpretation. The Monist, 82(1):109–130, 1999.
    c) R. Turner, 2011, Specification, Minds and Machines, 21(2): 135–152. doi:10.1007/s11023-011-9239-x

 

  • Miscomputation
    a) N.Fresco, G.Primiero, Miscomputation, Philosophy & Technology, vol. 26(3), pp.253–272, 2013. DOI: 10.1007/s13347-013-0112-0.
    b) L. Floridi, N. Fresco, G.Primiero, On malfunctioning software. Synthese, vol. 192, pp. 1199-1220 (2015).
    c) Primiero, G., Solheim, F.J. & Spring, J.M., On Malfunction, Mechanisms and Malware Classification, Philosophy & Technology. (2018). https://doi.org/10.1007/s13347-018-0334-2
    d) S.Kramer, J.C. Bradfield, A general definition of malware, Journal of Computer Virology (2010) 6: 105. https://doi.org/10.1007/s11416-009-0137-1

 

  • Logic and Information
    a) L. Floridi, The Logic of Being Informed, Logique Et Analyse 49 (2006)
    b) G.Primiero, An Epistemic Logic for Becoming Informed, Synthese, 167:2, pp.363-389, 2009.
    c) M. D’Agostino, 2015a. “An informational view of classical logic”. In: Theoretical Computer Science 606, pp. 79–97. doi: http://dx.doi.org/10.1016/j.tcs. 2015.06.057.

 

  • Computational Modelling
    a) E. Winsberg, Computer Simulation and the Philosophy of Science, https://doi.org/10.1111/j.1747-9991.2009.00236.x
    b) Grüne-Yanoff, T., & Weirich, P. (2010). The Philosophy and Epistemology of Simulation: A Review. Simulation & Gaming41(1), 20–50. https://doi.org/10.1177/1046878109353470
    c) G. Primiero, A Minimalist Epistemology for Agent‑Based Simulations in the Artificial Sciences, Minds & Machines. (2019). https://doi.org/10.1007/s11023-019-09489-4

 

  • Modal Logic and Multi-Agent Systems
    a) M.Huth, M.Ryan, Logic in Computer Science, CUP 2004, ch. 5
    b) W. van der Hoek, M. Wooldridge, Logics for Multi-Agent Systems, AI Magazine
    c) G.Primiero,  M. Bottone, F. Raimondi, J. Tagliabue, Trust and Distrust in Contradictory Information Transmission. Applied Network Science, 2:12. DOI: 10.1007/s41109-017-0029-0 (2017).
    d) https://github.com/erohkohl/mlsolver
    e) https://github.com/Sowms/MuddyChildren
    f) https://github.com/svarogdaal/simple-decision-game