RANZATO, FRANCESCO
 Distribuzione geografica
Continente #
NA - Nord America 5.158
EU - Europa 626
AS - Asia 328
OC - Oceania 4
Totale 6.116
Nazione #
US - Stati Uniti d'America 5.154
IT - Italia 241
CN - Cina 161
VN - Vietnam 101
FI - Finlandia 96
UA - Ucraina 92
DE - Germania 79
IN - India 55
GB - Regno Unito 45
SE - Svezia 24
HR - Croazia 16
FR - Francia 12
IE - Irlanda 9
PH - Filippine 5
CA - Canada 4
NZ - Nuova Zelanda 3
BE - Belgio 2
CZ - Repubblica Ceca 2
EE - Estonia 2
IR - Iran 2
JP - Giappone 2
NO - Norvegia 2
PT - Portogallo 2
AE - Emirati Arabi Uniti 1
AU - Australia 1
BG - Bulgaria 1
SG - Singapore 1
SI - Slovenia 1
Totale 6.116
Città #
Fairfield 905
Woodbridge 802
Houston 505
Ann Arbor 467
Ashburn 375
Jacksonville 363
Seattle 322
Wilmington 315
Cambridge 296
Chandler 129
Princeton 121
Dong Ket 101
San Diego 78
Medford 66
Pune 50
Padova 49
Nanjing 45
Helsinki 33
Des Moines 25
New York 20
Boardman 18
Milan 18
Shenyang 16
Nanchang 15
Roxbury 15
Hebei 14
London 12
Tianjin 12
Brendola 10
Indiana 10
Palermo 10
Dublin 9
Jinan 9
Norwalk 9
Guangzhou 8
Karlsruhe 8
Jiaxing 7
Changsha 6
Chioggia 6
Ningbo 6
Taizhou 6
Zhengzhou 6
Kharkiv 5
Rome 5
Bologna 4
Brescia 4
Ogden 4
Phoenix 4
Rockville 4
San Francisco 4
Vicenza 4
Yellow Springs 4
Albignasego 3
Bagnoli Di Sopra 3
Falls Church 3
Fiesso d'Artico 3
Hounslow 3
Islington 3
Montpellier 3
Olongapo City 3
Paris 3
Rodgau 3
Sant'Elia Fiumerapido 3
Taiedo 3
Treviso 3
Venice 3
Verona 3
Ahmedabad 2
Altavilla Silentina 2
Atlanta 2
Auckland 2
Beijing 2
Borås 2
Catania 2
Chiswick 2
Croydon 2
Florence 2
Genoa 2
Gessate 2
Keila 2
Kilburn 2
Leuven 2
Linköping 2
Lünen 2
Monselice 2
Mumbai 2
Namest nad Oslavou 2
Orange 2
Parede 2
Patti 2
Poplar 2
Roncade 2
San Bonifacio 2
Tokyo 2
Trebaseleghe 2
Trevignano 2
Udine 2
Wiesbaden 2
Abano Terme 1
Bari 1
Totale 5.448
Nome #
Appunti di Programmazione ad Oggetti 156
Complementing logic program semantics 126
Abstracting Nash equilibria of supermodular games 121
Some properties of complete congruence lattices 120
Weak relative pseudo-complements of closure operators 114
A unifying view of abstract domain design 110
A new efficient simulation equivalence algorithm 110
Building complete abstract interpretations in a linear logic-based setting 109
An abstract interpretation-based model of tracing just-in-time compilation 109
Closures on CPOs form complete lattices 108
Making abstract model checking strongly preserving 107
Saving space in a time efficient simulation algorithm 105
Refining and compressing abstract domains 103
Analyzing program analyses 100
Pseudocomplements of closure operators on posets 98
Static analysis, abstract interpretation and verification in (constraint logic) programming 97
Complete abstract interpretations made constructive 96
A forward-backward abstraction refinement algorithm 95
The reduced relative power operation on abstract domains 95
Strong preservation as completeness in abstract interpretation 95
States vs. traces in model checking by abstract interpretation 94
An abstract interpretation perspective on linear vs. branching time 94
Tracing compilation by abstract interpretation 92
On constructivity of galois connections 91
Making abstract domains condensing 90
Complementation in abstract interpretation 90
Incompleteness of states w.r.t. traces in model checking 89
On the least complete extension of complete subsemilattices 88
Example-guided abstraction simplification 88
Saving space in a time efficient simulation algorithm 88
Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions 88
Program analysis is harder than verification: A computability perspective 88
Probabilistic bisimulation and simulation algorithms by abstract interpretation 86
An abstract interpretation-based refinement algorithm for strong preservation 85
Optimal domains for disjunctive abstract interpretation 84
Generalized strong preservation by abstract interpretation. 84
Compositional optimization of disjunctive abstract interpretations 83
Computing stuttering simulations 83
Making abstract interpretations complete 82
A more efficient simulation algorithm on Kripke structures 82
Completeness in abstract interpretation: a domain perspective 81
Generalizing the Paige-Tarjan algorithm by abstract interpretation 80
Uniform closures: order-theoretically reconstructing logic program semantics and abstract domain refinements 80
Robustness Verification of Support Vector Machines 78
Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation 76
An efficient simulation algorithm on Kripke structures 76
Abstract interpretation of supermodular games 75
The powerset operator on abstract interpretations 74
Complementation in abstract interpretation 74
On the completeness of model checking 73
Invertible Linear Transforms of Numerical Abstract Domains 71
Language Inclusion Algorithms as Complete Abstract Interpretations 71
Correction to "Some properties of complete congruence lattices" 69
A²I: abstract² interpretation 69
Abstract interpretation of decision tree ensemble classifiers 69
Correctness kernels of abstract interpretations 68
Foreword to the special issue on the 2017 Static Analysis Symposium 66
Building Complete Abstract Interpretations in a Linear Logic-based Setting 64
Functional dependencies and Moore-set completions of abstract interpretations and semantics 63
A spectrum of behavioral relations over LTSs on probability distributions 63
Complete Abstractions Everywhere 62
An efficient simulation algorithm based on abstract interpretation 60
The Subgraph Similarity Problem 60
Strong preservation of temporal fixpoint-based operators by abstract interpretation 59
A time and space efficient simulation algorithm 52
Complementation of abstract domains made easy 44
Improving abstract interpretations by systematic lifting to the powerset 42
A Rice’s Theorem for Abstract Semantics 37
A new characterization of complete Heyting and co-Heyting algebras 33
Improving Abstract Interpretations by Systematic Lifting to the Powerset 33
CPOs as Concrete Domains: Lattices of Abstract Domains and Complements 30
A Logic for Locally Complete Abstract Interpretations 30
Complete Abstractions for Checking Language Inclusion 26
History of Abstract Interpretation 25
Genetic adversarial training of decision trees 24
A counterexample to a result concerning closure operators 23
Optimization of Disjunctive Abstract Interpretations 22
Fairness-Aware Training of Decision Trees by Abstract Interpretation 21
A Constructive Framework for Galois Connections 19
Preface SAS 2017 17
Robustness Verification of Decision Tree Ensembles 16
Inclusion Testing of Büchi Automata Based on Well-Quasiorders 15
Static Analysis: 24th International Symposium, SAS 2017 New York, NY, USA, august 30 - september 1, 2017 Proceedings 13
Tracing compilation by abstract interpretation 11
Abstract interpretation repair 11
Local Completeness Logic on Kleene Algebra with Tests 9
Decidability and Synthesis of Abstract Inductive Invariants 9
Intensional Kleene and Rice theorems for abstract program semantics 8
Abstract Interpretation-based Feature Importance for Support Vector Machines - Artifact 7
Abstract Interpretation-Based Feature Importance for Support Vector Machines 6
A Correctness and Incorrectness Program Logic 5
Local Completeness in Abstract Interpretation 4
Analyzing program analyses 1
Robustness Certification of k-Nearest Neighbors 1
Totale 6.198
Categoria #
all - tutte 21.117
article - articoli 8.234
book - libri 261
conference - conferenze 0
curatela - curatele 149
other - altro 169
patent - brevetti 0
selected - selezionate 0
volume - volumi 529
Totale 30.459


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019615 0 0 0 0 0 0 0 0 6 120 244 245
2019/20201.380 185 54 20 112 167 144 144 177 157 108 42 70
2020/2021899 40 73 32 89 34 65 14 92 172 62 92 134
2021/20221.149 28 112 225 63 47 66 46 165 59 24 129 185
2022/2023496 154 2 3 31 79 59 3 30 57 15 46 17
2023/2024373 19 40 47 81 27 94 25 26 14 0 0 0
Totale 6.198