Folgen
Marcello M. Bersani
Marcello M. Bersani
Post-doc researcher, Politecnico di Milano
Bestätigte E-Mail-Adresse bei elet.polimi.it
Titel
Zitiert von
Zitiert von
Jahr
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
542016
Towards the formalization of properties of cloud-based elastic systems
MM Bersani, D Bianculli, S Dustdar, A Gambi, C Ghezzi, S Krstić
proceedings of the 6th international workshop on principles of engineering …, 2014
482014
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
SMT-based verification of LTL specification with integer constraints and its application to runtime checking of service substitutability
MM Bersani, L Cavallaro, A Frigeri, M Pradella, M Rossi
2010 8th IEEE International Conference on Software Engineering and Formal …, 2010
272010
Formal verification of human-robot interaction in healthcare scenarios
L Lestingi, M Askarpour, MM Bersani, M Rossi
Software Engineering and Formal Methods: 18th International Conference, SEFM …, 2020
232020
Continuous architecting of stream-based systems
MM Bersani, F Marconi, DA Tamburri, P Jamshidi, A Nodari
2016 13th Working IEEE/IFIP Conference on Software Architecture (WICSA), 146-151, 2016
232016
The cost of formal verification in adaptive CPS. An example of a virtualized server node
MM Bersani, M Garcia-Valls
2016 IEEE 17th International Symposium on High Assurance Systems Engineering …, 2016
232016
Online verification in cyber‐physical systems: Practical bounds for meaningful temporal costs
MM Bersani, M García‐Valls
Journal of Software: Evolution and Process 30 (3), 2018
212018
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
212016
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
212011
SMT-based checking of SOLOIST over sparse traces
MM Bersani, D Bianculli, C Ghezzi, S Krstić, P San Pietro
Fundamental Approaches to Software Engineering: 17th International …, 2014
202014
Constraint LTL satisfiability checking without automata
MM Bersani, A Frigeri, A Morzenti, M Pradella, M Rossi, P San Pietro
Journal of Applied Logic 12 (4), 522-557, 2014
192014
PuRSUE-from specification of robotic environments to synthesis of controllers
MM Bersani, M Soldo, C Menghi, P Pelliccione, M Rossi
Formal Aspects of Computing 32, 187-227, 2020
172020
An SMT-based approach to satisfiability checking of MITL
MM Bersani, M Rossi, P San Pietro
Information and Computation 245, 72-97, 2015
172015
Deciding the satisfiability of MITL specifications
MM Bersani, M Rossi, PS Pietro
arXiv preprint arXiv:1307.4469, 2013
172013
DevOps Service Observability By-Design: Experimenting with Model-View-Controller
DA Tamburri, MM Bersani, R Mirandola, G Pea
Service-Oriented and Cloud Computing: 7th IFIP WG 2.14 European Conference …, 2018
152018
RoboMAX: Robotic mission adaptation exemplars
M Askarpour, C Tsigkanos, C Menghi, R Calinescu, P Pelliccione, ...
2021 International Symposium on Software Engineering for Adaptive and Self …, 2021
142021
Expressiveness and complexity of regular pure two-dimensional context-free languages
MM Bersani, A Frigeri, A Cherubini
International Journal of Computer Mathematics 90 (8), 1708-1733, 2013
132013
On some classes of 2D languages and their relations
MM Bersani, A Frigeri, A Cherubini
Combinatorial Image Analysis: 14th International Workshop, IWCIA 2011 …, 2011
132011
Specification, stochastic modeling and analysis of interactive service robotic applications
L Lestingi, D Zerla, MM Bersani, M Rossi
Robotics and Autonomous Systems 163, 104387, 2023
122023
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20