Pierluigi San Pietro

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 28

Top Topics

Graph Representation

Regular Languages

Metric Temporal Logic

Top Venues

Theor. Comput. Sci.

Publications

Stefano Crespi-Reghizzi, Pierluigi San Pietro
Regular languages as images of local functions over small alphabets. Inf. Comput. 301 (2024)
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
From words to pictures: Row-column combinations and Chomsky-Schützenberger theorem. Theor. Comput. Sci. 1002 (2024)
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
Row-Column Combination of Dyck Words. SOFSEM (2024)
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
Two-dimensional Dyck words. CoRR (2023)
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
Two-Dimensional Dyck Words (short paper) (text not included). ICTCS (2023)
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 (2022)
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes. CoRR (2022)
Robert L. Smith, Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
Improved Bounded Model Checking of Timed Automata. FormaliSE@ICSE (2021)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Homomorphic Characterization of Tree Languages Based on Comma-Free Encoding. LATA (2021)
Robert L. Smith, Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
Improved Bounded Model Checking of Timed Automata. CoRR (2021)
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
Reducing Local Alphabet Size in Recognizable Picture Languages. DLT (2021)
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
Reducing the Local Alphabet Size in Tiling Systems for Picture Languages. ICTCS (2021)
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) (2020)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Deque automata, languages, and planar graph representations. Theor. Comput. Sci. 834 (2020)
Aniello Murano, Patricia Bouyer, Pierluigi San Pietro, Andrea Orlandini
Preface. Inf. Comput. 272 (2020)
Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
On the initialization of clocks in timed formalisms. Theor. Comput. Sci. 813 (2020)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Deque Languages, Automata and Planar Graphs (text not included). ICTCS (2019)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Regular Languages as Local Functions with Small Alphabets. CAI (2019)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet. Inf. Comput. 269 (2019)
Claudio Menghi, Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
A Flexible Approach for Checking Timed Automata on Continuous Time Semantics. CoRR (2018)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Deque Languages, Automata and Planar Graphs. DLT (2018)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Non-erasing Chomsky-Sch{ü}tzenberger theorem with grammar-independent alphabet. CoRR (2018)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Deque languages, automata and planar graphs. CoRR (2018)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Counter machines, Petri Nets, and consensual computation. Theor. Comput. Sci. 664 (2017)
Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
A logical characterization of timed regular languages. Theor. Comput. Sci. 658 (2017)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
The Missing Case in Chomsky-Schützenberger Theorem. LATA (2016)
Marcello M. Bersani, Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro
Efficient large-scale trace checking using mapreduce. ICSE (2016)
Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
A tool for deciding the satisfiability of continuous-time metric temporal logic. Acta Informatica 53 (2) (2016)
Marcello M. Bersani, Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro
Efficient Large-scale Trace Checking Using MapReduce. CoRR (2015)
Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
An SMT-based approach to satisfiability checking of MITL. Inf. Comput. 245 (2015)
Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro
Offline Trace Checking of Quantitative Properties of Service-Based Applications. CoRR (2014)
Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
A Logical Characterization of Timed (non-)Regular Languages. MFCS (1) (2014)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Commutative Languages and their Composition by Consensual Methods. AFL (2014)
Marcello Maria Bersani, Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro
SMT-Based Checking of SOLOIST over Sparse Traces. FASE (2014)
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) (2014)
Florent Bouchy, Alain Finkel, Pierluigi San Pietro
Dense-choice Counter Machines revisited. Theor. Comput. Sci. 542 (2014)
Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro
Offline Trace Checking of Quantitative Properties of Service-Based Applications. SOCA (2014)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Strict Local Testability with Consensus Equals Regularity, and Other Properties. Int. J. Found. Comput. Sci. 24 (6) (2013)
Marcello Maria Bersani, Matteo Rossi, Pierluigi San Pietro
Deciding the Satisfiability of MITL Specifications. GandALF (2013)
Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
Deciding Continuous-Time Metric Temporal Logic with Counting Modalities. RP (2013)
Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
A Tool for Deciding the Satisfiability of Continuous-Time Metric Temporal Logic. TIME (2013)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Deterministic Counter Machines and Parallel Matching Computations. CIAA (2013)
Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
Bounded satisfiability checking of metric temporal logic specifications. ACM Trans. Softw. Eng. Methodol. 22 (3) (2013)
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)
Marcello M. Bersani, Achille Frigeri, Angelo Morzenti, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro
Constraint LTL Satisfiability Checking without Automata CoRR (2012)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Strict Local Testability with Consensus Equals Regularity. CIAA (2012)
Domenico Bianculli, Carlo Ghezzi, Pierluigi San Pietro
The Tale of SOLOIST: A Specification Language for Service Compositions Interactions. FACS (2012)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
From Regular to Strictly Locally Testable Languages. Int. J. Found. Comput. Sci. 23 (8) (2012)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Consensual languages and matching finite-state computations. RAIRO Theor. Informatics Appl. 45 (1) (2011)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
From Regular to Strictly Locally Testable Languages WORDS (2011)
Marcello M. Bersani, Achille Frigeri, Matteo Rossi, Pierluigi San Pietro
Completeness of the Bounded Satisfiability Problem for Constraint LTL. RP (2011)
Marcello M. Bersani, Achille Frigeri, Angelo Morzenti, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro
Bounded Reachability for Temporal Logic over Constraint Systems. TIME (2010)
Marcello M. Bersani, Achille Frigeri, Angelo Morzenti, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro
Bounded Reachability for Temporal Logic over Constraint Systems CoRR (2010)
Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
A Metric Encoding for Bounded Model Checking. FM (2009)
Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
A Metric Encoding for Bounded Model Checking (extended version) CoRR (2009)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Languages defined by consensual computations. ICTCS (2009)
Florent Bouchy, Alain Finkel, Pierluigi San Pietro
Dense-choice Counter Machines revisited INFINITY (2009)
Anna Beletska, Wlodzimierz Bielecki, Krzysztof Siedlecki, Pierluigi San Pietro
Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops. ICCSA (2) (2008)
Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time. ICTAC (2008)
Stefano Crespi-Reghizzi, Pierluigi San Pietro
Consensual Definition of Languages by Regular Sets. LATA (2008)
Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
Refining Real-Time System Specifications through Bounded Model- and Satisfiability-Checking. ASE (2008)
Wlodzimierz Bielecki, Anna Beletska, Marek Palkowski, Pierluigi San Pietro
Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations. ICA3PP (2008)
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)
Domenico Bianculli, Paola Spoletini, Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro
Model Checking Temporal Metric Specifications with Trio2Promela. FSEN (2007)
Anna Beletska, Wlodzimierz Bielecki, Pierluigi San Pietro
Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework. ISPDC (2007)
Domenico Bianculli, Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro, Paola Spoletini
Trio2Promela: A Model Checker for Temporal Metric Specifications. ICSE Companion (2007)
Marcella Anselmo, Alessandra Cherubini, Pierluigi San Pietro
Regular Languages and Associative Language Descriptions. Discret. Math. Theor. Comput. Sci. 9 (2) (2007)
Alessandra Cherubini, Stefano Crespi-Reghizzi, Matteo Pradella, Pierluigi San Pietro
Picture languages: Tiling systems versus tile rewriting grammars. Theor. Comput. Sci. 356 (1-2) (2006)
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) (2005)
Alessandro Campi, Eliseo Martinez, Pierluigi San Pietro
Experiences with a Formal Method for Design and Automatic Checking of User Interfaces. MBUI (2004)
Mario Verdicchio, Pierluigi San Pietro
Model checking-aided design of secure distributed systems. IASTED Conf. on Software Engineering (2004)
Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie
Real-Counter Automata and Their Decision Problems. FSTTCS (2004)
Oscar H. Ibarra, Zhe Dang, Pierluigi San Pietro
Verification in loosely synchronous queue-connected discrete timed automata. Theor. Comput. Sci. 290 (3) (2003)
Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro, Paola Spoletini
Model-Checking TRIO Specifications in SPIN. FME (2003)
Gaoyan Xie, Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro
Dense Counter Machines and Verification Problems. CAV (2003)
Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer
Presburger liveness verification of discrete timed automata. Theor. Comput. Sci. 299 (1-3) (2003)
Pierluigi San Pietro, Zhe Dang
Automatic Verification of Multi-queue Discrete Timed Automata. COCOON (2003)
Alessandra Cherubini, Stefano Crespi-Reghizzi, Pierluigi San Pietro
Associative language descriptions. Theor. Comput. Sci. 270 (1-2) (2002)
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)
Vincenzo Martena, Pierluigi San Pietro
Alias Analysis by Means of a Model Checker. CC (2001)
Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter. FSTTCS (2001)
Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro
A Scalable Formal Method for Design and Automatic Checking of User Interfaces. ICSE (2001)
Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer
On Presburger Liveness of Discrete Timed Automata. STACS (2001)
Alessandra Cherubini, Stefano Crespi-Reghizzi, Pierluigi San Pietro
Some Structural Properties of Associative Language Descriptions. ICTCS (2001)
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) (2000)
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluigi San Pietro
Associative definition of programming languages. Comput. Lang. 26 (2-4) (2000)
Pierluigi San Pietro, Angelo Morzenti, Sandro Morasca
Generation of Execution Sequences for Modular Time Critical Systems. IEEE Trans. Software Eng. 26 (2) (2000)
Alessandra Cherubini, Pierluigi San Pietro
Tree Adjoining Languages and Multipushdown Languages. Theory Comput. Syst. 33 (4) (2000)
Angelo Morzenti, Pierluigi San Pietro, Sandro Morasca
A Tool for Automated System Analysis based on Modular Specifications. ASE (1998)
Alberto Coen-Porisini, Matteo Pradella, Pierluigi San Pietro
A Finite-Domain Semantics for Testing Temporal Logic Specifications. FTRTFT (1998)
Sandro Morasca, Angelo Morzenti, Pierluigi San Pietro
Generating Functional Test Cases in-the-large for Time-critical Systems from Logic-based Specifications. ISSTA (1996)
Alessandra Cherubini, Pierluigi San Pietro
A Polynomial-Time Parsing Algorithm for K-Depth Languages. J. Comput. Syst. Sci. 52 (1) (1996)
Angelo Morzenti, Pierluigi San Pietro
Object-Oriented Logical Specification of Time-Critical Systems. ACM Trans. Softw. Eng. Methodol. 3 (1) (1994)
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) (1993)
Silvana Castano, Valeria De Antonellis, Pierluigi San Pietro
Reuse of Object-Oriented Requirements Specifications. ER (1993)
Miguel Felder, Pierluigi San Pietro
Finite Time Semantics for Executable Logic Specifications. NATO ASI RTC (1992)
Miguel Felder, Pierluigi San Pietro
Testing by Executing Logic Specifications. NATO ASI RTC (1992)
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)
Angelo Morzenti, Pierluigi San Pietro
An Object-Oriented Logic Language for Modular System Specification. ECOOP (1991)