�ݺ�ߣshows by User: GianlucaAmato

�ݺ�ߣshows by User: GianlucaAmato / http://www.slideshare.net/images/logo.gif �ݺ�ߣshows by User: GianlucaAmato / Mon, 04 Nov 2019 11:48:24 GMT �ݺ�ߣShare feed for �ݺ�ߣshows by User: GianlucaAmato Dal percettrone ad AlphaGo (e SAI) /slideshow/dal-percettrone-ad-alphago-e-sai/190296320 devfest-191104114824
GDG DevFest 2019 Pescara]]>
GDG DevFest 2019 Pescara]]> Mon, 04 Nov 2019 11:48:24 GMT /slideshow/dal-percettrone-ad-alphago-e-sai/190296320 GianlucaAmato@slideshare.net(GianlucaAmato) Dal percettrone ad AlphaGo (e SAI) GianlucaAmato GDG DevFest 2019 Pescara <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/devfest-191104114824-thumbnail.jpg?width=120&height=120&fit=bounds" /><br> GDG DevFest 2019 Pescara

Dal percettrone ad AlphaGo (e SAI) from Gianluca Amato

]]> 93 1 https://cdn.slidesharecdn.com/ss_thumbnails/devfest-191104114824-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 NFM 2015 - Sum of abstract domains /slideshow/nfm-2015-sum-of-abstract-domains/52651236 nfm2015-150910232202-lva1-app6892
In the abstract interpretation theory, program properties are encoded by abstract domains, and the combination of abstract domains leads to new properties to be analyzed. We propose a new method to combine numerical abstract domains based on the Minkowski sum. We provide a general framework equipped with all the necessary abstract operators for static analysis of imperative languages. ]]>
In the abstract interpretation theory, program properties are encoded by abstract domains, and the combination of abstract domains leads to new properties to be analyzed. We propose a new method to combine numerical abstract domains based on the Minkowski sum. We provide a general framework equipped with all the necessary abstract operators for static analysis of imperative languages. ]]> Thu, 10 Sep 2015 23:22:02 GMT /slideshow/nfm-2015-sum-of-abstract-domains/52651236 GianlucaAmato@slideshare.net(GianlucaAmato) NFM 2015 - Sum of abstract domains GianlucaAmato In the abstract interpretation theory, program properties are encoded by abstract domains, and the combination of abstract domains leads to new properties to be analyzed. We propose a new method to combine numerical abstract domains based on the Minkowski sum. We provide a general framework equipped with all the necessary abstract operators for static analysis of imperative languages. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/nfm2015-150910232202-lva1-app6892-thumbnail.jpg?width=120&height=120&fit=bounds" /><br> In the abstract interpretation theory, program properties are encoded by abstract domains, and the combination of abstract domains leads to new properties to be analyzed. We propose a new method to combine numerical abstract domains based on the Minkowski sum. We provide a general framework equipped with all the necessary abstract operators for static analysis of imperative languages.

NFM 2015 - Sum of abstract domains from Gianluca Amato

]]> 352 7 https://cdn.slidesharecdn.com/ss_thumbnails/nfm2015-150910232202-lva1-app6892-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 FM 2015 - Narrowing operators on template abstract domains /slideshow/fm2015-narrowing-operators-on-template-abstract-domains/52651123 fm2015-150910231407-lva1-app6891
In the theory of abstract interpretation, a descending phase may be used to improve the precision of the analysis after a post-fixpoint has been reached. Termination is often guaranteed by using narrowing operators. This is especially true on numerical domains, since they are generally endowed with infinite descending chains which may lead to a non-terminating descending phase in the absence of narrowing. We provide an abstract semantics which improves the analysis precision and shows that, for a large class of numerical abstract domains over integer variables (such as intervals, octagons and template polyhedra), it is possible to avoid infinite descending chains and omit narrowing. Moreover, we propose a new family of narrowing operators for real variables which improves the analysis precision. ]]>
In the theory of abstract interpretation, a descending phase may be used to improve the precision of the analysis after a post-fixpoint has been reached. Termination is often guaranteed by using narrowing operators. This is especially true on numerical domains, since they are generally endowed with infinite descending chains which may lead to a non-terminating descending phase in the absence of narrowing. We provide an abstract semantics which improves the analysis precision and shows that, for a large class of numerical abstract domains over integer variables (such as intervals, octagons and template polyhedra), it is possible to avoid infinite descending chains and omit narrowing. Moreover, we propose a new family of narrowing operators for real variables which improves the analysis precision. ]]> Thu, 10 Sep 2015 23:14:07 GMT /slideshow/fm2015-narrowing-operators-on-template-abstract-domains/52651123 GianlucaAmato@slideshare.net(GianlucaAmato) FM 2015 - Narrowing operators on template abstract domains GianlucaAmato In the theory of abstract interpretation, a descending phase may be used to improve the precision of the analysis after a post-fixpoint has been reached. Termination is often guaranteed by using narrowing operators. This is especially true on numerical domains, since they are generally endowed with infinite descending chains which may lead to a non-terminating descending phase in the absence of narrowing. We provide an abstract semantics which improves the analysis precision and shows that, for a large class of numerical abstract domains over integer variables (such as intervals, octagons and template polyhedra), it is possible to avoid infinite descending chains and omit narrowing. Moreover, we propose a new family of narrowing operators for real variables which improves the analysis precision. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/fm2015-150910231407-lva1-app6891-thumbnail.jpg?width=120&height=120&fit=bounds" /><br> In the theory of abstract interpretation, a descending phase may be used to improve the precision of the analysis after a post-fixpoint has been reached. Termination is often guaranteed by using narrowing operators. This is especially true on numerical domains, since they are generally endowed with infinite descending chains which may lead to a non-terminating descending phase in the absence of narrowing. We provide an abstract semantics which improves the analysis precision and shows that, for a large class of numerical abstract domains over integer variables (such as intervals, octagons and template polyhedra), it is possible to avoid infinite descending chains and omit narrowing. Moreover, we propose a new family of narrowing operators for real variables which improves the analysis precision.

FM 2015 - Narrowing operators on template abstract domains from Gianluca Amato

]]> 342 7 https://cdn.slidesharecdn.com/ss_thumbnails/fm2015-150910231407-lva1-app6891-thumbnail.jpg?width=120&height=120&fit=bounds presentation White http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 ICTCS 2015 - Exploiting linearity in sharing analysis of object-oriented programs /slideshow/exploiting-linearity-in-sharing-analysis-of-objectoriented-programs/52650984 ictcs2015-150910230855-lva1-app6892
We propose a new sharing analysis of object-oriented programs based on abstract interpretation. Two variables share when they are bound to data structures which overlap. We show that sharing analysis can greatly benefit from linearity analysis. We propose a combined domain including aliasing, linearity and sharing information. We use a graph-based representation of aliasing information which naturally encodes sharing and linearity information, and define all the necessary operators for the analysis of a Java-like language. ]]>
We propose a new sharing analysis of object-oriented programs based on abstract interpretation. Two variables share when they are bound to data structures which overlap. We show that sharing analysis can greatly benefit from linearity analysis. We propose a combined domain including aliasing, linearity and sharing information. We use a graph-based representation of aliasing information which naturally encodes sharing and linearity information, and define all the necessary operators for the analysis of a Java-like language. ]]> Thu, 10 Sep 2015 23:08:54 GMT /slideshow/exploiting-linearity-in-sharing-analysis-of-objectoriented-programs/52650984 GianlucaAmato@slideshare.net(GianlucaAmato) ICTCS 2015 - Exploiting linearity in sharing analysis of object-oriented programs GianlucaAmato We propose a new sharing analysis of object-oriented programs based on abstract interpretation. Two variables share when they are bound to data structures which overlap. We show that sharing analysis can greatly benefit from linearity analysis. We propose a combined domain including aliasing, linearity and sharing information. We use a graph-based representation of aliasing information which naturally encodes sharing and linearity information, and define all the necessary operators for the analysis of a Java-like language. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/ictcs2015-150910230855-lva1-app6892-thumbnail.jpg?width=120&height=120&fit=bounds" /><br> We propose a new sharing analysis of object-oriented programs based on abstract interpretation. Two variables share when they are bound to data structures which overlap. We show that sharing analysis can greatly benefit from linearity analysis. We propose a combined domain including aliasing, linearity and sharing information. We use a graph-based representation of aliasing information which naturally encodes sharing and linearity information, and define all the necessary operators for the analysis of a Java-like language.

ICTCS 2015 - Exploiting linearity in sharing analysis of object-oriented programs from Gianluca Amato

]]> 139 7 https://cdn.slidesharecdn.com/ss_thumbnails/ictcs2015-150910230855-lva1-app6892-thumbnail.jpg?width=120&height=120&fit=bounds presentation White http://activitystrea.ms/schema/1.0/post

http://activitystrea.ms/schema/1.0/posted

0 https://cdn.slidesharecdn.com/profile-photo-GianlucaAmato-48x48.jpg?cb=1572868044 https://cdn.slidesharecdn.com/ss_thumbnails/devfest-191104114824-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/dal-percettrone-ad-alphago-e-sai/190296320 Dal percettrone ad Alp... https://cdn.slidesharecdn.com/ss_thumbnails/nfm2015-150910232202-lva1-app6892-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/nfm-2015-sum-of-abstract-domains/52651236 NFM 2015 - Sum of abst... https://cdn.slidesharecdn.com/ss_thumbnails/fm2015-150910231407-lva1-app6891-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/fm2015-narrowing-operators-on-template-abstract-domains/52651123 FM 2015 - Narrowing op...