<style>@media screen and (max-width: 755px) { .hs-content-scroller { overflow: visible; } } </style>
ANTONIO DI STASIO
.01

ABOUT

PERSONAL DETAILS
antonio.distasio<at>unina.it
antonio<dot>distasio
Hello. I am a Phd studend Programmer Dreamer
Welcome to my Personal and Academic profile

BIO

ABOUT ME

I am currently a PhD student in Computer Science at University of Naples "Federico II" (Italy),  advised by Prof. Aniello Murano.

My research interests include: Parity Games, Game Theory, Formal Aspects of System Specification, Verification, and Synthesis.

HOBBIES

INTERESTS

Favorite Author: Murakami

Some book that i read (in Italian): Norwegian Wood, Kafka sulla Spiaggia, La Fine del Mondo e Il Paese delle Meraviglie, etc.

Favorite Series TV: Breaking Bad, Game of Thrones, Shameless, Daredevil, True Detective ( 1° Season), The Walking Dead, Mr. Robot, etc.


.02

RESUME

  • EDUCATION
  • 2011
    2015
    Naples, Italy

    Master Degree in Computer Science

    University of Naples "Federico II"

    Thesis: An Accelerated Algorithm for log-color parity games. Supervisor: Prof. Aniello Murano.
  • 2006
    2011
    Naples, Italy

    Bachelor Degree in Computer Science

    University of Naples "Federico II"

    Thesis: Studio, elaborazione ed implementazione di un algoritmo di ranking per giochi di parità. Supervisor: Prof. Aniello Murano.
  • ACADEMIC AND PROFESSIONAL POSITIONS
  • Aug-2015
    Oct-2015
    Naples, Italy

    Research Scholarship

    University of Naples "Federico II"

    Formal Methods Based on Game Theory.
.03

PUBLICATIONS

PUBLICATIONS LIST
15 Jul 2016

IMPERFECT-INFORMATION GAMES AND GENERALIZED PLANNING

SAPIENZA Università di Roma, Università di Napoli "Federico II"

We study a generalized form of planning under partial observability, in which we have multiple, possibly infinitely many, planning domains with the same actions and observations, and goals expressed over observations, which are possibly temporally extended. By building on work on two-player (non-probabilistic) games with imperfect information in the Formal Methods literature, we devise a general technique, generalizing the belief-state construction , to remove partial observability. This reduces the planning problem to a game of perfect information with a tight correspondence between plans and strategies. Then we instantiate the technique and solve some generalized-planning problems.

Conferences Planning Game Theory Chapters
Giuseppe De Giacomo, Aniello Murano, Sasha Rubin, Antonio Di Stasio
img
19 Jul 2016

SOLVING PARITY GAMES USING AN AUTOMATA-BASED ALGORITHM

Università di Napoli "Federico II", University of Oxford, Rice University

In this paper, we further contribute to this subject by implementing, for the first time, an algorithm based on alternating automata. More precisely, we consider an algorithm introduced by Kupferman and Vardi that solves a parity game by solving the emptiness problem of a corresponding alternating parity automaton. Our empirical evaluation demonstrates that this algorithm outperforms other algorithms when the game has aa small number of priorities relative to the size of the game. In many concrete applications, we do indeed end up with parity games where the number of priorities is relatively small. This makes the new algorithm quite useful in practice.

Conferences Algorithms Parity Games
Antonio Di Stasio, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi
img
10 Sep 2015

SOLVING PARITY GAMES IN SCALA

Università di Napoli "Federico II"

In this paper, we deeply revisit the implementation of the recursive algorithm introducing several improvements and making use of Scala Programming Language. These choices have been proved to be very successful, gaining up to two orders of magnitude in running time.

Conferences Formal Verification Parity Games
Antonio Di Stasio, Aniello Murano, Vincenzo Prignano, Loredana Sorrentino
img
.04

TEACHING

  • CURRENT
  • Feb 2017
    Mar 2016

    TEACHING ASSISTANT

    UNIVERSITY OF NAPLES "FEDERICO II"

    Laboratorio di Algoritmi e Strutture Dati (a.a. 2015/2016).
  • Feb 2017
    Nov 2016

    TEACHING ASSISTANT

    UNIVERSITY OF NAPLES "FEDERICO II"

    Matematica (Prof.ssa D'Apuzzo/Cavallo) Facoltà di Architettura.
  • NOW
    Mar 2017

    TEACHING ASSISTANT

    UNIVERSITY OF NAPLES "FEDERICO II"

    Laboratorio di Algoritmi e Strutture Dati (a.a. 2016/2017)