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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.547 0 0 30 128 203 259 239 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/202537 17 12 8 0 0 0 0 0 0 0 0 0
Totale 6.827