| 2011 |
| 46 | Consensual languages and matching finite-state computations. Stefano Crespi-Reghizzi, Pierluigi San Pietro. RAIRO - Theor. Inf. and Applic. (45): 77-97 (2011). Web SearchBibTeXDownload |
| 45 | Completeness of the Bounded Satisfiability Problem for Constraint LTL. Marcello M. Bersani, Achille Frigeri, Matteo Rossi, Pierluigi San Pietro. RP 2011, 58-71. Web SearchBibTeXDownload |
| 44 | From Regular to Strictly Locally Testable Languages. Stefano Crespi-Reghizzi, Pierluigi San Pietro. WORDS 2011, 103-111. Web SearchBibTeXDownload |
| 2010 |
| 43 | Bounded Reachability for Temporal Logic over Constraint Systems. Marcello M. Bersani, Achille Frigeri, Angelo Morzenti, Matteo Pradella, Matteo Rossi, Pierluigi San Pietro. CoRR (abs/1004.1077) (2010). Web SearchBibTeXDownload |
| 2009 |
| 42 | A Metric Encoding for Bounded Model Checking (extended version). Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro. CoRR (abs/0907.3085) (2009). Web SearchBibTeXDownload |
| 41 | A Metric Encoding for Bounded Model Checking. Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro. FM 2009, 741-756. Web SearchBibTeXDownload |
| 40 | Languages defined by consensual computations. Stefano Crespi-Reghizzi, Pierluigi San Pietro. ICTCS 2009, 82-85. Web SearchBibTeX |
| 39 | Dense-choice Counter Machines revisited. Florent Bouchy, Alain Finkel, Pierluigi San Pietro. INFINITY (abs/0911.3405): 3-22 (2009). Web SearchBibTeXDownload |
| 2008 |
| 38 | Refining Real-Time System Specifications through Bounded Model- and Satisfiability-Checking. Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro. ASE 2008, 119-127. Web SearchBibTeXDownload |
| 37 | Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations. Wlodzimierz Bielecki, Anna Beletska, Marek Palkowski, Pierluigi San Pietro. ICA3PP 2008, 185-195. Web SearchBibTeXDownload |
| 36 | Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops. Anna Beletska, Wlodzimierz Bielecki, Krzysztof Siedlecki, Pierluigi San Pietro. ICCSA (2) 2008, 871-886. Web SearchBibTeXDownload |
| 35 | Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time. Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro. ICTAC 2008, 290-304. Web SearchBibTeXDownload |
| 34 | Consensual Definition of Languages by Regular Sets. Stefano Crespi-Reghizzi, Pierluigi San Pietro. LATA 2008, 196-208. Web SearchBibTeXDownload |
| 2007 |
| 33 | Regular Languages and Associative Language Descriptions. Marcella Anselmo, Alessandra Cherubini, Pierluigi San Pietro. Discrete Mathematics & Theoretical Computer Science (9) (2007). Web SearchBibTeXDownload |
| 32 | The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties. Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro. ESEC/SIGSOFT FSE 2007, 312-320. Web SearchBibTeXDownload |
| 31 | Model Checking Temporal Metric Specifications with Trio2Promela. Domenico Bianculli, Paola Spoletini, Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro. FSEN 2007, 388-395. Web SearchBibTeXDownload |
| 30 | Trio2Promela: A Model Checker for Temporal Metric Specifications. Domenico Bianculli, Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro, Paola Spoletini. ICSE Companion 2007, 61-62. Web SearchBibTeXDownload |
| 29 | Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework. Anna Beletska, Wlodzimierz Bielecki, Pierluigi San Pietro. ISPDC 2007, 203-210. Web SearchBibTeXDownload |
| 2006 |
| 28 | Picture languages: Tiling systems versus tile rewriting grammars. Alessandra Cherubini, Stefano Crespi-Reghizzi, Matteo Pradella, Pierluigi San Pietro. Theor. Comput. Sci. (356): 90-103 (2006). Web SearchBibTeXDownload |
| 2005 |
| 27 | A scalable formal method for design and automatic checking of user interfaces. Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro. ACM Trans. Softw. Eng. Methodol. (14): 124-167 (2005). Web SearchBibTeXDownload |
| 2004 |
| 26 | Real-Counter Automata and Their Decision Problems. Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro, Gaoyan Xie. FSTTCS 2004, 198-210. Web SearchBibTeXDownload |
| 25 | Model checking-aided design of secure distributed systems. Mario Verdicchio, Pierluigi San Pietro. IASTED Conf. on Software Engineering 2004, 212-217. Web SearchBibTeX |
| 24 | Experiences with a Formal Method for Design and Automatic Checking of User Interfaces. Alessandro Campi, Eliseo Martinez, Pierluigi San Pietro. MBUI 2004. Web SearchBibTeXDownload |
| 2003 |
| 23 | Dense Counter Machines and Verification Problems. Gaoyan Xie, Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro. CAV 2003, 93-105. Web SearchBibTeXDownload |
| 22 | Automatic Verification of Multi-queue Discrete Timed Automata. Pierluigi San Pietro, Zhe Dang. COCOON 2003, 159-171. Web SearchBibTeXDownload |
| 21 | Model-Checking TRIO Specifications in SPIN. Angelo Morzenti, Matteo Pradella, Pierluigi San Pietro, Paola Spoletini. FME 2003, 542-561. Web SearchBibTeXDownload |
| 20 | Presburger liveness verification of discrete timed automata. Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer. Theor. Comput. Sci. (1-3): 413-438 (2003). Web SearchBibTeXDownload |
| 19 | Verification in loosely synchronous queue-connected discrete timed automata. Oscar H. Ibarra, Zhe Dang, Pierluigi San Pietro. Theor. Comput. Sci. (290): 1713-1735 (2003). Web SearchBibTeXDownload |
| 2002 |
| 18 | Associative language descriptions. Alessandra Cherubini, Stefano Crespi-Reghizzi, Pierluigi San Pietro. Theor. Comput. Sci. (270): 463-491 (2002). Web SearchBibTeXDownload |
| 2001 |
| 17 | Alias Analysis by Means of a Model Checker. Vincenzo Martena, Pierluigi San Pietro. CC 2001, 3-19. Web SearchBibTeXDownload |
| 16 | Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter. Zhe Dang, Oscar H. Ibarra, Pierluigi San Pietro. FSTTCS 2001, 132-143. Web SearchBibTeXDownload |
| 15 | A Scalable Formal Method for Design and Automatic Checking of User Interfaces. Jean Berstel, Stefano Crespi-Reghizzi, Gilles Roussel, Pierluigi San Pietro. ICSE 2001, 453-462. Web SearchBibTeX |
| 14 | Some Structural Properties of Associative Language Descriptions. Alessandra Cherubini, Stefano Crespi-Reghizzi, Pierluigi San Pietro. ICTCS 2001, 172-183. Web SearchBibTeXDownload |
| 13 | On Presburger Liveness of Discrete Timed Automata. Zhe Dang, Pierluigi San Pietro, Richard A. Kemmerer. STACS 2001, 132-143. Web SearchBibTeXDownload |
| 2000 |
| 12 | A Case Study on Applying a Tool for Automated System Analysis Based on Modular Specifications Written in TRIO. Sandro Morasca, Angelo Morzenti, Pierluigi San Pietro. Autom. Softw. Eng. (7): 125-155 (2000). Web SearchBibTeXDownload |
| 11 | Associative definition of programming languages. Stefano Crespi-Reghizzi, Matteo Pradella, Pierluigi San Pietro. Comput. Lang. (26): 105-123 (2000). Web SearchBibTeXDownload |
| 10 | Generation of Execution Sequences for Modular Time Critical Systems. Pierluigi San Pietro, Angelo Morzenti, Sandro Morasca. IEEE Trans. Software Eng. (26): 128-149 (2000). Web SearchBibTeXDownload |
| 9 | Tree Adjoining Languages and Multipushdown Languages. Alessandra Cherubini, Pierluigi San Pietro. Theory Comput. Syst. (33): 257-293 (2000). Web SearchBibTeXDownload |
| 1998 |
| 8 | A Tool for Automated System Analysis based on Modular Specifications. Angelo Morzenti, Pierluigi San Pietro, Sandro Morasca. ASE 1998, 2-11. Web SearchBibTeXDownload |
| 7 | A Finite-Domain Semantics for Testing Temporal Logic Specifications. Alberto Coen-Porisini, Matteo Pradella, Pierluigi San Pietro. FTRTFT 1998, 41-54. Cited by 6Web SearchBibTeXDownload |
| 1996 |
| 6 | Generating Functional Test Cases in-the-large for Time-critical Systems from Logic-based Specifications. Sandro Morasca, Angelo Morzenti, Pierluigi San Pietro. ISSTA 1996, 39-52. Web SearchBibTeXDownload |
| 5 | A Polynomial-Time Parsing Algorithm for K-Depth Languages. Alessandra Cherubini, Pierluigi San Pietro. J. Comput. Syst. Sci. (52): 61-79 (1996). Web SearchBibTeXDownload |
| 1994 |
| 4 | Object-Oriented Logical Specification of Time-Critical Systems. Angelo Morzenti, Pierluigi San Pietro. ACM Trans. Softw. Eng. Methodol. (3): 56-98 (1994). Web SearchBibTeXDownload |
| 1993 |
| 3 | Reuse of Object-Oriented Requirements Specifications. Silvana Castano, Valeria De Antonellis, Pierluigi San Pietro. ER 1993, 339-351. Web SearchBibTeXDownload |
| 2 | Embedding Time Granularity in a Logical Specification Language for Synchronous Real-Time Systems. Emanuele Ciapessoni, Edoardo Corsetti, Angelo Montanari, Pierluigi San Pietro. Sci. Comput. Program. (20): 141-171 (1993). Web SearchBibTeXDownload |
| 1991 |
| 1 | An Object-Oriented Logic Language for Modular System Specification. Angelo Morzenti, Pierluigi San Pietro. ECOOP 1991, 39-58. Web SearchBibTeXDownload |