default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco Alberti
Person information
- affiliation: University of Lugano, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c22]Francesco Alberti
, Barbara Chiarelli:
Accessible-to-All Cities. A Project of Networking Italian Experiences to Raise Awareness and Promote Universal Design. UD 2022: 111-119
2010 – 2019
- 2017
- [j6]Francesco Alberti, Silvio Ghilardi, Elena Pagani:
Cardinality constraints for arrays (decidability results and applications). Formal Methods Syst. Des. 51(3): 545-574 (2017) - [j5]Francesco Alberti, Silvio Ghilardi, Natasha Sharygina:
A Framework for the Verification of Parameterized Infinite-state Systems. Fundam. Informaticae 150(1): 1-24 (2017) - 2016
- [c21]Sauro Vicini, Francesco Alberti, Nicolás Notario, Alberto Crespo, Juan Ramón Troncoso-Pastoriza, Alberto Sanna:
Co-creating Security-and-Privacy-by-Design Systems. ARES 2016: 768-775 - [c20]Francesco Alberti, Silvio Ghilardi, Elena Pagani:
Counting Constraints in Flat Array Fragments. IJCAR 2016: 65-81 - [c19]Francesco Alberti, Silvio Ghilardi, Andrea Orsini, Elena Pagani:
Counter Abstractions in Model Checking of Distributed Broadcast Algorithms: Some Case Studies. CILC 2016: 102-117 - [c18]Sauro Vicini, Adriano Gariglio, Francesco Alberti, Elettra Oleari, Alberto Sanna:
Enhancing Personas for Well-Being e-Services and Product Service Systems. HCI (16) 2016: 365-376 - [i3]Francesco Alberti, Silvio Ghilardi, Elena Pagani:
Counting Constraints in Flat Array Fragments. CoRR abs/1602.00458 (2016) - 2015
- [j4]Francesco Alberti, Silvio Ghilardi, Natasha Sharygina:
Decision Procedures for Flat Array Properties. J. Autom. Reason. 54(4): 327-352 (2015) - [c17]Francesco Alberti, Silvio Ghilardi, Natasha Sharygina:
A New Acceleration-Based Combination Framework for Array Properties. FroCos 2015: 169-185 - [c16]Francesco Alberti, David Monniaux:
Polyhedra to the rescue of array interpolants. SAC 2015: 1745-1750 - [c15]David Monniaux, Francesco Alberti:
A Simple Abstraction of Arrays and Maps by Program Translation. SAS 2015: 217-234 - [i2]David Monniaux, Francesco Alberti:
A simple abstraction of arrays and maps by program translation. CoRR abs/1506.04161 (2015) - 2014
- [j3]Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise, Natasha Sharygina:
An extension of lazy abstraction with interpolation for programs with arrays. Formal Methods Syst. Des. 45(1): 63-109 (2014) - [c14]Francesco Alberti, Silvio Ghilardi, Natasha Sharygina:
Booster: An Acceleration-Based Verification Framework for Array Programs. ATVA 2014: 18-23 - [c13]Francesco Alberti, Silvio Ghilardi, Natasha Sharygina:
A Framework for the Verification of Parameterized Infinite-State Systems. CILC 2014: 303-308 - [c12]Francesco Alberti, Silvio Ghilardi, Natasha Sharygina:
Decision Procedures for Flat Array Properties. SMT 2014: 51 - [c11]Nicolas Latorre, Francesco Alberti, Natasha Sharygina:
Verige: verification with invariant generation engine. SPIN 2014: 121-124 - [c10]Francesco Alberti, Silvio Ghilardi, Natasha Sharygina:
Decision Procedures for Flat Array Properties. TACAS 2014: 15-30 - [c9]Francesco Alberti, Silvio Ghilardi, Natasha Sharygina:
Monotonic Abstraction Techniques: from Parametric to Software Model Checking. MOD* 2014: 1-11 - 2013
- [c8]Francesco Alberti, Silvio Ghilardi, Natasha Sharygina:
Definability of Accelerated Relations in a Theory of Arrays and Its Applications. FroCos 2013: 23-39 - [c7]Francesco Alberti, Silvio Ghilardi, Natasha Sharygina:
Acceleration-based safety decision procedure for programs with arrays. LPAR (short papers) 2013: 1-8 - [i1]Francesco Alberti, Silvio Ghilardi, Natasha Sharygina:
Abstraction and Acceleration in SMT-based Model-Checking for Array Programs. CoRR abs/1304.4499 (2013) - 2012
- [j2]Francesco Alberti, Silvio Ghilardi, Elena Pagani, Silvio Ranise, Gian Paolo Rossi:
Universal Guards, Relativization of Quantifiers, and Failure Models in Model Checking Modulo Theories. J. Satisf. Boolean Model. Comput. 8(1/2): 29-61 (2012) - [c6]Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise, Natasha Sharygina:
Reachability Modulo Theory Library. SMT@IJCAR 2012: 67-76 - [c5]Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise, Natasha Sharygina:
SAFARI: SMT-Based Abstraction for Arrays with Interpolants. CAV 2012: 679-685 - [c4]Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise, Natasha Sharygina:
Lazy Abstraction with Interpolants for Arrays. LPAR 2012: 46-61 - 2011
- [c3]Francesco Alberti, Alessandro Armando, Silvio Ranise:
ASASP: Automated Symbolic Analysis of Security Policies. CADE 2011: 26-33 - [c2]Francesco Alberti, Alessandro Armando, Silvio Ranise:
Efficient symbolic automated analysis of administrative attribute-based RBAC-policies. AsiaCCS 2011: 165-175 - 2010
- [j1]Francesco Alberti, Silvio Ghilardi, Elena Pagani, Silvio Ranise, Gian Paolo Rossi:
Automated Support for the Design and Validation of Fault Tolerant Parameterized Systems: a case study. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 35 (2010) - [c1]Francesco Alberti, Silvio Ghilardi, Elena Pagani, Silvio Ranise, Gian Paolo Rossi:
Brief Announcement: Automated Support for the Design and Validation of Fault Tolerant Parameterized Systems - A Case Study. DISC 2010: 392-394
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
