M. Gabbrielli; M.C. Meo, A compositional semantics for CHR, «ACM TRANSACTIONS ON COMPUTATIONAL LOGIC», 2009, 10(2), pp. ? - ? [Scientific article]
C. Di Giusto; M. Gabbrielli, Full abstraction for Linda, in: Proceedings of the European Symposium on Programming (ESOP08), BERLIN, Springer Verlag, 2008, LNCS 4960, pp. 78 - 92 (atti di: European Symposium on Programming (ESOP08), Budapest, 2008) [Contribution to conference proceedings]
P. Tacchella; M. Gabbrielli; M.C. Meo, Unfolding in CHR, in: Proceedings of the PPDP International conference, NEW YORK, ACM Press, 2007, pp. 179 - 186 (atti di: Principles and Practice of Declarative Programming (PPDP), Wroclaw (Poland), July 2007) [Contribution to conference proceedings]
M. Gabbrielli; S. Martini, Linguaggi di programmazione, MILANO, McGraw-Hill Italia, 2006, pp. 458 . [Research monograph]
G.Delzanno|; M.Gabbrielli|; M.C. Meo, A compositional semantics for CHR., in: Proceedings of PPDP, NEW YORK, ACM Press, 2005, pp. ? - ? (atti di: Principles and practice of declarative programming, Lisboa, 2005) [Contribution to conference proceedings]
G. Delzanno; M. Gabbrielli, Compositional Verification of Asynchronous Processes via Constraint Solving, in: Proceedings of ICALP 2005, HEIDELBERG, Springer-Verlag, 2005, LNCS 3580, pp. 1239 - 1250 (atti di: ICALP, Lisboa, 2005) [Contribution to conference proceedings]
M. Gabbrielli; G. Gupta (eds.), Proceedings of the 21st International Conference on Logic Programming, HEIDELBERG, Springer-Verlag, 2005, pp. 454 (Lecture Notes in Computer Science). [Research monograph]
F.S. de Boer; M. Gabbrielli; M.C. Meo., A Timed Linda Language
and its Denotational Semantics., «FUNDAMENTA INFORMATICAE», 2004, 63 (4), pp. ? - ? [Scientific article]
N. BUSI; GABBRIELLI M.; G. ZAVATTARO, Comparing Recursion, Replication, and Iteration in Process Calculi, in: Proceedings of ICALP 2004, BERLINO, Springer-Verlag, 2004, LNCS 3142, pp. 307 - 319 (atti di: ICALP 04, Finlandia, 2004) [Contribution to conference proceedings]
DE BOER F; GABBRIELLI M.; MEO M.C., Proving Correctness of Timed Concurrent Constraint Programs, «ACM TRANSACTIONS ON COMPUTATIONAL LOGIC», 2004, 5(4), pp. xx - yy [Scientific article]
