Musab A AlTurki
Applied Filters
- Musab A AlTurki
- AuthorRemove filter
People
Colleagues
- José Meseguer (6)
- Andre Scedrov (4)
- Carolyn L Talcott (4)
- Max I Kanovich (4)
- Tajana Ban Kirigin (4)
- Vivek Nigam (4)
- Carl A Gunter (2)
- Grigore Roşu (2)
- Ajay Chander (1)
- Dachuan Yu (1)
- Dinakar Dhurjati (1)
- Himanshu Khurana (1)
- Hiroshi Inamura (1)
- Karl Palmskog (1)
- Martin Wirsing (1)
- Rakesh B Bobba (1)
- Ralf Sasse (1)
- Ravinder Shankesi (1)
- Victor M Luchangco (1)
Publication
Proceedings/Book Names
- Formal Methods. FM 2019 International Workshops (2)
- 2017 IEEE International Conference on Information Reuse and Integration (IRI) (1)
- ASIACCS '09: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security (1)
- CALCO'11: Proceedings of the 4th international conference on Algebra and coalgebra in computer science (1)
- CPS-SPC '18: Proceedings of the 2018 Workshop on Cyber-Physical Systems Security and PrivaCy (1)
- ESORICS'09: Proceedings of the 14th European conference on Research in computer security (1)
- FASE '09: Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009 (1)
- FASE'12: Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering (1)
- PPDP '07: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (1)
- Theoretical Aspects of Computing – ICTAC 2022 (1)
Publication Date
Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- Article
On the Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems
- Musab A. Alturki
Runtime Verification Inc., Urbana, IL, USA
KFUPM, Dhahran, Saudi Arabia
, - Tajana Ban Kirigin
Faculty of Mathematics, University of Rijeka, Rijeka, Croatia
, - Max Kanovich
University College, London, UK
, - Vivek Nigam
Federal University of Paraíba, João Pessoa, Brazil
Munich Research Center, Huawei, Munich, Germany
, - Andre Scedrov
University of Pennsylvania, Philadelphia, USA
, - Carolyn Talcott
SRI International, Menlo Park, USA
Theoretical Aspects of Computing – ICTAC 2022•September 2022, pp 96-113• https://doi.org/10.1007/978-3-031-17715-6_8AbstractCyber-Physical Systems (CPS) are used to perform complex, safety-critical missions autonomously. Examples include applications of autonomous vehicles and drones. Given the complexity of these systems, CPS must be able to adapt to possible changes ...
- 0Citation
MetricsTotal Citations0
- Musab A. Alturki
- research-articlePublic Access
On the Security and Complexity of Periodic Systems
- Musab A. Alturki
KFUPM, Dhahran, Saudi Arabia
Runtime Verification Inc., Urbana, IL, USA
, - Tajana Ban Kirigin
Faculty of Mathematics, University of Rijeka, Rijeka, Croatia
, - Max Kanovich
University College London, London, UK
, - Vivek Nigam
Federal University of Paraíba, João Pessoa, Brazil
Munich Research Center, Huawei, Munich, Germany
, - Andre Scedrov
University of Pennsylvania, Philadelphia, PA, USA
, - Carolyn Talcott
SRI International, Menlo Park, CA, USA
AbstractRecent years have seen a tremendous increase in the reliance of industrial systems on a variety of interconnected components ranging in complexity from simple sensors to more complex cyber-physical and Internet of Things (IoT) devices, a class of ...
- 0Citation
MetricsTotal Citations0
- Musab A. Alturki
- research-article
Resource and timing aspects of security protocols
- Abraão Aires Urquiza
Federal University of Paraíba, João Pessoa, Brazil
, - Musab A. Alturki
KFUPM, Dhahran, Saudi Arabia
Runtime Verification Inc., USA
, - Tajana Ban Kirigin
Department of Mathematics, University of Rijeka, Rijeka, Croatia
, - Max Kanovich
University College London, London, UK
National Research University Higher School of Economics, Moscow, Russian Federation
, - Vivek Nigam
fortiss, Germany
Federal University of Paraíba, João Pessoa, Brazil
, - Andre Scedrov
University of Pennsylvania, Philadelphia, PA, USA
National Research University Higher School of Economics, Moscow, Russian Federation, until July 2020
, - Carolyn Talcott
SRI International, Menlo Park, CA, USA
Journal of Computer Security, Volume 29, Issue 3•2021, pp 299-340 • https://doi.org/10.3233/JCS-200012Protocol security verification is one of the best success stories of formal methods. However, some aspects important to protocol security, such as time and resources, are not covered by many formal models. While timing issues involve e.g., network delays ...
- 3Citation
MetricsTotal Citations3
- Abraão Aires Urquiza
- Article
Towards a Verified Model of the Algorand Consensus Protocol in Coq
- Musab A. Alturki
Runtime Verification, Inc., Urbana, IL, USA
, - Jing Chen
Algorand, Inc., Boston, MA, USA
, - Victor Luchangco
Algorand, Inc., Boston, MA, USA
, - Brandon Moore
Runtime Verification, Inc., Urbana, IL, USA
, - Karl Palmskog
KTH Royal Institute of Technology, Stockholm, Sweden
, - Lucas Peña
University of Illinois at Urbana-Champaign, Urbana, IL, USA
, - Grigore Roşu
University of Illinois at Urbana-Champaign, Urbana, IL, USA
Formal Methods. FM 2019 International Workshops•October 2019, pp 362-367• https://doi.org/10.1007/978-3-030-54994-7_27AbstractThe Algorand blockchain is a secure and decentralized public ledger based on pure proof of stake rather than proof of work. At its core it is a novel consensus protocol with exactly one block certified in each round: that is, the protocol ...
- 1Citation
MetricsTotal Citations1
- Musab A. Alturki
- Article
Statistical Model Checking of RANDAO’s Resilience to Pre-computed Reveal Strategies
- Musab A. Alturki
Runtime Verification Inc., 61801, Urbana, IL, USA
King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia
, - Grigore Roşu
Runtime Verification Inc., 61801, Urbana, IL, USA
University of Illinois at Urbana-Champaign, 61801, Urbana, IL, USA
Formal Methods. FM 2019 International Workshops•October 2019, pp 337-349• https://doi.org/10.1007/978-3-030-54994-7_25AbstractRANDAO is a commit-reveal scheme for generating pseudo-random numbers in a decentralized fashion. The scheme is used in emerging blockchain systems as it is widely believed to provide randomness that is unpredictable and hard to manipulate by ...
- 2Citation
MetricsTotal Citations2
- Musab A. Alturki
- research-articlePublic AccessPublished By ACMPublished By ACM
Statistical Model Checking of Distance Fraud Attacks on the Hancke-Kuhn Family of Protocols
- Musab A. Alturki
King Fahd University of Petroleum and Minerals & Runtime Verification Inc., Dhahran, Saudi Arabia
, - Max Kanovich
University College London & NRU HSE, London, United Kingdom
, - Tajana Ban Kirigin
University of Rijeka, Rijeka, Croatia
, - Vivek Nigam
Federal University of Paraíba & fortiss, Paraiba, Brazil
, - Andre Scedrov
University of Pennsylvania & NRU HSE, Philadelphia, PA, USA
, - Carolyn Talcott
SRI International, Menlo Park, USA
CPS-SPC '18: Proceedings of the 2018 Workshop on Cyber-Physical Systems Security and PrivaCy•October 2018, pp 60-71• https://doi.org/10.1145/3264888.3264895Distance-bounding (DB) protocols protect against relay attacks on proximity-based access control systems. In a DB protocol, the verifier computes an upper bound on the distance to the prover by measuring the time-of-flight of exchanged messages. DB ...
- 7Citation
- 348
- Downloads
MetricsTotal Citations7Total Downloads348Last 12 Months46Last 6 weeks8
- Musab A. Alturki
- research-article
A Symbolic Rewriting Semantics of the COMPASS Modeling Language
2017 IEEE International Conference on Information Reuse and Integration (IRI)•August 2017, pp 283-290• https://doi.org/10.1109/IRI.2017.62Modern information systems are built through the integration of different, autonomous components that may themselves be complex systems. This Systems-of-Systems (SoS) architecture is foreseen to underlie future information systems primarily because it ...
- 0Citation
MetricsTotal Citations0
- Article
Stable availability under denial of service attacks through formal patterns
- Jonas Eckhardt
Ludwig Maximilian University of Munich, Germany and Technical University of Munich, Germany and University of Augsburg, Germanny
, - Tobias Mühlbauer
Ludwig Maximilian University of Munich, Germany and Technical University of Munich, Germany and University of Augsburg, Germanny
, - Musab AlTurki
University of Illinois, Urbana-Champaign
, - José Meseguer
University of Illinois, Urbana-Champaign
, - Martin Wirsing
Ludwig Maximilian University of Munich, Germany and IMDEA Software, Spain
FASE'12: Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering•March 2012, pp 78-93• https://doi.org/10.1007/978-3-642-28872-2_6Availability is an important security property for Internet services and a key ingredient of most service level agreements. It can be compromised by distributed Denial of Service (DoS) attacks. In this work we propose a formal pattern-based approach to ...
- 6Citation
MetricsTotal Citations6
- Jonas Eckhardt
- Article
PVESTA: a parallel statistical model checking and quantitative analysis tool
- Musab AlTurki
University of Illinois at Urbana-Champaign, Urbana, IL
, - José Meseguer
University of Illinois at Urbana-Champaign, Urbana, IL
CALCO'11: Proceedings of the 4th international conference on Algebra and coalgebra in computer science•August 2011, pp 386-392Statistical model checking is an attractive formal analysis method for probabilistic systems such as, for example, cyber-physical systems which are often probabilistic in nature. This paper is about drastically increasing the scalability of statistical ...
- 17Citation
MetricsTotal Citations17
- Musab AlTurki
- Article
Model-checking DoS amplification for VoIP session initiation
- Ravinder Shankesi
University of Illinois at Urbana-Champaign, Urbana, IL
, - Musab AlTurki
University of Illinois at Urbana-Champaign, Urbana, IL
, - Ralf Sasse
University of Illinois at Urbana-Champaign, Urbana, IL
, - Carl A. Gunter
University of Illinois at Urbana-Champaign, Urbana, IL
, - José Meseguer
University of Illinois at Urbana-Champaign, Urbana, IL
ESORICS'09: Proceedings of the 14th European conference on Research in computer security•September 2009, pp 390-405Current techniques for the formal modeling analysis of DoS attacks do not adequately deal with amplification attacks that may target a complex distributed system as a whole rather than a specific server. Such threats have emerged for important ...
- 0Citation
MetricsTotal Citations0
- Ravinder Shankesi
- Article
Formal Specification and Analysis of Timing Properties in Software Systems
- Musab Alturki
University of Illinois at Urbana-Champaign, Urbana, USA IL 61801
, - Dinakar Dhurjati
DOCOMO USA Labs, Palo Alto, USA CA 94304
, - Dachuan Yu
DOCOMO USA Labs, Palo Alto, USA CA 94304
, - Ajay Chander
DOCOMO USA Labs, Palo Alto, USA CA 94304
, - Hiroshi Inamura
DOCOMO USA Labs, Palo Alto, USA CA 94304
FASE '09: Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009•March 2009, pp 262-277• https://doi.org/10.1007/978-3-642-00593-0_18Specifying and analyzing timing properties is a critical but error-prone aspect of developing many modern software systems. In this paper, we propose a new specification language and analysis framework for expressing and analyzing timing behaviors of ...
- 6Citation
MetricsTotal Citations6
- Musab Alturki
- research-articlePublished By ACMPublished By ACM
PBES: a policy based encryption system with application to data sharing in the power grid
- Rakesh Bobba
University of Illinois at Urbana-Champaign
, - Himanshu Khurana
University of Illinois at Urbana-Champaign
, - Musab AlTurki
University of Illinois at Urbana-Champaign
, - Farhana Ashraf
University of Illinois at Urbana-Champaign
ASIACCS '09: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security•March 2009, pp 262-275• https://doi.org/10.1145/1533057.1533093In distributed systems users need the ability to share sensitive content with multiple other recipients based on their ability to satisfy arbitrary policies. One such system is electricity grids where finegrained sensor data sharing holds the potential ...
- 33Citation
- 628
- Downloads
MetricsTotal Citations33Total Downloads628Last 12 Months4Last 6 weeks2
- Rakesh Bobba
- article
Probabilistic Modeling and Analysis of DoS Protection for the ASV Protocol
- Musab AlTurki
Department of Computer Science, University of Illinois at Urbana Champaign, Urbana, USA
, - José Meseguer
Department of Computer Science, University of Illinois at Urbana Champaign, Urbana, USA
, - Carl A. Gunter
Department of Computer Science, University of Illinois at Urbana Champaign, Urbana, USA
Electronic Notes in Theoretical Computer Science (ENTCS), Volume 234•March, 2009, pp 3-18 • https://doi.org/10.1016/j.entcs.2009.02.069The Adaptive Selective Verification (ASV) protocol was recently proposed as an effective and efficient DoS countermeasure within the shared channel model, in which clients and attackers probabilistically share communication bandwidth with the server. ...
- 9Citation
MetricsTotal Citations9
- Musab AlTurki
- article
Reduction Semantics and Formal Analysis of Orc Programs
- Musab AlTurki
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA
, - José Meseguer
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA
Electronic Notes in Theoretical Computer Science (ENTCS), Volume 200, Issue 3•May, 2008, pp 25-41 • https://doi.org/10.1016/j.entcs.2008.04.091Orc is a language for orchestration of web services developed by J. Misra that offers simple, yet powerful and elegant, constructs to program sophisticated web orchestration applications. The formal semantics of Orc poses interesting challenges, because ...
- 7Citation
MetricsTotal Citations7
- Musab AlTurki
- ArticlePublished By ACMPublished By ACM
Real-time rewriting semantics of orc
- Musab AlTurki
University of Illinois at Urbana-Champaign
, - José Meseguer
University of Illinois at Urbana-Champaign
PPDP '07: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming•July 2007, pp 131-142• https://doi.org/10.1145/1273920.1273938Orc is a language proposed by Jayadev Misra [19] for orchestration of distributed services. Orc is very simple and elegant, based on a few basic constructs, and allows succinct and understandable programming of sophisticated applications. However, ...
- 13Citation
- 234
- Downloads
MetricsTotal Citations13Total Downloads234Last 12 Months1
- Musab AlTurki
Author Profile Pages
- Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples: - History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
- Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.
Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
- Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
- Future Direction:
The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.
A direct search interface for Author Profiles will be built.
An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.
It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.
Bibliometrics
The ACM DL is a comprehensive repository of publications from the entire field of computing.
It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.
- Average citations per article = The total Citation Count divided by the total Publication Count.
- Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
- Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
- Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
- Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
- Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
- Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
- Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
- Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)
ACM Author-Izer Service
Summary Description
ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.
Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.
ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.
To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.
How ACM Author-Izer Works
Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.
The Service can be applied to all the articles you have ever published with ACM.
Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.
For authors who do not have a free ACM Web Account:
- Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.
For authors who have an ACM web account, but have not edited their ACM Author Profile page:
- Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.
For authors who have an account and have already edited their Profile Page:
- Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"
ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.
Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.
FAQ
- Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
- Q. What articles are eligible for ACM Author-Izer?
- A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.
- Q. Are there any restrictions on authors to use this service?
- A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.
- Q. What are the requirements to use this service?
- A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.
- Q. What is an ACM Author Profile Page?
- A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.
- Q. How do I find my Author Profile page and take ownership?
- A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours
- Q. Why does my photo not appear?
- A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters
- Q. What if I cannot find the Add Personal Information function on my author page?
- A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.
- Q. What happens if an author changes the location of his bibliography or moves to a new institution?
- A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.
- Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
- A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.
However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.
- Q. What happens if the author’s bibliography lives on a page with several aliases?
- A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.
- Q. Why should authors use ACM Author-Izer?
- A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.
- Q. Does ACM Author-Izer provide benefits for authors?
- A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.
Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.
- Q. How does ACM Author-Izer benefit the computing community?
- A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.
In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.
- Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
- A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.
- Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
- A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner