SAN PIETRO, PIERLUIGI
 Distribuzione geografica
Continente #
NA - Nord America 5.392
EU - Europa 1.546
AS - Asia 482
SA - Sud America 32
AF - Africa 7
OC - Oceania 4
Continente sconosciuto - Info sul continente non disponibili 1
Totale 7.464
Nazione #
US - Stati Uniti d'America 5.268
IT - Italia 273
UA - Ucraina 245
SE - Svezia 202
AT - Austria 187
DE - Germania 183
SG - Singapore 172
FI - Finlandia 127
VN - Vietnam 126
CA - Canada 122
CN - Cina 113
GB - Regno Unito 109
IE - Irlanda 77
ES - Italia 43
NL - Olanda 32
BR - Brasile 27
FR - Francia 22
JO - Giordania 19
BE - Belgio 14
ID - Indonesia 13
IN - India 13
KR - Corea 13
PL - Polonia 11
HK - Hong Kong 7
CH - Svizzera 6
CI - Costa d'Avorio 6
GR - Grecia 6
CO - Colombia 4
IL - Israele 3
NZ - Nuova Zelanda 3
PT - Portogallo 2
RO - Romania 2
AU - Australia 1
BG - Bulgaria 1
BJ - Benin 1
CR - Costa Rica 1
CZ - Repubblica Ceca 1
EC - Ecuador 1
EU - Europa 1
HU - Ungheria 1
JP - Giappone 1
LK - Sri Lanka 1
LV - Lettonia 1
MY - Malesia 1
NO - Norvegia 1
PA - Panama 1
Totale 7.464
Città #
Fairfield 701
Woodbridge 579
Houston 433
Ann Arbor 391
Chandler 385
Wilmington 344
Ashburn 330
Seattle 321
Santa Clara 269
Cambridge 246
Vienna 186
Dearborn 149
Jacksonville 145
Boardman 110
Ottawa 110
Singapore 102
Medford 89
Council Bluffs 88
Lawrence 88
Dublin 76
Dong Ket 68
Helsinki 47
Milan 46
Málaga 43
Beijing 40
San Diego 37
Amsterdam 28
Des Moines 28
Amman 19
New York 18
Brussels 13
Jakarta 13
Norwalk 13
Turin 12
Karlsruhe 11
London 11
Washington 10
Hefei 9
Auburn Hills 8
Los Angeles 8
Munich 8
Rome 8
Warsaw 8
Hong Kong 7
Paris 7
Toronto 7
Abidjan 6
Guangzhou 6
Miami 6
Redwood City 6
Verona 6
Cinisello Balsamo 5
Jinan 5
Shanghai 5
Athens 4
Austin 4
Cozzo 4
Dallas 4
Dongo 4
Mountain View 4
Nanjing 4
Phoenix 4
Seongnam 4
Seoul 4
Zurich 4
Bergamo 3
Bogotá 3
Indiana 3
Karlskrona 3
Ludwigshafen 3
Lusia 3
North Bergen 3
San Francisco 3
Saronno 3
Villaurbana 3
Atlanta 2
Belo Horizonte 2
Chiavenna 2
Chicago 2
Chiswick 2
Florence 2
Forest City 2
Frankfurt am Main 2
Hounslow 2
Kilburn 2
Kleinmachnow 2
Kunming 2
Montréal 2
Nuremberg 2
Petah Tikva 2
Portland 2
Prescot 2
Rio de Janeiro 2
Rodgau 2
Sovico 2
Werl 2
Aachen 1
Alajuela 1
Andradina 1
Anápolis 1
Totale 5.834
Nome #
A tool for deciding the satisfiability of continuous-time metric temporal logic 187
Constraint LTL Satisfiability Checking without Automata 168
A logical characterization of timed regular languages 161
An SMT-based approach to satisfiability checking of MITL 146
Alias Analysis by means of a Model Checker 137
Bounded Satisfiability Checking of Metric Temporal Logic Specifications 137
Deciding the Satisfiability of MITL Specifications 133
Model Checking Temporal Metric Specifications with Trio2Promela 130
Associative definition of programming languages 129
Efficient large-scale trace checking using mapreduce 128
A Finite-Domain Semantics for Testing Temporal Logic Specifications 127
Software procurement and methods for specification and validation in the railway transportation industry 126
Consensual languages and matching finite-state computations 126
Bounded Reachability for Temporal Logic over Constraint Systems 124
A Logical Characterization of Timed (non-)Regular Languages 118
Picture languages: Tiling systems versus tile rewriting grammars 117
A Case Study on Applying a Tool for Automated System Analysis Based on Modular Specifications Written in TRIO 112
Completeness of the Bounded Satisfiability Problem for Constraint LTL. 112
Deciding Continuous-Time Metric Temporal Logic with Counting Modalities 111
Some structural Properties of Associative Language Descriptions 108
Model-checking TRIO specifications in SPIN 107
Verification in Loosely Synchronous Queue-Connected Discrete Timed Automata 106
Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops 105
Automatic verification of multi-queue discrete timed automata 103
Generation of Execution Sequences for Modular Time Critical Systems 103
An object-oriented logic language for modular system specification 102
Trio2Promela: A Model Checker for Temporal Metric Specifications 102
A scalable formal method for design and automatic checking of user interfaces 100
A scalable formal method for design and automatic checking of user interfaces 96
A Metric Encoding for Bounded Model Checking 90
Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework 89
STRICT LOCAL TESTABILITY WITH CONSENSUS EQUALS REGULARITY, AND OTHER PROPERTIES 89
Benchmarking Model- and Satisfiability-Checking on bi-infinite time 87
Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations 85
On the Initialization of Clocks in Timed Formalisms 85
Consensual Definition of Languages by Regular Sets 84
On Presburger Liveness of Discrete Timed Automata 83
Regular languages as local functions with small alphabets 83
Dense counter machines and verification problems 82
The Symmetry of the Past and of the Future: Bi-infinite Time in the Verification of Temporal Properties 82
On Presburger Liveness of Discrete Timed Automata 81
A Tool for Deciding the Satisfiability of Continuous-time Metric Temporal Logic 79
An application of a tool for automated system analysis based on modular specifications 77
FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES 76
Commutative Languages and their Composition by Consensual Methods 76
Counter machines, Petri Nets, and consensual computation 76
Tree Adjoining Languages and Multipushdown Languages 75
Languages based on structural local testability 75
From Regular to Strictly Locally Testable Languages 75
Embedding time granularity in a logical specification language for synchronous real-time systems 75
A tool for automated system analysis based on modular specificationsProceedings 13th IEEE International Conference on Automated Software Engineering (Cat. No.98EX239) 74
A polynomial-time parsing algorithm for a class of nondeterministic two-stack automata 73
Regular Languages and Associative Language Descriptions 72
The Tale of SOLOIST: A Specification Language for Service Compositions Interactions 72
Refining Real-Time System Specifications through Bounded Model- and Satisfiability-Checking 70
Associative languages descriptions 70
Dense-choice Counter Machines revisited 70
Object-oriented logical specification of time-critical systems 69
Reuse of object-oriented requirement specificationsEntity-Relationship Approach — ER '93 69
Model Checking MITL Formulae on Timed Automata: A Logic-based Approach 69
A polynomial-time parsing algorithm for $K$-depth languages. 68
The defense of electric power systems: an approach exploiting formal methods 66
The Role of Formal Methods in Software Procurement for the Railway Transportation Industry 66
Dense-choice Counter Machines revisited 66
Extracting Synchronization-free chains of dependent iterations in non-uniform loops 64
Validation and Verification of the safety Kernel of the Naples subway 60
On the relation between multi-depth grammars and tree adjoining grammars. 60
Deque Languages, Automata and Planar Graphs 60
Practical Model Checking of LTL with Past 58
Experiences with a Formal Method for Design and Automatic Checking of User Interfaces 56
Regular languages and associative language descriptions 56
The word problem for k -depth languages. Semigroups, automata and languages 55
Model Checking the Secure Electronic Transaction Protocol, 53
SMT-Based Checking of SOLOIST over Sparse TracesFundamental Approaches to Software Engineering 52
On the Satisfiability of Metric Temporal Logics over the Reals 52
Generating functional test cases in-the-large for time-critical systems from logic-based specificationsProceedings of the 1996 international symposium on Software testing and analysis - ISSTA '96 50
Strict Local Testability with Consensus Equals RegularityImplementation and Application of Automata 50
On the relations between multi-depth grammars and label distinguished control.grammars 49
Potenza e limiti del calcolo automatico:problemi intrattabil 47
Extracting Synchronization-Free Slices of Operations in Perfectly-Nested Loops 47
Improved Bounded Model Checking of Timed Automata 47
The missing case in chomsky-schützenberger theorem 45
Real-Counter Automata and Applications to Verification 43
Offline Trace Checking of Quantitative Properties of Service-Based Applications2014 IEEE 7th International Conference on Service-Oriented Computing and Applications 42
Extracting coarse-grained parallelism with the Affine Transformation Framework and its limitations. Electronic Modeling. 41
Deque automata, languages, and planar graph representations 41
Deterministic Counter Machines and Parallel Matching ComputationsImplementation and Application of Automata 37
Model Checking-Aided Design of Secure Distributed Systems 33
Non-erasing Chomsky-Sch{"{u}}tzenberger theorem with grammar-independent alphabet 25
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes 23
Homomorphic Characterization of Tree Languages Based on Comma-Free Encoding 14
Reducing Local Alphabet Size in Recognizable Picture Languages 13
Regular languages as images of local functions over small alphabets 8
From words to pictures: Row-column combinations and Chomsky-Schützenberger theorem 8
Formal Methods Teaching - FMTEA 2023 6
Row-Column Combination of Dyck Words 6
Totale 7.540
Categoria #
all - tutte 24.248
article - articoli 8.838
book - libri 0
conference - conferenze 15.232
curatela - curatele 38
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 48.356


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020688 0 0 0 0 0 0 0 156 202 79 177 74
2020/20211.011 113 49 113 40 55 60 62 91 60 143 74 151
2021/2022722 36 121 48 55 61 40 45 34 33 57 65 127
2022/2023880 122 73 7 96 97 125 5 64 133 70 64 24
2023/2024413 38 87 20 40 31 64 22 20 4 26 0 61
2024/2025750 17 12 34 49 292 168 64 114 0 0 0 0
Totale 7.540