International/National Conferences
  1. G. Delzanno, R. Traverso. Specification and Validation of Link Reversal Routing via Graph Transformations. In 20th International SPIN Symposium on Model Checking of Software, volume 7810 of Lecture Notes in Computer Science, pages 238–249, Springer, 2013. Manuscript in PDF. GROOVE model of the Gafni-Bertsekas LRR protocol: gafni-bertsekas-lrr.gps.
  2.  G. Delzanno, R. Traverso. Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks. In 7th International Conference on Language and Automata Theory and Applications (LATA), 2013. Technical Report.
  3.  P. A. Abdulla, M. F. Atig, G. Delzanno, and A. Podelski. Pushdown Automata with Gap Order Constraints. In International Conference on Fundamentals of Software Engineering (FSEN), 2013.
  4. G. Delzanno, A. Sangnier, R. Traverso, and G. Zavattaro. On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 18 of Leibniz International Proceedings in Informatics (LIPIcs), 2012.
    Technical Report HAL, Paris 7: hal-00740518.
  5. G. Delzanno and R. Traverso. A Formal Model of Asynchronous Broadcast Communication. In Italian Conference on Theoretical Computer Science, 2012.
  6. A. Solimando, Giorgio Delzanno, G. Guerrini: Static Analysis of XML Document AdaptationsER Workshops 2012: 57-66, 2012.
  7. G. Delzanno, A. Sangnier, G. Zavattaro: Verification of Ad Hoc Networks with Node and Communication Failures. FMOODS/FORTE 2012: 235-250, 2012.
  8. N. Bertrand, G. Delzanno, B. König, A. Sangnier, J. Stückrath: On the Decidability Status of Reachability and Coverability in Graph Transformation SystemsRTA 2012: 101-116, 2012.
  9. A. Solimando, G. Delzanno, G. Guerrini: Automata-based Static Analysis of XML Document AdaptationGandALF 2012: 85-98, 2012.
  10. P. Abdulla, G. Delzanno, O. Rezine, A. Sangnier, and R. Traverso. On the Verification of Timed Ad Hoc Networks. In Proceedings of the 9th International Conference on Formal Modeling and Analysis of Timed Systems, volume 6919 of Lecture Notes in Computer Science, pages 256–270. Springer, 2011.

International Journals
  1. G. Delzanno, F. Rosa-Velardo. On Coverability and Reachability Languages of Monotonic Extensions of Petri Nets. Theor. Comput. Sci., 2013.
  2. G. Delzanno, A. Rezine: A Lightweight Regular Model Checking Approach for Parameterized SystemsSTTT 14(2): 207-222 (2012).
  3. G. Delzanno, G. Zavattaro: Reachability Problems in BioAmbientsTheor. Comput. Sci. 431: 56-74 (2012).
  4. P. A. Abdulla, G. Delzanno, L. Van Begin: A Classification of the Expressive Power of Well-structured Transition SystemsInf. Comput. 209(3): 248-279 (2011).
  5. P. A. Abdulla, G. Delzanno, A. Rezine: Automatic Verification of Directory-Based Consistency Protocols with Graph ConstraintsInt. J. Found. Comput. Sci. 22(4): 761-782 (2011).
Technical Reports
  1. G. Delzanno, A. Sangnier, R. Traverso. Parameterized Verification  of Broadcat Networks of Register Automata (Technical Report), April 2013. Manuscript in PDF.
  2.  G. Delzanno, R. Traverso.  On the Coverability Problem for Asynchronous Broadcast Networks (Extended and Revised Version), November 2012. Manuscript in PDF.
    A preliminary version (Oct. 2011) without complexity results and sketches of the undecidability proofs is available in PDF format (a 4 pages extended abstract appeared at ICTCS ’11).
  3.  P. A. Abdulla, M. F. Atig, G. Delzanno, and A. Podelski. Pushdown Automata with Gap Order Constraints.November 2012. Manuscript in PDF
  4. Giorgio Delzanno, Arnaud SangnierRiccardo TraversoGianluigi Zavattaro: The Cost of Parameterized Reachability in Mobile Ad Hoc Networks. CoRR abs/1202.5850 (2012).
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)

Comments are closed.