RANZATO, FRANCESCO
 Distribuzione geografica
Continente #
NA - Nord America 4905
EU - Europa 430
AS - Asia 254
Totale 5589
Nazione #
US - Stati Uniti d'America 4902
CN - Cina 153
VN - Vietnam 101
IT - Italia 100
FI - Finlandia 95
UA - Ucraina 91
DE - Germania 71
SE - Svezia 22
GB - Regno Unito 17
HR - Croazia 16
IE - Irlanda 9
FR - Francia 5
CA - Canada 3
NO - Norvegia 2
BG - Bulgaria 1
SI - Slovenia 1
Totale 5589
Città #
Fairfield 905
Woodbridge 802
Houston 505
Ann Arbor 467
Jacksonville 363
Ashburn 347
Seattle 321
Wilmington 315
Cambridge 295
Chandler 127
Princeton 121
Dong Ket 101
San Diego 78
Medford 66
Nanjing 45
Helsinki 33
Padova 28
Des Moines 25
Boardman 18
Shenyang 16
Nanchang 15
Roxbury 15
Hebei 14
Tianjin 12
Indiana 10
Dublin 9
Jinan 9
Norwalk 9
Guangzhou 8
Karlsruhe 8
Jiaxing 7
Changsha 6
New York 6
Ningbo 6
Taizhou 6
Zhengzhou 6
Kharkiv 5
Phoenix 4
Rockville 4
San Francisco 4
Yellow Springs 4
Bagnoli Di Sopra 3
Falls Church 3
Montpellier 3
Rodgau 3
Borås 2
London 2
Milan 2
Orange 2
Udine 2
Wiesbaden 2
Abano Terme 1
Bari 1
Brendola 1
Chicago 1
Fremont 1
Hangzhou 1
Jesolo 1
Kaiserslautern 1
Maserada sul Piave 1
Palermo 1
Redwood City 1
Rome 1
San Stino di Livenza 1
Sofia 1
Toronto 1
Traverse City 1
Trento 1
Venezia 1
Verona 1
Totale 5188
Nome #
Complementing logic program semantics 123
Abstracting Nash equilibria of supermodular games 115
Some properties of complete congruence lattices 115
Weak relative pseudo-complements of closure operators 109
A unifying view of abstract domain design 105
Building complete abstract interpretations in a linear logic-based setting 104
Making abstract model checking strongly preserving 104
A new efficient simulation equivalence algorithm 103
Refining and compressing abstract domains 102
Saving space in a time efficient simulation algorithm 102
An abstract interpretation-based model of tracing just-in-time compilation 102
Closures on CPOs form complete lattices 98
Pseudocomplements of closure operators on posets 98
Analyzing program analyses 96
Complete abstract interpretations made constructive 93
States vs. traces in model checking by abstract interpretation 92
Static analysis, abstract interpretation and verification in (constraint logic) programming 92
Strong preservation as completeness in abstract interpretation 91
A forward-backward abstraction refinement algorithm 90
The reduced relative power operation on abstract domains 89
On constructivity of galois connections 89
An abstract interpretation perspective on linear vs. branching time 88
Saving space in a time efficient simulation algorithm 88
Making abstract domains condensing 87
Example-guided abstraction simplification 86
Probabilistic bisimulation and simulation algorithms by abstract interpretation 86
Incompleteness of states w.r.t. traces in model checking 85
Tracing compilation by abstract interpretation 85
On the least complete extension of complete subsemilattices 84
Complementation in abstract interpretation 83
Making abstract interpretations complete 82
Program analysis is harder than verification: A computability perspective 82
An abstract interpretation-based refinement algorithm for strong preservation 81
Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions 81
Optimal domains for disjunctive abstract interpretation 80
Compositional optimization of disjunctive abstract interpretations 79
Uniform closures: order-theoretically reconstructing logic program semantics and abstract domain refinements 79
Generalized strong preservation by abstract interpretation. 79
Completeness in abstract interpretation: a domain perspective 78
Computing stuttering simulations 77
A more efficient simulation algorithm on Kripke structures 74
Generalizing the Paige-Tarjan algorithm by abstract interpretation 74
Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation 73
Abstract interpretation of supermodular games 72
On the completeness of model checking 71
An efficient simulation algorithm on Kripke structures 70
Robustness Verification of Support Vector Machines 70
Complementation in abstract interpretation 69
Language Inclusion Algorithms as Complete Abstract Interpretations 69
Correction to "Some properties of complete congruence lattices" 68
A²I: abstract² interpretation 68
Invertible Linear Transforms of Numerical Abstract Domains 67
Correctness kernels of abstract interpretations 66
The powerset operator on abstract interpretations 64
Foreword to the special issue on the 2017 Static Analysis Symposium 63
Functional dependencies and Moore-set completions of abstract interpretations and semantics 61
Complete Abstractions Everywhere 61
The Subgraph Similarity Problem 60
Building Complete Abstract Interpretations in a Linear Logic-based Setting 59
A spectrum of behavioral relations over LTSs on probability distributions 59
An efficient simulation algorithm based on abstract interpretation 58
Abstract interpretation of decision tree ensemble classifiers 57
Appunti di Programmazione ad Oggetti 56
Strong preservation of temporal fixpoint-based operators by abstract interpretation 54
A time and space efficient simulation algorithm 47
Improving abstract interpretations by systematic lifting to the powerset 38
Complementation of abstract domains made easy 38
A new characterization of complete Heyting and co-Heyting algebras 30
Improving Abstract Interpretations by Systematic Lifting to the Powerset 30
CPOs as Concrete Domains: Lattices of Abstract Domains and Complements 28
A Logic for Locally Complete Abstract Interpretations 24
Complete Abstractions for Checking Language Inclusion 23
A counterexample to a result concerning closure operators 19
Genetic adversarial training of decision trees 18
Optimization of Disjunctive Abstract Interpretations 17
History of Abstract Interpretation 16
A Constructive Framework for Galois Connections 13
Robustness Verification of Decision Tree Ensembles 13
Fairness-Aware Training of Decision Trees by Abstract Interpretation 13
Static Analysis: 24th International Symposium, SAS 2017 New York, NY, USA, august 30 - september 1, 2017 Proceedings 12
Preface SAS 2017 12
Decidability and Synthesis of Abstract Inductive Invariants 8
A Rice’s Theorem for Abstract Semantics 7
Inclusion Testing of Büchi Automata Based on Well-Quasiorders 5
Abstract interpretation repair 4
Tracing compilation by abstract interpretation 3
Local Completeness Logic on Kleene Algebra with Tests 2
Intensional Kleene and Rice theorems for abstract program semantics 1
Totale 5666
Categoria #
all - tutte 9235
article - articoli 3781
book - libri 90
conference - conferenze 0
curatela - curatele 45
other - altro 72
patent - brevetti 0
selected - selezionate 0
volume - volumi 176
Totale 13399


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2017/201887 0000 00 05 33724
2018/2019767 061002 04 238 6120244245
2019/20201380 1855420112 167144 144177 1571084270
2020/2021899 40733289 3465 1492 1726292134
2021/20221149 2811222563 4766 46165 5924129185
2022/2023337 1542331 7959 45 0000
Totale 5666