Pierluigi San Pietro

107 papers A* 5A 4B 5C 12Misc 2Journal 48Unranked 29
YearRankTypeTitle / Venue / Authors
2026 J jnl
TARZAN: A Region-Based Library for Forward and Backward Reachability of Timed Automata (Extended Version).
CoRR
Andrea Manini, Matteo G. Rossi, Pierluigi San Pietro
2025 J jnl
Homomorphic Definitions of Tree Languages via Comma-Free Tree Codes.
J. Autom. Lang. Comb.
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2025 J jnl
On Decidability Timed Automata with 2 Parametric Clocks.
CoRR
Marcello M. Bersani, Matteo G. Rossi, Pierluigi San Pietro
2025 Misc conf
Random Testing of Model Checkers for Timed Automata with Automated Oracle Generation.
TASE
Andrea Manini, Matteo G. Rossi, Pierluigi San Pietro
2025 J jnl
Random Testing of Model Checkers for Timed Automata with Automated Oracle Generation.
CoRR
Andrea Manini, Matteo Rossi, Pierluigi San Pietro
2025 J jnl
Row-column combination of Dyck words.
Acta Informatica
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
2024 J jnl
From words to pictures: Row-column combinations and Chomsky-Schützenberger theorem.
Theor. Comput. Sci.
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
2024 J jnl
Regular languages as images of local functions over small alphabets.
Inf. Comput.
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2024 B conf
Row-Column Combination of Dyck Words.
SOFSEM
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
2023 — ed.
Formal Methods Teaching: 5th International Workshop, FMTea 2023, Lübeck, Germany, March 6, 2023, Proceedings
FMTea
Catherine Dubois, Pierluigi San Pietro
2023 — conf
Two-Dimensional Dyck Words (short paper) (text not included).
ICTCS
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
2023 J jnl
Two-dimensional Dyck words.
CoRR
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
2022 J jnl
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes.
CoRR
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
2022 J jnl
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes.
Theor. Comput. Sci.
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
2021 C conf
Homomorphic Characterization of Tree Languages Based on Comma-Free Encoding.
LATA
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2021 — conf
Improved Bounded Model Checking of Timed Automata.
FormaliSE@ICSE
Robert L. Smith, Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
2021 J jnl
Improved Bounded Model Checking of Timed Automata.
CoRR
Robert L. Smith, Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
2021 C conf
Reducing Local Alphabet Size in Recognizable Picture Languages.
DLT
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
2021 — conf
Reducing the Local Alphabet Size in Tiling Systems for Picture Languages.
ICTCS
Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro
2020 J jnl
Deque automata, languages, and planar graph representations.
Theor. Comput. Sci.
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2020 J jnl
Model Checking MITL Formulae on Timed Automata: A Logic-based Approach.
ACM Trans. Comput. Log.
Claudio Menghi, Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
2020 J jnl
On the initialization of clocks in timed formalisms.
Theor. Comput. Sci.
Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
2020 J jnl
Preface.
Inf. Comput.
Aniello Murano, Patricia Bouyer, Pierluigi San Pietro, Andrea Orlandini
2019 — conf
Deque Languages, Automata and Planar Graphs (text not included).
ICTCS
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2019 J jnl
Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet.
Inf. Comput.
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2019 — conf
Regular Languages as Local Functions with Small Alphabets.
CAI
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2018 J jnl
A Flexible Approach for Checking Timed Automata on Continuous Time Semantics.
CoRR
Claudio Menghi, Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
2018 C conf
Deque Languages, Automata and Planar Graphs.
DLT
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2018 J jnl
Deque languages, automata and planar graphs.
CoRR
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2018 J jnl
Non-erasing Chomsky-Sch{ü}tzenberger theorem with grammar-independent alphabet.
CoRR
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2017 J jnl
A logical characterization of timed regular languages.
Theor. Comput. Sci.
Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
2017 J jnl
Counter machines, Petri Nets, and consensual computation.
Theor. Comput. Sci.
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2017 — ed.
Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2017, Roma, Italy, 20-22 September 2017.
GandALF
Patricia Bouyer, Andrea Orlandini, Pierluigi San Pietro
2016 J jnl
A tool for deciding the satisfiability of continuous-time metric temporal logic.
Acta Informatica
Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
2016 A* conf
Efficient large-scale trace checking using mapreduce.
ICSE
Marcello M. Bersani, Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro
2016 C conf
The Missing Case in Chomsky-Schützenberger Theorem.
LATA
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2015 J jnl
An SMT-based approach to satisfiability checking of MITL.
Inf. Comput.
Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
2015 J jnl
Efficient Large-scale Trace Checking Using MapReduce.
CoRR
Marcello M. Bersani, Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro
2014 — conf
A Logical Characterization of Timed (non-)Regular Languages.
MFCS (1)
Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
2014 — conf
Commutative Languages and their Composition by Consensual Methods.
AFL
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2014 J jnl
Constraint LTL satisfiability checking without automata.
J. Appl. Log.
Marcello M. Bersani, Achille Frigeri, Angelo Morzenti, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro
2014 J jnl
Dense-choice Counter Machines revisited.
Theor. Comput. Sci.
Florent Bouchy, Alain Finkel, Pierluigi San Pietro
2014 — conf
Offline Trace Checking of Quantitative Properties of Service-Based Applications.
SOCA
Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro
2014 J jnl
Offline Trace Checking of Quantitative Properties of Service-Based Applications.
CoRR
Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro
2014 B conf
SMT-Based Checking of SOLOIST over Sparse Traces.
FASE
Marcello Maria Bersani, Domenico Bianculli, Carlo Ghezzi, Srdan Krstic, Pierluigi San Pietro
2013 C conf
A Tool for Deciding the Satisfiability of Continuous-Time Metric Temporal Logic.
TIME
Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
2013 J jnl
Bounded satisfiability checking of metric temporal logic specifications.
ACM Trans. Softw. Eng. Methodol.
Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
2013 — conf
Deciding Continuous-Time Metric Temporal Logic with Counting Modalities.
RP
Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
2013 — conf
Deciding the Satisfiability of MITL Specifications.
GandALF
Marcello Maria Bersani, Matteo Rossi, Pierluigi San Pietro
2013 C conf
Deterministic Counter Machines and Parallel Matching Computations.
CIAA
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2013 J jnl
On the Satisfiability of Metric Temporal Logics over the Reals.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol.
Marcello Maria Bersani, Matteo Rossi, Pierluigi San Pietro
2013 J jnl
Strict Local Testability with Consensus Equals Regularity, and Other Properties.
Int. J. Found. Comput. Sci.
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2012 J jnl
Constraint LTL Satisfiability Checking without Automata
CoRR
Marcello M. Bersani, Achille Frigeri, Angelo Morzenti, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro
2012 J jnl
From Regular to Strictly Locally Testable Languages.
Int. J. Found. Comput. Sci.
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2012 C conf
Strict Local Testability with Consensus Equals Regularity.
CIAA
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2012 — conf
The Tale of SOLOIST: A Specification Language for Service Compositions Interactions.
FACS
Domenico Bianculli, Carlo Ghezzi, Pierluigi San Pietro
2011 — conf
Completeness of the Bounded Satisfiability Problem for Constraint LTL.
RP
Marcello M. Bersani, Achille Frigeri, Matteo Rossi, Pierluigi San Pietro
2011 J jnl
Consensual languages and matching finite-state computations.
RAIRO Theor. Informatics Appl.
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2011 — conf
From Regular to Strictly Locally Testable Languages
WORDS
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2010 J jnl
Bounded Reachability for Temporal Logic over Constraint Systems
CoRR
Marcello M. Bersani, Achille Frigeri, Angelo Morzenti, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro
2010 C conf
Bounded Reachability for Temporal Logic over Constraint Systems.
TIME
Marcello M. Bersani, Achille Frigeri, Angelo Morzenti, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro
2009 J jnl
A Metric Encoding for Bounded Model Checking (extended version)
CoRR
Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
2009 B conf
A Metric Encoding for Bounded Model Checking.
FM
Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
2009 — conf
Dense-choice Counter Machines revisited
INFINITY
Florent Bouchy, Alain Finkel, Pierluigi San Pietro
2009 — conf
Languages defined by consensual computations.
ICTCS
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2008 C conf
Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time.
ICTAC
Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
2008 C conf
Consensual Definition of Languages by Regular Sets.
LATA
Stefano Crespi-Reghizzi, Pierluigi San Pietro
2008 C conf
Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations.
ICA3PP
Wlodzimierz Bielecki, Anna Beletska, Marek Palkowski, Pierluigi San Pietro
2008 — conf
Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops.
ICCSA (2)
Anna Beletska, Wlodzimierz Bielecki, Krzysztof Siedlecki, Pierluigi San Pietro
2008 A* conf
Refining Real-Time System Specifications through Bounded Model- and Satisfiability-Checking.
ASE
Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
2007 C conf
Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework.
ISPDC
Anna Beletska, Wlodzimierz Bielecki, Pierluigi San Pietro
2007 — conf
Model Checking Temporal Metric Specifications with Trio2Promela.
FSEN
Domenico Bianculli, Paola Spoletini, Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro
2007 J jnl
Regular Languages and Associative Language Descriptions.
Discret. Math. Theor. Comput. Sci.
Marcella Anselmo, Alessandra Cherubini, Pierluigi San Pietro
2007 — conf
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties.
ESEC/SIGSOFT FSE
Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro
2007 — conf
Trio2Promela: A Model Checker for Temporal Metric Specifications.
ICSE Companion
Domenico Bianculli, Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro, Paola Spoletini
2006 J jnl
Picture languages: Tiling systems versus tile rewriting grammars.
Theor. Comput. Sci.
Alessandra Cherubini, Stefano Crespi-Reghizzi, Matteo Pradella, Pierluigi San Pietro
2005 J jnl
A scalable formal method for design and automatic checking of user interfaces.
ACM Trans. Softw. Eng. Methodol.
Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro
2004 — conf
Experiences with a Formal Method for Design and Automatic Checking of User Interfaces.
MBUI
Alessandro Campi, Eliseo Martinez, Pierluigi San Pietro
2004 — conf
Model checking-aided design of secure distributed systems.
IASTED Conf. on Software Engineering
Mario Verdicchio, Pierluigi San Pietro
2004 — conf
Real-Counter Automata and Their Decision Problems.
FSTTCS
Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie
2003 Misc conf
Automatic Verification of Multi-queue Discrete Timed Automata.
COCOON
Pierluigi San Pietro, Zhe Dang
2003 A* conf
Dense Counter Machines and Verification Problems.
CAV
Gaoyan Xie, Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro
2003 — conf
Model-Checking TRIO Specifications in SPIN.
FME
Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro, Paola Spoletini
2003 J jnl
Presburger liveness verification of discrete timed automata.
Theor. Comput. Sci.
Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer
2003 J jnl
Verification in loosely synchronous queue-connected discrete timed automata.
Theor. Comput. Sci.
Oscar H. Ibarra, Zhe Dang, Pierluigi San Pietro
2002 J jnl
Associative language descriptions.
Theor. Comput. Sci.
Alessandra Cherubini, Stefano Crespi-Reghizzi, Pierluigi San Pietro
2002 B conf
Software procurement and methods for specification and validation in the railway transportation industry.
SMC
Umberto Foschi, Mauro Giuliani, Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro
2001 A* conf
A Scalable Formal Method for Design and Automatic Checking of User Interfaces.
ICSE
Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro
2001 B conf
Alias Analysis by Means of a Model Checker.
CC
Vincenzo Martena, Pierluigi San Pietro
2001 — conf
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter.
FSTTCS
Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro
2001 A conf
On Presburger Liveness of Discrete Timed Automata.
STACS
Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer
2001 — conf
Some Structural Properties of Associative Language Descriptions.
ICTCS
Alessandra Cherubini, Stefano Crespi-Reghizzi, Pierluigi San Pietro
2000 J jnl
A Case Study on Applying a Tool for Automated System Analysis Based on Modular Specifications Written in TRIO.
Autom. Softw. Eng.
Sandro Morasca, Angelo Morzenti, Pierluigi San Pietro
2000 J jnl
Associative definition of programming languages.
Comput. Lang.
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluigi San Pietro
2000 J jnl
Generation of Execution Sequences for Modular Time Critical Systems.
IEEE Trans. Software Eng.
Pierluigi San Pietro, Angelo Morzenti, Sandro Morasca
2000 J jnl
Tree Adjoining Languages and Multipushdown Languages.
Theory Comput. Syst.
Alessandra Cherubini, Pierluigi San Pietro
1998 — conf
A Finite-Domain Semantics for Testing Temporal Logic Specifications.
FTRTFT
Alberto Coen-Porisini, Matteo Pradella, Pierluigi San Pietro
1998 A* conf
A Tool for Automated System Analysis based on Modular Specifications.
ASE
Angelo Morzenti, Pierluigi San Pietro, Sandro Morasca
1996 J jnl
A Polynomial-Time Parsing Algorithm for K-Depth Languages.
J. Comput. Syst. Sci.
Alessandra Cherubini, Pierluigi San Pietro
1996 A conf
Generating Functional Test Cases in-the-large for Time-critical Systems from Logic-based Specifications.
ISSTA
Sandro Morasca, Angelo Morzenti, Pierluigi San Pietro
1994 J jnl
Object-Oriented Logical Specification of Time-Critical Systems.
ACM Trans. Softw. Eng. Methodol.
Angelo Morzenti, Pierluigi San Pietro
1993 J jnl
Embedding Time Granularity in a Logical Specification Language for Synchronous Real-Time Systems.
Sci. Comput. Program.
Emanuele Ciapessoni, Edoardo Corsetti, Angelo Montanari, Pierluigi San Pietro
1993 A conf
Reuse of Object-Oriented Requirements Specifications.
ER
Silvana Castano, Valeria De Antonellis, Pierluigi San Pietro
1992 — conf
Finite Time Semantics for Executable Logic Specifications.
NATO ASI RTC
Miguel Felder, Pierluigi San Pietro
1992 — conf
Testing by Executing Logic Specifications.
NATO ASI RTC
Miguel Felder, Pierluigi San Pietro
1991 A conf
An Object-Oriented Logic Language for Modular System Specification.
ECOOP
Angelo Morzenti, Pierluigi San Pietro
1991 — conf
Dealing with different time scales in formal specifications.
IWSSD
Edoardo Corsetti, Ernani Crivelli, Dino Mandrioli, Angelo Montanari, Angelo Morzenti, Pierluigi San Pietro, Elena Ratto