default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierluigi San Pietro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j32]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Regular languages as images of local functions over small alphabets. Inf. Comput. 301: 105206 (2024)- [j31]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
:
From words to pictures: Row-column combinations and Chomsky-Schützenberger theorem. Theor. Comput. Sci. 1002: 114598 (2024) - [c56]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Row-Column Combination of Dyck Words. SOFSEM 2024: 139-153 - 2023
- [c55]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Two-Dimensional Dyck Words (short paper) (text not included). ICTCS 2023 - [e2]Catherine Dubois, Pierluigi San Pietro:
Formal Methods Teaching: 5th International Workshop, FMTea 2023, Lübeck, Germany, March 6, 2023, Proceedings. Lecture Notes in Computer Science 13962, Springer 2023, ISBN 978-3-031-27533-3 [contents] - [i11]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Two-dimensional Dyck words. CoRR abs/2307.16522 (2023) - 2022
- [j30]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes. Theor. Comput. Sci. 933: 1-20 (2022) - [i10]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes. CoRR abs/2206.05208 (2022) - 2021
- [c54]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Reducing Local Alphabet Size in Recognizable Picture Languages. DLT 2021: 103-116 - [c53]Robert L. Smith, Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
Improved Bounded Model Checking of Timed Automata. FormaliSE@ICSE 2021: 97-110 - [c52]Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Reducing the Local Alphabet Size in Tiling Systems for Picture Languages. ICTCS 2021: 199-204 - [c51]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Homomorphic Characterization of Tree Languages Based on Comma-Free Encoding. LATA 2021: 241-254 - [i9]Robert L. Smith, Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
Improved Bounded Model Checking of Timed Automata. CoRR abs/2104.12444 (2021) - 2020
- [j29]Aniello Murano, Patricia Bouyer, Pierluigi San Pietro, Andrea Orlandini:
Preface. Inf. Comput. 272: 104497 (2020) - [j28]Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
On the initialization of clocks in timed formalisms. Theor. Comput. Sci. 813: 175-198 (2020) - [j27]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Deque automata, languages, and planar graph representations. Theor. Comput. Sci. 834: 43-59 (2020) - [j26]Claudio Menghi, Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
Model Checking MITL Formulae on Timed Automata: A Logic-based Approach. ACM Trans. Comput. Log. 21(3): 26:1-26:44 (2020)
2010 – 2019
- 2019
- [j25]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet. Inf. Comput. 269 (2019) - [c50]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Regular Languages as Local Functions with Small Alphabets. CAI 2019: 124-137 - [c49]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Deque Languages, Automata and Planar Graphs (text not included). ICTCS 2019 - 2018
- [c48]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Deque Languages, Automata and Planar Graphs. DLT 2018: 243-255 - [i8]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Non-erasing Chomsky-Sch{ü}tzenberger theorem with grammar-independent alphabet. CoRR abs/1805.04003 (2018) - [i7]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Deque languages, automata and planar graphs. CoRR abs/1806.06562 (2018) - [i6]Claudio Menghi, Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
A Flexible Approach for Checking Timed Automata on Continuous Time Semantics. CoRR abs/1806.08684 (2018) - 2017
- [j24]Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
A logical characterization of timed regular languages. Theor. Comput. Sci. 658: 46-59 (2017) - [j23]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Counter machines, Petri Nets, and consensual computation. Theor. Comput. Sci. 664: 91-116 (2017) - [e1]Patricia Bouyer, Andrea Orlandini, Pierluigi San Pietro:
Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2017, Roma, Italy, 20-22 September 2017. EPTCS 256, 2017 [contents] - 2016
- [j22]Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
A tool for deciding the satisfiability of continuous-time metric temporal logic. Acta Informatica 53(2): 171-206 (2016) - [c47]Marcello M. Bersani, Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro:
Efficient large-scale trace checking using mapreduce. ICSE 2016: 888-898 - [c46]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
The Missing Case in Chomsky-Schützenberger Theorem. LATA 2016: 345-358 - 2015
- [j21]Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
An SMT-based approach to satisfiability checking of MITL. Inf. Comput. 245: 72-97 (2015) - [i5]Marcello M. Bersani, Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro:
Efficient Large-scale Trace Checking Using MapReduce. CoRR abs/1508.06613 (2015) - 2014
- [j20]Marcello M. Bersani, Achille Frigeri, Angelo Morzenti, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro:
Constraint LTL satisfiability checking without automata. J. Appl. Log. 12(4): 522-557 (2014) - [j19]Florent Bouchy, Alain Finkel, Pierluigi San Pietro:
Dense-choice Counter Machines revisited. Theor. Comput. Sci. 542: 17-31 (2014) - [c45]Marcello Maria Bersani, Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro:
SMT-Based Checking of SOLOIST over Sparse Traces. FASE 2014: 276-290 - [c44]Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
A Logical Characterization of Timed (non-)Regular Languages. MFCS (1) 2014: 75-86 - [c43]Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro:
Offline Trace Checking of Quantitative Properties of Service-Based Applications. SOCA 2014: 9-16 - [c42]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Commutative Languages and their Composition by Consensual Methods. AFL 2014: 216-230 - [i4]Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro:
Offline Trace Checking of Quantitative Properties of Service-Based Applications. CoRR abs/1409.4653 (2014) - 2013
- [j18]Marcello Maria Bersani, Matteo Rossi, Pierluigi San Pietro:
On the Satisfiability of Metric Temporal Logics over the Reals. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 66 (2013) - [j17]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Strict Local Testability with Consensus Equals Regularity, and Other Properties. Int. J. Found. Comput. Sci. 24(6): 747-764 (2013) - [j16]Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro:
Bounded satisfiability checking of metric temporal logic specifications. ACM Trans. Softw. Eng. Methodol. 22(3): 20:1-20:54 (2013) - [c41]Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
Deciding Continuous-Time Metric Temporal Logic with Counting Modalities. RP 2013: 70-82 - [c40]Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro:
A Tool for Deciding the Satisfiability of Continuous-Time Metric Temporal Logic. TIME 2013: 99-106 - [c39]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Deterministic Counter Machines and Parallel Matching Computations. CIAA 2013: 280-291 - [c38]Marcello Maria Bersani, Matteo Rossi, Pierluigi San Pietro:
Deciding the Satisfiability of MITL Specifications. GandALF 2013: 64-78 - 2012
- [j15]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
From Regular to Strictly Locally Testable Languages. Int. J. Found. Comput. Sci. 23(8): 1711-1728 (2012) - [c37]Domenico Bianculli, Carlo Ghezzi, Pierluigi San Pietro:
The Tale of SOLOIST: A Specification Language for Service Compositions Interactions. FACS 2012: 55-72 - [c36]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Strict Local Testability with Consensus Equals Regularity. CIAA 2012: 113-124 - [i3]Marcello M. Bersani, Achille Frigeri, Angelo Morzenti, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro:
Constraint LTL Satisfiability Checking without Automata. CoRR abs/1205.0946 (2012) - 2011
- [j14]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Consensual languages and matching finite-state computations. RAIRO Theor. Informatics Appl. 45(1): 77-97 (2011) - [c35]Marcello M. Bersani, Achille Frigeri, Matteo Rossi, Pierluigi San Pietro:
Completeness of the Bounded Satisfiability Problem for Constraint LTL. RP 2011: 58-71 - [c34]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
From Regular to Strictly Locally Testable Languages. WORDS 2011: 103-111 - 2010
- [c33]Marcello M. Bersani, Achille Frigeri, Angelo Morzenti, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro:
Bounded Reachability for Temporal Logic over Constraint Systems. TIME 2010: 43-50 - [i2]Marcello M. Bersani, Achille Frigeri, Angelo Morzenti, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro:
Bounded Reachability for Temporal Logic over Constraint Systems. CoRR abs/1004.1077 (2010)
2000 – 2009
- 2009
- [c32]Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro:
A Metric Encoding for Bounded Model Checking. FM 2009: 741-756 - [c31]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Languages defined by consensual computations. ICTCS 2009: 82-85 - [c30]Florent Bouchy, Alain Finkel, Pierluigi San Pietro:
Dense-choice Counter Machines revisited. INFINITY 2009: 3-22 - [i1]Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro:
A Metric Encoding for Bounded Model Checking (extended version). CoRR abs/0907.3085 (2009) - 2008
- [c29]Wlodzimierz Bielecki, Anna Beletska, Marek Palkowski, Pierluigi San Pietro:
Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations. ICA3PP 2008: 185-195 - [c28]Anna Beletska, Wlodzimierz Bielecki, Krzysztof Siedlecki, Pierluigi San Pietro:
Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops. ICCSA (2) 2008: 871-886 - [c27]Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro:
Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time. ICTAC 2008: 290-304 - [c26]Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro:
Refining Real-Time System Specifications through Bounded Model- and Satisfiability-Checking. ASE 2008: 119-127 - [c25]Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Consensual Definition of Languages by Regular Sets. LATA 2008: 196-208 - 2007
- [j13]Marcella Anselmo, Alessandra Cherubini, Pierluigi San Pietro:
Regular Languages and Associative Language Descriptions. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - [c24]Domenico Bianculli, Paola Spoletini, Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro:
Model Checking Temporal Metric Specifications with Trio2Promela. FSEN 2007: 388-395 - [c23]Domenico Bianculli, Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro, Paola Spoletini:
Trio2Promela: A Model Checker for Temporal Metric Specifications. ICSE Companion 2007: 61-62 - [c22]Anna Beletska, Wlodzimierz Bielecki, Pierluigi San Pietro:
Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework. ISPDC 2007: 203-210 - [c21]Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro:
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties. ESEC/SIGSOFT FSE 2007: 312-320 - 2006
- [j12]Alessandra Cherubini, Stefano Crespi-Reghizzi, Matteo Pradella, Pierluigi San Pietro:
Picture languages: Tiling systems versus tile rewriting grammars. Theor. Comput. Sci. 356(1-2): 90-103 (2006) - 2005
- [j11]Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro:
A scalable formal method for design and automatic checking of user interfaces. ACM Trans. Softw. Eng. Methodol. 14(2): 124-167 (2005) - 2004
- [c20]Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie:
Real-Counter Automata and Their Decision Problems. FSTTCS 2004: 198-210 - [c19]Mario Verdicchio, Pierluigi San Pietro:
Model checking-aided design of secure distributed systems. IASTED Conf. on Software Engineering 2004: 212-217 - [c18]Alessandro Campi, Eliseo Martinez, Pierluigi San Pietro:
Experiences with a Formal Method for Design and Automatic Checking of User Interfaces. MBUI 2004 - 2003
- [j10]Oscar H. Ibarra, Zhe Dang, Pierluigi San Pietro:
Verification in loosely synchronous queue-connected discrete timed automata. Theor. Comput. Sci. 290(3): 1713-1735 (2003) - [j9]Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer:
Presburger liveness verification of discrete timed automata. Theor. Comput. Sci. 299(1-3): 413-438 (2003) - [c17]Gaoyan Xie, Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro:
Dense Counter Machines and Verification Problems. CAV 2003: 93-105 - [c16]Pierluigi San Pietro, Zhe Dang:
Automatic Verification of Multi-queue Discrete Timed Automata. COCOON 2003: 159-171 - [c15]Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro, Paola Spoletini:
Model-Checking TRIO Specifications in SPIN. FME 2003: 542-561 - 2002
- [j8]Alessandra Cherubini, Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Associative language descriptions. Theor. Comput. Sci. 270(1-2): 463-491 (2002) - [c14]Umberto Foschi, Mauro Giuliani, Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro:
Software procurement and methods for specification and validation in the railway transportation industry. SMC 2002: 6 - 2001
- [c13]Vincenzo Martena, Pierluigi San Pietro:
Alias Analysis by Means of a Model Checker. CC 2001: 3-19 - [c12]Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro:
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter. FSTTCS 2001: 132-143 - [c11]Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro:
A Scalable Formal Method for Design and Automatic Checking of User Interfaces. ICSE 2001: 453-462 - [c10]Alessandra Cherubini, Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Some Structural Properties of Associative Language Descriptions. ICTCS 2001: 172-183 - [c9]Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer:
On Presburger Liveness of Discrete Timed Automata. STACS 2001: 132-143 - 2000
- [j7]Sandro Morasca, Angelo Morzenti, Pierluigi San Pietro:
A Case Study on Applying a Tool for Automated System Analysis Based on Modular Specifications Written in TRIO. Autom. Softw. Eng. 7(2): 125-155 (2000) - [j6]Stefano Crespi-Reghizzi, Matteo Pradella, Pierluigi San Pietro:
Associative definition of programming languages. Comput. Lang. 26(2-4): 105-123 (2000) - [j5]Alessandra Cherubini, Pierluigi San Pietro:
Tree Adjoining Languages and Multipushdown Languages. Theory Comput. Syst. 33(4): 257-293 (2000) - [j4]Pierluigi San Pietro, Angelo Morzenti, Sandro Morasca:
Generation of Execution Sequences for Modular Time Critical Systems. IEEE Trans. Software Eng. 26(2): 128-149 (2000)
1990 – 1999
- 1998
- [c8]Alberto Coen-Porisini, Matteo Pradella, Pierluigi San Pietro:
A Finite-Domain Semantics for Testing Temporal Logic Specifications. FTRTFT 1998: 41-54 - [c7]Angelo Morzenti, Pierluigi San Pietro, Sandro Morasca:
A Tool for Automated System Analysis based on Modular Specifications. ASE 1998: 2-11 - 1996
- [j3]Alessandra Cherubini, Pierluigi San Pietro:
A Polynomial-Time Parsing Algorithm for K-Depth Languages. J. Comput. Syst. Sci. 52(1): 61-79 (1996) - [c6]Sandro Morasca, Angelo Morzenti, Pierluigi San Pietro:
Generating Functional Test Cases in-the-large for Time-critical Systems from Logic-based Specifications. ISSTA 1996: 39-52 - 1994
- [j2]Angelo Morzenti, Pierluigi San Pietro:
Object-Oriented Logical Specification of Time-Critical Systems. ACM Trans. Softw. Eng. Methodol. 3(1): 56-98 (1994) - 1993
- [j1]Emanuele Ciapessoni, Edoardo Corsetti, Angelo Montanari, Pierluigi San Pietro:
Embedding Time Granularity in a Logical Specification Language for Synchronous Real-Time Systems. Sci. Comput. Program. 20(1-2): 141-171 (1993) - [c5]Silvana Castano, Valeria De Antonellis, Pierluigi San Pietro:
Reuse of Object-Oriented Requirements Specifications. ER 1993: 339-351 - 1992
- [c4]Miguel Felder, Pierluigi San Pietro:
Testing by Executing Logic Specifications. NATO ASI RTC 1992: 683-684 - [c3]Miguel Felder, Pierluigi San Pietro:
Finite Time Semantics for Executable Logic Specifications. NATO ASI RTC 1992: 685-686 - 1991
- [c2]Angelo Morzenti, Pierluigi San Pietro:
An Object-Oriented Logic Language for Modular System Specification. ECOOP 1991: 39-58 - [c1]Edoardo Corsetti, Ernani Crivelli, Dino Mandrioli, Angelo Montanari, Angelo Morzenti, Pierluigi San Pietro, Elena Ratto:
Dealing with different time scales in formal specifications. IWSSD 1991: 92-101
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-18 00:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
