default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbu Naser Masud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Federico Ciccozzi
, Lorenzo Addazi, Sara Abbaspour Asadollah, Björn Lisper, Abu Naser Masud, Saad Mubeen:
A Comprehensive Exploration of Languages for Parallel Computing. ACM Comput. Surv. 55(2): 24:1-24:39 (2023)- [j7]Abu Naser Masud:
The Duality in Computing SSA Programs and Control Dependency. IEEE Trans. Software Eng. 49(4): 1766-1781 (2023) - 2022
- [j6]Abu Naser Masud:
Efficient computation of minimal weak and strong control closure. J. Syst. Softw. 184: 111140 (2022) - [c10]Abu Naser Masud, Björn Lisper:
On the computation of interprocedural weak control closure. CC 2022: 65-76 - [c9]Jean Malm, Eduard Enoiu, Abu Naser Masud, Björn Lisper, Zoltán Porkoláb, Sigrid Eldh:
An Evaluation of General-Purpose Static Analysis Tools on C/C++ Test Code. SEAA 2022: 133-140 - [c8]Abu Naser Masud:
Fast and Incremental Computation of Weak Control Closure. SAS 2022: 325-349 - 2021
- [j5]Abu Naser Masud, Björn Lisper:
Semantic Correctness of Dependence-based Slicing for Interprocedural, Possibly Nonterminating Programs. ACM Trans. Program. Lang. Syst. 42(4): 19:1-19:56 (2021) - 2020
- [j4]Abu Naser Masud, Federico Ciccozzi:
More precise construction of static single assignment programs using reaching definitions. J. Syst. Softw. 166: 110590 (2020) - [c7]Abu Naser Masud:
Simple and Efficient Computation of Minimal Weak Control Closure. SAS 2020: 200-222
2010 – 2019
- 2019
- [c6]Abu Naser Masud, Federico Ciccozzi:
Towards Constructing the SSA form using Reaching Definitions Over Dominance Frontiers. SCAM 2019: 23-33 - 2018
- [j3]Abu Naser Masud, Björn Lisper, Federico Ciccozzi:
Automatic Inference of Task Parallelism in Task-Graph-Based Actor Models. IEEE Access 6: 78965-78991 (2018) - 2015
- [c5]Husni Khanfar, Björn Lisper, Abu Naser Masud:
Static Backward Program Slicing for Safety-Critical Systems. Ada-Europe 2015: 50-65 - [c4]Björn Lisper, Abu Naser Masud, Husni Khanfar:
Static Backward Demand-Driven Slicing. PEPM 2015: 115-126 - 2013
- [j2]Elvira Albert, Samir Genaim, Abu Naser Masud:
On the Inference of Resource Usage Upper and Lower Bounds. ACM Trans. Comput. Log. 14(3): 22:1-22:35 (2013) - 2012
- [j1]Amir M. Ben-Amram, Samir Genaim, Abu Naser Masud:
On the Termination of Integer Loops. ACM Trans. Program. Lang. Syst. 34(4): 16:1-16:24 (2012) - [c3]Elvira Albert, Diego Esteban Alonso-Blas, Puri Arenas, Jesús Correas, Antonio Flores-Montoya, Samir Genaim, Miguel Gómez-Zamalloa, Abu Naser Masud, German Puebla, José Miguel Rojas, Guillermo Román-Díez, Damiano Zanardini:
Automatic Inference of Bounds on Resource Consumption. FMCO 2012: 119-144 - [c2]Amir M. Ben-Amram, Samir Genaim, Abu Naser Masud:
On the Termination of Integer Loops. VMCAI 2012: 72-87 - 2011
- [c1]Elvira Albert, Samir Genaim, Abu Naser Masud:
More Precise Yet Widely Applicable Cost Analysis. VMCAI 2011: 38-53
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-05-10 19:48 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:
