UniSa - IRIS Institutional Research Information System

LA TORRE, Salvatore
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 5.539
EU - Europa 1.481
AS - Asia 912
SA - Sud America 102
Continente sconosciuto - Info sul continente non disponibili 9
AF - Africa 6
OC - Oceania 2
Totale 8.051
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 5.516
UA - Ucraina 398
SG - Singapore 352
CN - Cina 318
IT - Italia 315
RU - Federazione Russa 188
SE - Svezia 167
DE - Germania 140
IE - Irlanda 127
BR - Brasile 100
TR - Turchia 95
FI - Finlandia 90
VN - Vietnam 65
KR - Corea 42
GB - Regno Unito 16
CA - Canada 14
IN - India 13
EU - Europa 9
BE - Belgio 8
PL - Polonia 6
IL - Israele 5
PH - Filippine 5
RO - Romania 5
FR - Francia 4
MX - Messico 4
BD - Bangladesh 3
AT - Austria 2
BB - Barbados 2
BG - Bulgaria 2
CM - Camerun 2
CZ - Repubblica Ceca 2
DK - Danimarca 2
IQ - Iraq 2
JP - Giappone 2
SA - Arabia Saudita 2
TT - Trinidad e Tobago 2
UZ - Uzbekistan 2
ZA - Sudafrica 2
AL - Albania 1
AU - Australia 1
AZ - Azerbaigian 1
DO - Repubblica Dominicana 1
EC - Ecuador 1
ES - Italia 1
GR - Grecia 1
HK - Hong Kong 1
HU - Ungheria 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
PK - Pakistan 1
PS - Palestinian Territory 1
PT - Portogallo 1
RS - Serbia 1
VE - Venezuela 1
Totale 8.051
Salva come PNG Salva come JPEG
Città #
Ann Arbor 1.529
Wilmington 757
Woodbridge 500
Jacksonville 495
Chandler 492
Houston 456
Princeton 364
Singapore 159
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
Beijing 29
Fairfield 27
The Dalles 23
Jiaxing 21
Tianjin 21
Changsha 20
Shenyang 20
Dallas 18
Norwalk 15
Des Moines 12
Milan 11
Munich 11
Columbus 10
Council Bluffs 10
Los Angeles 9
Spinea 9
Washington 9
Brussels 8
Cambridge 8
Napoli 8
New York 8
San Diego 8
Montreal 7
Brooklyn 6
Pune 6
Warsaw 6
Avellino 5
Chicago 5
Edinburgh 5
Hanoi 5
Ottawa 5
São Paulo 5
Charlotte 4
Helsinki 4
Horia 4
Lappeenranta 4
London 4
Naples 4
Redwood City 4
Rio de Janeiro 4
Trento 4
Belo Horizonte 3
Bursa 3
Dearborn 3
Dormagen 3
Guangzhou 3
Indiana 3
Las Vegas 3
Phoenix 3
San Francisco 3
Santa Clara 3
Shanghai 3
Somma 3
Springfield 3
Turku 3
Zhengzhou 3
Ankara 2
Aprilia 2
Brasília 2
Bridgetown 2
Campina Grande 2
Candiolo 2
Cascina 2
Catania 2
Chaguanas 2
Chennai 2
Copenhagen 2
Fornasa 2
Frattaminore 2
Fuzhou 2
Grevenbroich 2
Hangzhou 2
Ipatinga 2
Itajaí 2
Jinan 2
Johannesburg 2
Menlo Park 2
Mexico City 2
Totale 6.179
Salva come PNG Salva come JPEG
Nome #
Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints 149
Winning CaRet Games with Modular Strategies 146
A general modular synthesis problem for pushdown systems 144
Lazy sequentialization for the safety verification of unbounded concurrent programs 138
null 132
Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization 127
Lazy-CSeq: A context-bounded model checking tool for multi-threaded C-programs 127
Verification of Scope-dependent Hierarchical State Machines 121
Synchronization of a Line of Identical Processors at a Given Time 120
Decision Problems for lower/upper bound Parametric Timed Automata 116
A Decidable Dense Branching-time Temporal Logic 114
A Compositional Approach to Synchronize Two Dimensional Networks of Processors 114
Timed tree Automata with an application to Temporal Logic 113
Automata-theoretic decision of timed games 113
Proceedings of Second International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2011. Electronic Proceedings in Theoretical Computer Science 112
Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width 111
Games, Automata, Logic, and Formal Verification (GandALF 2011) 109
Context-Bounded Analysis of Concurrent Queue Systems 109
Verification of Succinct Hierarchical State Machines 106
MU-CSeq: Sequentialization of C Programs by Shared Memory Unwindings 106
Representing hyper-graphs by regular languages 105
Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches 105
Deterministic Generators and Games for LTL Fragments 102
Visibly Pushdown Modular Games 101
Hierarchical and Recursive State Machines with Context-Dependent Properties 99
The word problem for visibly pushdown languages described by grammars 99
Lazy-CSeq: A Lazy Sequentialization Tool for C 99
Decision Problems for lower/upper bound Parametric Timed Automata 97
Compositionality in the Synchronization of Processors Exchanging a minimal amount of Information 96
Lazy-CSeq 2.0: Combining lazy sequentialization with abstract interpretation 96
Sequentializing Parameterized Programs 94
Modular Synthesis with Open Components Reachability Problems 92
Analyzing Recursive Programs using a Fixed-point Calculus 92
An Infinite Automaton Characterization of Double Exponential Time 91
Dependability of Iterative Software: a Model for Evaluating the Effects of Input Correlation 91
Parametric metric interval temporal logic 91
Scope-Bounded Pushdown Languages 91
Optimal paths in weighted timed automata 90
Visibly pushdown modular games 90
Lazy Sequentialization for TSO and PSO via Shared Memory Abstractions 89
MU-CSeq 0.4: Individual memory location unwindings 89
Deterministic generators and games for Ltl fragments 88
The Firing Squad Synchronization Problem on Squares, Toruses and Rings 88
Verification of well-formed Communicating Recursive State Machines 88
A Temporal Logic for Multi-threaded Programs 88
Modelling the Effects of Input Correlation in Iterative Software 87
Different Time Solutions for the Firing Squad Synchronization Problem on Basic Grid Networks 86
Automata-based Representations for Infinite Graphs 85
Finite automata on timed omega-trees. 83
MU-CSeq 0.3: Sequentialization by Read-Implicit and Coarse-Grained Memory Unwindings 82
Synchronization of 1-way connected processors 81
On the Complexity of LTL Model-Checking of Recursive State Machines 81
A Robust Class of Context-Sensitive Languages 80
Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings 79
Verifying Concurrent Programs by Memory Unwinding 78
Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable 78
Automata-Theoretic Decision of Timed Games 77
Representing Infinite hyper-graphs by regular languages 76
The Language Theory of Bounded Context-Switching 76
Scope-Bounded Pushdown Languages 76
Concurrent Program Verification with Lazy Sequentialization and Interval Analysis 75
MODEL-CHECKING THE SECURE RELEASE OF A TIME-LOCKED SECRET OVER A NETWORK 74
Parametric Temporal Logic for Model Measuring 74
Polyhedral Flows in Hybrid Automata 73
Model-Checking Parameterized Concurrent Programs Using Linear Interfaces 72
Weak Muller acceptance conditions for tree automata 69
Dense Real-Time Games 69
A Model of Finite Automata on Timed omega-Trees 68
Verification of Well-Formed Communicating Recursive State Machines 68
Deterministic finite automata with recursive calls and DPDAs 67
Modular Strategies for Recursive Game Graphs 67
null 67
Parallel bug-finding in concurrent programs via reduced interleaving instances 67
Polyhedral Flows in Hybrid Automata 67
Parametric temporal logic for "model measuring" 66
Reducing context-bounded concurrent reachability to sequentialreachability 65
On the Membership Problem for Visibly Pushdown Languages 64
Modular Strategies for Infinite Games on Recursive Graphs 64
Playing Games with Boxes and Diamonds 63
Optimal Paths in Weighted Timed Automata 63
A Unifying Approach for Multistack Pushdown Automata 63
Parametric Metric Interval Temporal Logic 62
Parallel Word Substitution 62
Using shared memory abstractions to design eager sequentializations for weak memory models 60
Perturbed Timed Automata 57
Reasoning About Co-Büchi Tree Automata 57
Weak Muller Acceptance Conditions for 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 44
Bounded Verification of Multi-threaded Programs via Lazy Sequentialization 43
Complexity of qualitative timeline-based planning 37
A Fixed-point Model-checker for BDI Logics over Finite-state Worlds 36
Automated Planning Through Program Verification 32
Model Checking BDI Logics over Finite-state Worlds 28
Synchronization of 1-way connected processorsFundamentals of Computation Theory 28
On the Model-Checking of Branching-Time Temporal Logic with BDI Modalities 27
VeriSmart 2.0: Swarm-Based Bug-Finding for Multi-threaded Programs with Lazy-CSeq 26
Reachability of scope-bounded multistack pushdown systems 25
CBMC-SSM: Bounded Model Checking of C Programs with Symbolic Shadow Memory 23
Totale 8.217
Salva come PNG Salva come JPEG
Categoria #
all - tutte 27.424
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 27.424
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
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/2025871 78 26 51 53 29 115 114 115 100 32 104 54
2025/202622 22 0 0 0 0 0 0 0 0 0 0 0
Totale 8.292