UniSa - IRIS Institutional Research Information System

LA TORRE, Salvatore
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.448
EU - Europa 1.461
AS - Asia 875
SA - Sud America 76
Continente sconosciuto - Info sul continente non disponibili 9
AF - Africa 5
OC - Oceania 2
Totale 7.876
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.435
UA - Ucraina 398
SG - Singapore 338
IT - Italia 315
CN - Cina 313
RU - Federazione Russa 187
SE - Svezia 166
DE - Germania 136
IE - Irlanda 127
TR - Turchia 92
FI - Finlandia 87
BR - Brasile 74
VN - Vietnam 65
KR - Corea 38
GB - Regno Unito 11
EU - Europa 9
IN - India 9
BE - Belgio 8
CA - Canada 8
IL - Israele 5
PH - Filippine 5
RO - Romania 5
MX - Messico 4
FR - Francia 3
AT - Austria 2
BG - Bulgaria 2
CM - Camerun 2
CZ - Repubblica Ceca 2
DK - Danimarca 2
JP - Giappone 2
AL - Albania 1
AU - Australia 1
AZ - Azerbaigian 1
BD - Bangladesh 1
DO - Repubblica Dominicana 1
EC - Ecuador 1
ES - Italia 1
GR - Grecia 1
HK - Hong Kong 1
HU - Ungheria 1
IQ - Iraq 1
KE - Kenya 1
KZ - Kazakistan 1
LU - Lussemburgo 1
NE - Niger 1
NL - Olanda 1
NO - Norvegia 1
NP - Nepal 1
NZ - Nuova Zelanda 1
PL - Polonia 1
PS - Palestinian Territory 1
PT - Portogallo 1
RS - Serbia 1
UZ - Uzbekistan 1
VE - Venezuela 1
ZA - Sudafrica 1
Totale 7.876
Salva come PNG Salva come JPEG
Città #
Ann Arbor 1.529
Wilmington 757
Woodbridge 500
Jacksonville 494
Chandler 492
Houston 456
Princeton 364
Singapore 148
Dublin 126
Nanjing 98
Andover 90
Izmir 88
Ashburn 69
Salerno 69
Boardman 63
Dong Ket 59
Mestre 58
Pellezzano 57
Moscow 47
Düsseldorf 40
Hebei 34
Nanchang 34
Fairfield 27
Beijing 24
Jiaxing 21
Tianjin 21
Changsha 20
Shenyang 20
Dallas 16
The Dalles 16
Norwalk 15
Des Moines 12
Milan 11
Council Bluffs 10
Spinea 9
Brussels 8
Cambridge 8
Napoli 8
San Diego 8
Washington 8
Munich 7
Pune 6
Avellino 5
Edinburgh 5
Hanoi 5
Ottawa 5
Helsinki 4
Horia 4
Lappeenranta 4
Naples 4
New York 4
Redwood City 4
Trento 4
Belo Horizonte 3
Dearborn 3
Dormagen 3
Guangzhou 3
Indiana 3
Rio de Janeiro 3
Shanghai 3
Somma 3
Springfield 3
São Paulo 3
Zhengzhou 3
Aprilia 2
Bursa 2
Campina Grande 2
Candiolo 2
Cascina 2
Catania 2
Copenhagen 2
Fornasa 2
Frattaminore 2
Fuzhou 2
Grevenbroich 2
Hangzhou 2
Itajaí 2
Jinan 2
London 2
Los Angeles 2
Menlo Park 2
Mexico City 2
Montreal 2
North Bergen 2
Philadelphia 2
Phoenix 2
Praia Grande 2
Rome 2
Santa Clara 2
Seattle 2
Sofia 2
Sorrento 2
Tokyo 2
Yellow Springs 2
Acerra 1
Aiello Del Sabato 1
Aigaleo 1
Albertville 1
Amargosa 1
Apucarana 1
Totale 6.094
Salva come PNG Salva come JPEG
Nome #
Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints 148
Winning CaRet Games with Modular Strategies 144
A general modular synthesis problem for pushdown systems 140
Lazy sequentialization for the safety verification of unbounded concurrent programs 133
null 132
Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization 125
Lazy-CSeq: A context-bounded model checking tool for multi-threaded C-programs 122
Verification of Scope-dependent Hierarchical State Machines 120
Synchronization of a Line of Identical Processors at a Given Time 119
Decision Problems for lower/upper bound Parametric Timed Automata 116
A Decidable Dense Branching-time Temporal Logic 113
Timed tree Automata with an application to Temporal Logic 112
Proceedings of Second International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2011. Electronic Proceedings in Theoretical Computer Science 111
A Compositional Approach to Synchronize Two Dimensional Networks of Processors 109
Automata-theoretic decision of timed games 109
Games, Automata, Logic, and Formal Verification (GandALF 2011) 109
Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width 108
MU-CSeq: Sequentialization of C Programs by Shared Memory Unwindings 106
Context-Bounded Analysis of Concurrent Queue Systems 106
Verification of Succinct Hierarchical State Machines 105
Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches 105
Representing hyper-graphs by regular languages 102
Deterministic Generators and Games for LTL Fragments 101
Visibly Pushdown Modular Games 100
Lazy-CSeq: A Lazy Sequentialization Tool for C 99
Hierarchical and Recursive State Machines with Context-Dependent Properties 98
The word problem for visibly pushdown languages described by grammars 98
Decision Problems for lower/upper bound Parametric Timed Automata 97
Sequentializing Parameterized Programs 92
Compositionality in the Synchronization of Processors Exchanging a minimal amount of Information 91
Modular Synthesis with Open Components Reachability Problems 91
Lazy-CSeq 2.0: Combining lazy sequentialization with abstract interpretation 91
Analyzing Recursive Programs using a Fixed-point Calculus 91
Dependability of Iterative Software: a Model for Evaluating the Effects of Input Correlation 90
Parametric metric interval temporal logic 90
Optimal paths in weighted timed automata 89
Deterministic generators and games for Ltl fragments 88
The Firing Squad Synchronization Problem on Squares, Toruses and Rings 88
An Infinite Automaton Characterization of Double Exponential Time 88
Scope-Bounded Pushdown Languages 88
Verification of well-formed Communicating Recursive State Machines 87
Modelling the Effects of Input Correlation in Iterative Software 86
Visibly pushdown modular games 86
MU-CSeq 0.4: Individual memory location unwindings 86
Different Time Solutions for the Firing Squad Synchronization Problem on Basic Grid Networks 85
A Temporal Logic for Multi-threaded Programs 85
Lazy Sequentialization for TSO and PSO via Shared Memory Abstractions 84
Automata-based Representations for Infinite Graphs 81
On the Complexity of LTL Model-Checking of Recursive State Machines 81
MU-CSeq 0.3: Sequentialization by Read-Implicit and Coarse-Grained Memory Unwindings 81
Synchronization of 1-way connected processors 80
Finite automata on timed omega-trees. 80
A Robust Class of Context-Sensitive Languages 79
Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings 78
Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable 78
The Language Theory of Bounded Context-Switching 76
Scope-Bounded Pushdown Languages 76
Representing Infinite hyper-graphs by regular languages 75
Verifying Concurrent Programs by Memory Unwinding 75
Automata-Theoretic Decision of Timed Games 75
Concurrent Program Verification with Lazy Sequentialization and Interval Analysis 74
MODEL-CHECKING THE SECURE RELEASE OF A TIME-LOCKED SECRET OVER A NETWORK 73
Polyhedral Flows in Hybrid Automata 72
Parametric Temporal Logic for Model Measuring 72
Weak Muller acceptance conditions for tree automata 69
Model-Checking Parameterized Concurrent Programs Using Linear Interfaces 69
Dense Real-Time Games 68
Deterministic finite automata with recursive calls and DPDAs 67
Modular Strategies for Recursive Game Graphs 67
null 67
A Model of Finite Automata on Timed omega-Trees 66
Parallel bug-finding in concurrent programs via reduced interleaving instances 66
Polyhedral Flows in Hybrid Automata 66
Verification of Well-Formed Communicating Recursive State Machines 65
Parametric temporal logic for "model measuring" 64
Modular Strategies for Infinite Games on Recursive Graphs 64
On the Membership Problem for Visibly Pushdown Languages 63
Reducing context-bounded concurrent reachability to sequentialreachability 63
Playing Games with Boxes and Diamonds 62
Parametric Metric Interval Temporal Logic 62
Parallel Word Substitution 61
A Unifying Approach for Multistack Pushdown Automata 61
Optimal Paths in Weighted Timed Automata 60
Using shared memory abstractions to design eager sequentializations for weak memory models 58
Perturbed Timed Automata 56
Weak Muller Acceptance Conditions for Tree Automata 56
Reasoning About Co-Büchi Tree Automata 56
Modular Strategies for Recursive Game Graphs 53
Decidability and Infinite Precision in Timed Automata 53
Optimal-Reachability and Control for Acyclic Weighted Timed Automata 42
Bounded Verification of Multi-threaded Programs via Lazy Sequentialization 35
Complexity of qualitative timeline-based planning 34
A Fixed-point Model-checker for BDI Logics over Finite-state Worlds 31
Automated Planning Through Program Verification 31
Synchronization of 1-way connected processorsFundamentals of Computation Theory 27
On the Model-Checking of Branching-Time Temporal Logic with BDI Modalities 26
Model Checking BDI Logics over Finite-state Worlds 26
VeriSmart 2.0: Swarm-Based Bug-Finding for Multi-threaded Programs with Lazy-CSeq 24
CBMC-SSM: Bounded Model Checking of C Programs with Symbolic Shadow Memory 22
Reachability of scope-bounded multistack pushdown systems 21
Totale 8.050
Salva come PNG Salva come JPEG
Categoria #
all - tutte 26.159
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 26.159
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020128 0 0 0 0 0 0 0 0 0 0 104 24
2020/2021778 4 85 86 6 87 44 89 4 128 18 122 105
2021/2022654 0 0 3 17 24 9 3 31 99 86 85 297
2022/20231.103 112 82 10 140 153 247 0 103 161 4 61 30
2023/2024294 37 62 23 15 11 27 23 21 0 14 12 49
2024/2025718 78 26 51 53 29 115 114 115 100 32 5 0
Totale 8.117