Gerardo Schneider
Applied Filters
- Gerardo Schneider
- AuthorRemove filter
People
Colleagues
- Gerardo Schneider (76)
- Gordon J Pace (23)
- César Sánchez (7)
- Eugene Asarin (7)
- Shaun Azzopardi (7)
- Cristian Prisacariu (6)
- Pablo Picazo-Sanchez (6)
- Wolfgang Ahrendt (6)
- S. Yovine (5)
- Christian Colombo (4)
- Olaf Owe (4)
- Sandro Stucki (4)
- Borzoo Bonakdarpour (3)
- David Sands (3)
- Nir Piterman (3)
- Stephen Fenech (3)
- Andrei Sabelfeld (2)
- Gilles Barthe (2)
- Martin Leucker (2)
- Thomas Troels Hildebrandt (2)
Roles
Publication
Journal/Magazine Names
- Electronic Notes in Theoretical Computer Science (ENTCS) (2)
- Formal Methods in System Design (2)
- International Journal of Information Security (2)
- Theoretical Computer Science (2)
- ACM SIGPLAN Notices (1)
- Artificial Intelligence and Law (1)
- Future Generation Computer Systems (1)
- Information and Computation (1)
- Information Sciences: an International Journal (1)
- Nordic Journal of Computing (1)
- Software and Systems Modeling (SoSyM) (1)
Proceedings/Book Names
- FormaliSE '18: Proceedings of the 6th Conference on Formal Methods in Software Engineering (2)
- ICTAC '09: Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (2)
- Leveraging Applications of Formal Methods, Verification and Validation. Industrial Practice (2)
- Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles (2)
- Automated Technology for Verification and Analysis (1)
- Automated Technology for Verification and Analysis (1)
- Automated Technology for Verification and Analysis (1)
- Cryptology and Network Security (1)
- Formal Methods – The Next 30 Years (1)
- Fundamentals of Software Engineering (1)
- Leveraging Applications of Formal Methods, Verification and Validation. Modeling (1)
- Leveraging Applications of Formal Methods, Verification and Validation. Specification and Verification (1)
- Leveraging Applications of Formal Methods, Verification and Validation. Verification (1)
- Leveraging Applications of Formal Methods, Verification and Validation: Applications (1)
- Runtime Verification (1)
- Runtime Verification (1)
- Secure IT Systems (1)
- Software Engineering and Formal Methods (1)
- Software Engineering and Formal Methods (1)
- Theoretical Aspects of Computing – ICTAC 2023 (1)
Publisher
- Springer-Verlag (45)
- Association for Computing Machinery (13)
- IEEE Computer Society (4)
- Elsevier Science Publishers B. V. (3)
- IEEE Press (3)
- Kluwer Academic Publishers (3)
- Elsevier Science Publishers Ltd. (2)
- Academic Press, Inc. (1)
- Elsevier Science Inc. (1)
- Publishing Association Nordic Journal of Computing (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
Interest Beyond Violation: On Points-of-Interest in Runtime Verification
- Christian Colombo
https://ror.org/03a62bv60Department of Computer Science, University of Malta, Msida, Malta
, - Gordon J. Pace
https://ror.org/03a62bv60Department of Computer Science, University of Malta, Msida, Malta
, - Gerardo Schneider
https://ror.org/01tm6cn81Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg, Gothenburg, Sweden
Leveraging Applications of Formal Methods, Verification and Validation. Specification and Verification•October 2024, pp 66-78• https://doi.org/10.1007/978-3-031-75380-0_5AbstractMany formal verification techniques are concerned with comparing system behaviours with formal specifications. Although runtime verification has followed this path (comparing observed traces against formal properties), it has traditionally been ...
- 1Citation
MetricsTotal Citations1
- Christian Colombo
- research-articleOpen AccessPublished By ACMPublished By ACM
HighGuard: Cross-Chain Business Logic Monitoring of Smart Contracts
- Mojtaba Eshghie
KTH Royal Institute of Technology, Stockholm, Sweden
, - Cyrille Artho
KTH Royal Institute of Technology, Stockholm, Sweden
, - Hans Stammler
KTH Royal Institute of Technology, Stockholm, Sweden
, - Wolfgang Ahrendt
Chalmers University of Technology, Stockholm, Sweden
, - Thomas Hildebrandt
University of Copenhagen, Copenhagen, Sweden
, - Gerardo Schneider
University of Gothenburg, Gothenburg, Sweden
ASE '24: Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering•October 2024, pp 2378-2381• https://doi.org/10.1145/3691620.3695356Logical flaws in smart contracts are often exploited, leading to significant financial losses. Our tool, HighGuard, detects transactions that violate business logic specifications of smart contracts. HighGuard employs dynamic condition response (DCR) ...
- 0Citation
- 67
- Downloads
MetricsTotal Citations0Total Downloads67Last 12 Months67Last 6 weeks48
- Mojtaba Eshghie
- Article
Synchronous Agents, Verification, and Blame—A Deontic View
- Karam Kharraz
https://ror.org/00t3r8h32ISP, University of Lübeck, Lübeck, Germany
, - Shaun Azzopardi
https://ror.org/01tm6cn81University of Gothenburg, Gothenburg, Sweden
, - Gerardo Schneider
https://ror.org/01tm6cn81University of Gothenburg, Gothenburg, Sweden
, - Martin Leucker
https://ror.org/00t3r8h32ISP, University of Lübeck, Lübeck, Germany
Theoretical Aspects of Computing – ICTAC 2023•December 2023, pp 332-350• https://doi.org/10.1007/978-3-031-47963-2_20AbstractA question we can ask of multi-agent systems is whether the agents’ collective interaction satisfies particular goals or specifications, which can be either individual or collective. When a collaborative goal is not reached, or a specification is ...
- 0Citation
MetricsTotal Citations0
- Karam Kharraz
- Article
Capturing Smart Contract Design with DCR Graphs
- Mojtaba Eshghie
https://ror.org/026vcq606KTH Royal Institute of Technology, Stockholm, Sweden
, - Wolfgang Ahrendt
https://ror.org/040wg7k59Chalmers University of Technology, Gothenburg, Sweden
, - Cyrille Artho
https://ror.org/026vcq606KTH Royal Institute of Technology, Stockholm, Sweden
, - Thomas Troels Hildebrandt
https://ror.org/035b05819University of Copenhagen, Copenhagen, Denmark
, - Gerardo Schneider
https://ror.org/01tm6cn81University of Gothenburg, Gothenburg, Sweden
Software Engineering and Formal Methods•November 2023, pp 106-125• https://doi.org/10.1007/978-3-031-47115-5_7AbstractSmart contracts manage blockchain assets and embody business processes. However, mainstream smart contract programming languages such as Solidity lack explicit notions of roles, action dependencies, and time. Instead, these concepts are ...
- 0Citation
MetricsTotal Citations0
- Mojtaba Eshghie
- Article
ppLTLTT : Temporal Testing for Pure-Past Linear Temporal Logic Formulae
- Shaun Azzopardi
https://ror.org/01tm6cn81University of Gothenburg, Gothenburg, Sweden
, - David Lidell
https://ror.org/01tm6cn81University of Gothenburg, Gothenburg, Sweden
, - Nir Piterman
https://ror.org/01tm6cn81University of Gothenburg, Gothenburg, Sweden
, - Gerardo Schneider
https://ror.org/01tm6cn81University of Gothenburg, Gothenburg, Sweden
Automated Technology for Verification and Analysis•October 2023, pp 276-287• https://doi.org/10.1007/978-3-031-45332-8_15AbstractThis paper presents ppLTLTT, a tool for translating pure-past linear temporal logic formulae into temporal testers in the form of automata. We show how ppLTLTT can be used to easily extend existing LTL-based tools, such as LTL-to-automata ...
- 0Citation
MetricsTotal Citations0
- Shaun Azzopardi
- Article
Model Checking Contracts – A Case Study
- Gordon Pace
Dept. of Computer Science and AI, University of Malta, Msida, Malta
, - Cristian Prisacariu
Department of Informatics – University of Oslo, P.O. Box 1080 Blindern, N-0316 Oslo, Norway
, - Gerardo Schneider
Department of Informatics – University of Oslo, P.O. Box 1080 Blindern, N-0316 Oslo, Norway
Automated Technology for Verification and Analysis•October 2007, pp 82-97• https://doi.org/10.1007/978-3-540-75596-8_8AbstractContracts are agreements between distinct parties that determine rights and obligations on their signatories, and have been introduced in order to reduce risks and to regulate inter-business relationships. In this paper we show how a conventional ...
- 1Citation
MetricsTotal Citations1
- Gordon Pace
- research-article
Are chrome extensions compliant with the spirit of least privilege?
- Pablo Picazo-Sanchez
Chalmers University of Technology, Gothenburg, Sweden
, - Lara Ortiz-Martin
Madrid, Spain
, - Gerardo Schneider
Chalmers University of Technology, Gothenburg, Sweden
, - Andrei Sabelfeld
Chalmers University of Technology, Gothenburg, Sweden
International Journal of Information Security, Volume 21, Issue 6•Dec 2022, pp 1283-1297 • https://doi.org/10.1007/s10207-022-00610-wAbstractExtensions are small applications installed by users and enrich the user experience of browsing the Internet. Browsers expose a set of restricted APIs to extensions. To be used, extensions need to list the permissions associated with these APIs in ...
- 3Citation
MetricsTotal Citations3
- Pablo Picazo-Sanchez
- research-article
Semantic Attribute-Based Encryption: A framework for combining ABE schemes with semantic technologies
- Hamed Arshad
Department of Informatics, University of Oslo, Norway
, - Christian Johansen
Norwegian University of Science and Technology, Norway
, - Olaf Owe
Department of Informatics, University of Oslo, Norway
, - Pablo Picazo-Sanchez
Chalmers University of Technology, Sweden
, - Gerardo Schneider
Department of Computer Science and Engineering, University of Gothenburg, Sweden
Information Sciences: an International Journal, Volume 616, Issue C•Nov 2022, pp 558-576 • https://doi.org/10.1016/j.ins.2022.10.132AbstractAttribute-Based Encryption (ABE) is a cryptographic solution to protect resources in a fine-grained manner based on a set of public attributes. This is similar to attribute-based access control schemes in the sense that both rely on ...
- 0Citation
MetricsTotal Citations0
- Hamed Arshad
- Article
Assumption Monitoring of Temporal Task Planning Using Stream Runtime Verification
- Felipe Gorostiaga
IMDEA Software Institute, Madrid, Spain
, - Sebastián Zudaire
Instituto Balseiro - Univ. Nacional de Cuyo, San Carlos de Bariloche, Argentina
, - César Sánchez
IMDEA Software Institute, Madrid, Spain
, - Gerardo Schneider
University of Gothenburg, Gothenburg, Sweden
, - Sebastián Uchitel
Univ. de Buenos Aires, Buenos Aires, Argentina
Imperial College London, London, UK
Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles•October 2022, pp 397-414• https://doi.org/10.1007/978-3-031-19849-6_23AbstractTemporal task planning uses formal techniques such as reactive synthesis to guarantee that a robot will succeed in its mission. This technique requires certain explicit and implicit assumptions and simplifications about the operating environment ...
- 0Citation
MetricsTotal Citations0
- Felipe Gorostiaga
- Article
Runtime Verification Meets Controller Synthesis
- Shaun Azzopardi
University of Gothenburg, Gothenburg, Sweden
, - Nir Piterman
University of Gothenburg, Gothenburg, Sweden
, - Gerardo Schneider
University of Gothenburg, Gothenburg, Sweden
Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles•October 2022, pp 382-396• https://doi.org/10.1007/978-3-031-19849-6_22AbstractReactive synthesis guarantees correct-by-construction controllers from logical specifications, but is costly—2EXPTIME-complete in the size of the specification. In a practical setting, the desired controllers need to interact with an environment, ...
- 0Citation
MetricsTotal Citations0
- Shaun Azzopardi
- Article
Runtime Verification of Kotlin Coroutines
- Denis Furian
Opera Software AB, Gothenburg, Sweden
, - Shaun Azzopardi
University of Gothenburg, Gothenburg, Sweden
, - Yliès Falcone
University Grenoble Alpes, CNRS, Grenoble INP, Inria, LIG, 38000, Grenoble, France
, - Gerardo Schneider
University of Gothenburg, Gothenburg, Sweden
AbstractKotlin was introduced to Android as the recommended language for development. One of the unique functionalities of Kotlin is that of coroutines, which are lightweight tasks that can run concurrently inside threads. Programming using coroutines is ...
- 0Citation
MetricsTotal Citations0
- Denis Furian
- research-articleOpen AccessPublished By ACMPublished By ACM
Precise Analysis of Purpose Limitation in Data Flow Diagrams
- Hanaa Alshareef
Chalmers University of Technology, Sweden
, - Katja Tuma
Vrije Universiteit Amsterdam, Netherlands
, - Sandro Stucki
Chalmers University of Technology, Sweden
, - Gerardo Schneider
University of Gothenburg, Sweden
, - Riccardo Scandariato
Hamburg University of Technology, Germany
ARES '22: Proceedings of the 17th International Conference on Availability, Reliability and Security•August 2022, Article No.: 17, pp 1-11• https://doi.org/10.1145/3538969.3539010Data Flow Diagrams (DFDs) are primarily used for modelling functional properties of a system. In recent work, it was shown that DFDs can be used to also model non-functional properties, such as security and privacy properties, if they are annotated with ...
- 4Citation
- 1,616
- Downloads
MetricsTotal Citations4Total Downloads1,616Last 12 Months1,299Last 6 weeks240
- Hanaa Alshareef
- Article
Refining Privacy-Aware Data Flow Diagrams
- Hanaa Alshareef
Chalmers University of Technology, Gothenburg, Sweden
, - Sandro Stucki
Chalmers University of Technology, Gothenburg, Sweden
, - Gerardo Schneider
University of Gothenburg, Gothenburg, Sweden
Software Engineering and Formal Methods•December 2021, pp 121-140• https://doi.org/10.1007/978-3-030-92124-8_8AbstractPrivacy, like security, is a non-functional property, yet most software design tools are focused on functional aspects, using for instance Data Flow Diagrams (DFDs). In previous work, a conceptual model was introduced where DFDs were extended into ...
- 0Citation
MetricsTotal Citations0
- Hanaa Alshareef
- Article
Incorporating Monitors in Reactive Synthesis Without Paying the Price
- Shaun Azzopardi
University of Gothenburg, Gothenburg, Sweden
, - Nir Piterman
University of Gothenburg, Gothenburg, Sweden
, - Gerardo Schneider
University of Gothenburg, Gothenburg, Sweden
Automated Technology for Verification and Analysis•October 2021, pp 337-353• https://doi.org/10.1007/978-3-030-88885-5_22AbstractTemporal synthesis attempts to construct reactive programs that satisfy a given declarative (LTL) formula. Practitioners have found it challenging to work exclusively with declarative specifications, and have found languages that combine modelling ...
- 2Citation
MetricsTotal Citations2
- Shaun Azzopardi
- Article
On the Specification and Monitoring of Timed Normative Systems
- Shaun Azzopardi
University of Gothenburg, Gothenburg, Sweden
, - Gordon Pace
University of Malta, Msida, Malta
, - Fernando Schapachnik
ICC and Departamento de Computación, FCEyN, Universidad de Buenos Aires, Buenos Aires, Argentina
, - Gerardo Schneider
University of Gothenburg, Gothenburg, Sweden
AbstractIn this article we explore different issues and design choices that arise when considering how to fully embrace timed aspects in the formalisation of normative systems, e.g., by using deontic modalities, looking primarily through the lens of ...
- 0Citation
MetricsTotal Citations0
- Shaun Azzopardi
- research-articlePublic Access
Gray-box monitoring of hyperproperties with an application to privacy
- Sandro Stucki
Department of Computer Science and Engineering, University of Gothenburg, 412 96, Gothenburg, Sweden
, - César Sánchez
IMDEA Software Institute, Campus de Montegancedo s/n, 28223, Pozuelo de Alarcon, Madrid, Spain
, - Gerardo Schneider
Department of Computer Science and Engineering, University of Gothenburg, 412 96, Gothenburg, Sweden
, - Borzoo Bonakdarpour
Department of Computer Science and Engineering, Michigan State University, 48824, East Lansing, MI, USA
Formal Methods in System Design, Volume 58, Issue 1-2•Oct 2021, pp 126-159 • https://doi.org/10.1007/s10703-020-00358-wAbstractRuntime verification is a complementary approach to testing, model checking and other static verification techniques to verify software properties. Monitorability characterizes what can be verified (monitored) at run time. Different definitions of ...
- 1Citation
MetricsTotal Citations1
- Sandro Stucki
- research-article
Assumption Monitoring Using Runtime Verification for UAV Temporal Task Plan Executions
- Sebastián Zudaire
Instituto Balseiro - Univ. Nacional de Cuyo,Argentina
, - Felipe Gorostiaga
Univ. Politécnica de Madrid,Spain
, - César Sánchez
IMDEA Software Institute,Spain
, - Gerardo Schneider
Univ. of Gothenburg,Sweden
, - Sebastián Uchitel
Univ. de Buenos Aires,Argentina
2021 IEEE International Conference on Robotics and Automation (ICRA)•May 2021, pp 6824-6830• https://doi.org/10.1109/ICRA48506.2021.9561671Temporal task planning guarantees a robot will succeed in its task as long as certain explicit and implicit assumptions about the robot’s operating environment, sensors, and capabilities hold. A robot executing a plan can silently fail to fulfill ...
- 1Citation
MetricsTotal Citations1
- Sebastián Zudaire
- research-articleOpen AccessPublished By ACMPublished By ACM
MultiCall: A Transaction-batching Interpreter for Ethereum
- William Hughes
University of Gothenburg, Gothenburg, Sweden
, - Alejandro Russo
Chalmers University of Technology, Gothenburg, Sweden
, - Gerardo Schneider
University of Gothenburg, Gothenburg, Sweden
BSCI '21: Proceedings of the 3rd ACM International Symposium on Blockchain and Secure Critical Infrastructure•May 2021, pp 25-35• https://doi.org/10.1145/3457337.3457839Smart contracts are self-executing programs running in the blockchain allowing for decentralised storage and execution without a middleman. On-chain execution is expensive, with miners charging fees for distributed execution according to a cost model ...
- 0Citation
- 5,889
- Downloads
MetricsTotal Citations0Total Downloads5,889Last 12 Months547Last 6 weeks46- 1
Supplementary MaterialBSCI 2021 MC paper talk.mp4
- William Hughes
- Article
HMAC and “Secure Preferences”: Revisiting Chromium-Based Browsers Security
- Pablo Picazo-Sanchez
Chalmers University of Technology, Gothenburg, Sweden
, - Gerardo Schneider
Chalmers University of Technology, Gothenburg, Sweden
, - Andrei Sabelfeld
Chalmers University of Technology, Gothenburg, Sweden
Cryptology and Network Security•December 2020, pp 107-126• https://doi.org/10.1007/978-3-030-65411-5_6AbstractGoogle disabled years ago the possibility to freely modify some internal configuration parameters, so options like silently (un)install browser extensions, changing the home page or the search engine were banned. This capability was as simple as ...
- 1Citation
MetricsTotal Citations1
- Pablo Picazo-Sanchez
- research-article
After you, please: browser extensions order attacks and countermeasures
- Pablo Picazo-Sanchez
Chalmers University of Technology, Göteborg, Sweden
University of Gothenburg, Göteborg, Sweden
, - Juan Tapiador
Universidad Carlos III de Madrid, Madrid, Spain
, - Gerardo Schneider
Chalmers University of Technology, Göteborg, Sweden
University of Gothenburg, Göteborg, Sweden
International Journal of Information Security, Volume 19, Issue 6•Dec 2020, pp 623-638 • https://doi.org/10.1007/s10207-019-00481-8AbstractBrowser extensions are small applications executed in the browser context that provide additional capabilities and enrich the user experience while surfing the web. The acceptance of extensions in current browsers is unquestionable. For instance, ...
- 2Citation
MetricsTotal Citations2
- Pablo Picazo-Sanchez
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