Folgen
Pierluigi San Pietro
Pierluigi San Pietro
Politecnico di Milano
Bestätigte E-Mail-Adresse bei polimi.it
Titel
Zitiert von
Zitiert von
Jahr
Object-oriented logical specification of time-critical systems
A Morzenti, P San Pietro
ACM Transactions on Software Engineering and Methodology (TOSEM) 3 (1), 56-98, 1994
1191994
A scalable formal method for design and automatic checking of user interfaces
J Berstel, S Crespi Reghizzi, G Roussel, P San Pietro
ACM Transactions on Software Engineering and Methodology (TOSEM) 14 (2), 124-167, 2005
832005
Embedding time granularity in a logical specification language for synchronous real-time systems
E Ciapessoni, E Corsetti, A Montanari, P San Pietro
Science of computer programming 20 (1-2), 141-171, 1993
671993
Bounded satisfiability checking of metric temporal logic specifications
M PRADELLA, A MORZENTI, P SAN PIETRO
ACM Transactions on Software Engineering and Methodology (TOSEM). To appear, 2012
582012
Managing different time granularities of clinical information by an interval-based temporal data model
C Combi, F Pinciroli, G Pozzi
Methods of information in medicine 34 (05), 458-474, 1995
571995
A tool for deciding the satisfiability of continuous-time metric temporal logic
MM Bersani, M Rossi, P San Pietro
Acta Informatica 53 (2), 171-206, 2016
562016
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
M Pradella, A Morzenti, P San Pietro
Proceedings of the the 6th joint meeting of the European software …, 2007
532007
The tale of SOLOIST: a specification language for service compositions interactions
D Bianculli, C Ghezzi, P San Pietro
Formal Aspects of Component Software: 9th International Symposium, FACS 2012 …, 2013
412013
A Petri net and logic approach to the specification and verification of real time systems
D Mandrioli, AC Morzenti, M Pezze, PSS San Pietro
Formal Methods for Real-Time Computing, 1996
381996
Bounded reachability for temporal logic over constraint systems
MM Bersani, A Frigeri, A Morzenti, M Pradella, M Rossi, P San Pietro
2010 17th International Symposium on Temporal Representation and Reasoning …, 2010
372010
Refining real-time system specifications through bounded model-and satisfiability-checking
M Pradella, A Morzenti, P San Pietro
2008 23rd IEEE/ACM International Conference on Automated Software …, 2008
372008
Practical model checking of LTL with past
M Pradella, P San Pietro, P Spoletini, A Morzenti
ATVA03: 1st Workshop on Automated Technology for Verification and Analysis, 2003
332003
Dealing with different time scales in formal specifications
E Corsetti, E Crivelli, D Mandrioli, A Montanari, AC Morzenti, P San Pietro, ...
Proceedings of the Sixth International Workshop on Software Specification …, 1991
321991
Picture languages: Tiling systems versus tile rewriting grammars
A Cherubini, SC Reghizzi, M Pradella, P San Pietro
Theoretical Computer Science 356 (1-2), 90-103, 2006
302006
Liveness verification of reversal-bounded multicounter machines with a free counter
Z Dang, OH Ibarra, PS Pietro
International Conference on Foundations of Software Technology and …, 2001
302001
Model-checking TRIO specifications in SPIN
A Morzenti, M Pradella, P San Pietro, P Spoletini
FME 2003: Formal Methods: International Symposium of Formal Methods Europe …, 2003
292003
Generating functional test cases in-the-large for time-critical systems from logic-based specifications
S Morasca, A Morzenti, P SanPietro
ACM SIGSOFT Software Engineering Notes 21 (3), 39-52, 1996
231996
Efficient large-scale trace checking using MapReduce
MM Bersani, D Bianculli, C Ghezzi, S Krstić, PS Pietro
Proceedings of the 38th International Conference on Software Engineering …, 2016
222016
Presburger liveness verification of discrete timed automata
Z Dang, P San Pietro, RA Kemmerer
Theoretical Computer Science 299 (1-3), 413-438, 2003
222003
Generation of execution sequences for modular time critical systems
PS Pietro, A Morzenti, S Morasca
IEEE Transactions on Software Engineering 26 (2), 128-149, 2000
222000
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20