Urmăriți
Pierluigi San Pietro
Pierluigi San Pietro
Politecnico di Milano
Adresă de e-mail confirmată pe polimi.it
Titlu
Citat de
Citat de
Anul
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
1151994
A scalable formal method for design and automatic checking of user interfaces
J Berstel, SC Reghizzi, G Roussel, PS Pietro
ACM Transactions on Software Engineering and Methodology (TOSEM) 14 (2), 124-167, 2005
832005
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
651993
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
552012
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
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
512016
A Petri net and logic approach to the specification and verification of real time systems
D MANDRIOLI, AC MORZENTI, PSS SAN PIETRO
Formal Methods for Real-Time Computing, 1996
391996
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
382013
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
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
352010
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
331991
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
312003
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
282006
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
282003
Liveness verification of reversal-bounded multicounter machines with a free counter
Z Dang, OH Ibarra, PS Pietro
FST TCS 2001: Foundations of Software Technology and Theoretical Computer …, 2001
282001
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
An object-oriented logic language for modular system specification
A Morzenti, P San Pietro
ECOOP'91 European Conference on Object-Oriented Programming: Geneva …, 1991
211991
Completeness of the bounded satisfiability problem for constraint LTL
MM Bersani, A Frigeri, M Rossi, P San Pietro
Reachability Problems: 5th International Workshop, RP 2011, Genoa, Italy …, 2011
202011
A metric encoding for bounded model checking (extended version)
M Pradella, A Morzenti, P San Pietro
Arxiv preprint arXiv:0907.3085, 2009
20*2009
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20