Applied Filters
- Alejandro Russo
- AuthorRemove filter
People
Colleagues
- Deian Stefan (16)
- Andrei Sabelfeld (13)
- David Mazières (11)
- Pablo Buiras (9)
- John C. Mitchell (8)
- Amit A Levy (7)
- John M Hughes (7)
- Koen Claessen (5)
- Agustín Claudio Mista (4)
- Nachiappan Valliappan (4)
- Elisabet Lobo-Vesga (3)
- Marco Vassena (3)
- Tamara Rezk (3)
- C. Flanagan (2)
- David Sands (2)
- Deepak Garg (2)
- Dimitrios Vytiniotis (2)
- Gilles Barthe (2)
- Stephen Nathaniel Chong (2)
Roles
Publication
Proceedings/Book Names
- ICFP 2015: Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming (2)
- NordSec'10: Proceedings of the 15th Nordic conference on Information Security Technology for Applications (2)
- AST '11: Proceedings of the 6th International Workshop on Automation of Software Test (1)
- CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (1)
- CCS '18: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (1)
- Haskell '08: Proceedings of the first ACM SIGPLAN symposium on Haskell (1)
- Haskell '11: Proceedings of the 4th ACM symposium on Haskell (1)
- Haskell '14: Proceedings of the 2014 ACM SIGPLAN symposium on Haskell (1)
- Haskell 2018: Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell (1)
- Haskell 2020: Proceedings of the 13th ACM SIGPLAN International Symposium on Haskell (1)
- ICFP '12: Proceedings of the 17th ACM SIGPLAN international conference on Functional programming (1)
- ICSE-NIER '20: Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering: New Ideas and Emerging Results (1)
- IFL '19: Proceedings of the 31st Symposium on Implementation and Application of Functional Languages (1)
- Leveraging Applications of Formal Methods, Verification and Validation. Industrial Practice (1)
- PLAS '11: Proceedings of the ACM SIGPLAN 6th Workshop on Programming Languages and Analysis for Security (1)
- PLAS '12: Proceedings of the 7th Workshop on Programming Languages and Analysis for Security (1)
- PLAS '16: Proceedings of the 2016 ACM Workshop on Programming Languages and Analysis for Security (1)
- PLAS '17: Proceedings of the 2017 Workshop on Programming Languages and Analysis for Security (1)
- PLAS'20: Proceedings of the 15th Workshop on Programming Languages and Analysis for Security (1)
- PPDP '19: Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming (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.
- research-articleOpen AccessPublished By ACMPublished By ACM
Sensitivity by Parametricity
- Elisabet Lobo-Vesga
DPella, Gothenburg, Sweden
, - Alejandro Russo
Chalmers University of Technology - DPella, Gothenburg, Sweden
, - Marco Gaboardi
Boston University, Boston, USA
, - Carlos Tomé Cortiñas
Chalmers University of Technology, Gothenburg, Sweden
Proceedings of the ACM on Programming Languages, Volume 8, Issue OOPSLA2•October 2024, Article No.: 286, pp 415-441 • https://doi.org/10.1145/3689726The work of Fuzz has pioneered the use of functional programming languages where types allow reasoning about the sensitivity of programs. Fuzz and subsequent work (e.g., DFuzz and Duet) use advanced technical devices like linear types, modal types, and ...
- 0Citation
- 149
- Downloads
MetricsTotal Citations0Total Downloads149Last 12 Months149Last 6 weeks149- 1
Supplementary Materialsensitivity_by_parametricity_oopsla24_accompanying_material.pdf
- Elisabet Lobo-Vesga
- research-articleOpen AccessPublished By ACMPublished By ACM
Calculating Function Sensitivity for Synthetic Data Algorithms
- Markus Pettersson
Unaffiliated, Sweden
, - Johannes Ljung Ekeroth
Unaffiliated, Sweden
, - Alejandro Russo
Chalmers University of Technology, Sweden and DPella AB, Sweden and Göteborg University, Sweden
IFL '23: Proceedings of the 35th Symposium on Implementation and Application of Functional Languages•August 2023, Article No.: 6, pp 1-12• https://doi.org/10.1145/3652561.3652567Differential privacy (DP) provides a robust framework for ensuring individual privacy while analyzing population data. To achieve DP, statistical noise is added to query results before publication, but accurately determining the required noise is ...
- 0Citation
- 64
- Downloads
MetricsTotal Citations0Total Downloads64Last 12 Months64Last 6 weeks16
- Markus Pettersson
- review-article
From Fine- to Coarse-Grained Dynamic Information Flow Control and Back
- Marco Vassena
Utrecht University, The Netherlands
, - Alejandro Russo
Chalmers University of Technology, Sweden
, - Deepak Garg
Max Planck Institute for Software Systems, Germany
, - Vineet Rajani
University of Kent, UK
, - Deian Stefan
University of California, San Diego, USA
Foundations and Trends in Programming Languages, Volume 8, Issue 1•Oct 2023, pp 1-117 • https://doi.org/10.1561/2500000046This tutorial provides a complete and homogeneous account of the latest advances in fine- and coarse-grained dynamic information-flow control (IFC) security. Since the 1970s, the programming language and the operating system communities proposed different ...
- 0Citation
MetricsTotal Citations0
- Marco Vassena
- research-articleOpen AccessPublished By ACMPublished By ACM
HasTEE: Programming Trusted Execution Environments with Haskell
- Abhiroop Sarkar
Chalmers University of Technology, Sweden
, - Robert Krook
Chalmers University of Technology, Sweden
, - Alejandro Russo
Chalmers University of Technology, Sweden
, - Koen Claessen
Chalmers University of Technology, Sweden
Haskell 2023: Proceedings of the 16th ACM SIGPLAN International Haskell Symposium•August 2023, pp 72-88• https://doi.org/10.1145/3609026.3609731Trusted Execution Environments (TEEs) are hardware enforced memory isolation units, emerging as a pivotal security solution for security-critical applications. TEEs, like Intel SGX and ARM TrustZone, allow the isolation of confidential code and data ...
- 1Citation
- 422
- Downloads
MetricsTotal Citations1Total Downloads422Last 12 Months333Last 6 weeks43
- Abhiroop Sarkar
- research-articlePublished By ACMPublished By ACM
Practical normalization by evaluation for EDSLs
- Nachiappan Valliappan
Chalmers University of Technology, Sweden
, - Alejandro Russo
Chalmers University of Technology, Sweden
, - Sam Lindley
University of Edinburgh, UK
Haskell 2021: Proceedings of the 14th ACM SIGPLAN International Symposium on Haskell•August 2021, pp 56-70• https://doi.org/10.1145/3471874.3472983Embedded domain-specific languages (eDSLs) are typically implemented in a rich host language, such as Haskell, using a combination of deep and shallow embedding techniques. While such a combination enables programmers to exploit the execution mechanism ...
- 0Citation
- 167
- Downloads
MetricsTotal Citations0Total Downloads167Last 12 Months32Last 6 weeks2
- Nachiappan Valliappan
- research-articlePublished By ACMPublished By ACM
Deriving compositional random generators
- Agustín Mista
Chalmers University of Technology, Gothenburg, Sweden
, - Alejandro Russo
Chalmers University of Technology, Gothenburg, Sweden
IFL '19: Proceedings of the 31st Symposium on Implementation and Application of Functional Languages•September 2019, Article No.: 11, pp 1-12• https://doi.org/10.1145/3412932.3412943Generating good random values described by algebraic data types is often quite intricate. State-of-the-art tools for synthesizing random generators serve the valuable purpose of helping with this task, while providing different levels of invariants ...
- 1Citation
- 30
- Downloads
MetricsTotal Citations1Total Downloads30Last 12 Months10Last 6 weeks1
- Agustín Mista
- research-articleOpen AccessPublished By ACMPublished By ACM
A Programming Language for Data Privacy with Accuracy Estimations
- Elisabet Lobo-Vesga
Chalmers University of Technology, Göteborg, Sweden
, - Alejandro Russo
Chalmers University of Technology, Göteborg, Sweden
, - Marco Gaboardi
Boston University, Boston
ACM Transactions on Programming Languages and Systems, Volume 43, Issue 2•June 2021, Article No.: 6, pp 1-42 • https://doi.org/10.1145/3452096Differential privacy offers a formal framework for reasoning about the privacy and accuracy of computations on private data. It also offers a rich set of building blocks for constructing private data analyses. When carefully calibrated, these analyses ...
- 3Citation
- 721
- Downloads
MetricsTotal Citations3Total Downloads721Last 12 Months238Last 6 weeks42
- Elisabet Lobo-Vesga
- 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,849
- Downloads
MetricsTotal Citations0Total Downloads5,849Last 12 Months590Last 6 weeks54- 1
Supplementary MaterialBSCI 2021 MC paper talk.mp4
- William Hughes
- short-paperPublished By ACMPublished By ACM
Short Paper: Blockcheck the Typechain
- Sergio Benitez
Stanford University, Stanford, CA, USA
, - Jonathan Cogan
Stanford University, Stanford, CA, USA
, - Alejandro Russo
Chalmers University of Technology, Gothenburg, Sweden
PLAS'20: Proceedings of the 15th Workshop on Programming Languages and Analysis for Security•November 2020, pp 35-39• https://doi.org/10.1145/3411506.3417600Recent efforts have sought to design new smart contract programming languages that make writing blockchain programs safer. But programs on the blockchain are beholden only to the safety properties enforced by the blockchain itself: even the strictest ...
- 1Citation
- 79
- Downloads
MetricsTotal Citations1Total Downloads79Last 12 Months12
- Sergio Benitez
- short-paperPublished By ACMPublished By ACM
Hey, my data are mine!: active data to empower the user
- Gian Luca Scoccia
University of L'Aquila, L'Aquila, Italy
, - Marco Autili
University of L'Aquila, L'Aquila, Italy
, - Patrizio Pelliccione
University of L'Aquila, L'Aquila, Italy
, - Paola Inverardi
University of L'Aquila, L'Aquila, Italy
, - Matteo Maria Fiore
University of L'Aquila, L'Aquila, Italy
, - Alejandro Russo
Chalmers University of Technology
ICSE-NIER '20: Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering: New Ideas and Emerging Results•June 2020, pp 5-8• https://doi.org/10.1145/3377816.3381726Privacy is increasingly getting importance in modern systems. As a matter of fact, personal data are out of the control of the original owner and remain in the hands of the software-systems producers. In this new ideas paper, we drastically change the ...
- 1Citation
- 205
- Downloads
MetricsTotal Citations1Total Downloads205Last 12 Months18
- Gian Luca Scoccia
- research-articlePublished By ACMPublished By ACM
Towards secure IoT programming in Haskell
- Nachiappan Valliappan
Chalmers University of Technology, Sweden
, - Robert Krook
Chalmers University of Technology, Sweden
, - Alejandro Russo
Chalmers University of Technology, Sweden
, - Koen Claessen
Chalmers University of Technology, Sweden
Haskell 2020: Proceedings of the 13th ACM SIGPLAN International Symposium on Haskell•August 2020, pp 136-150• https://doi.org/10.1145/3406088.3409027IoT applications are often developed in programming languages with low-level abstractions, where a seemingly innocent mistake might lead to severe security vulnerabilities. Current IoT development tools make it hard to identify these vulnerabilities as ...
- 7Citation
- 444
- Downloads
MetricsTotal Citations7Total Downloads444Last 12 Months33Last 6 weeks5- 1
Supplementary Material3406088.3409027.mp4
- Nachiappan Valliappan
- research-articlePublished By ACMPublished By ACM
Exponential Elimination for Bicartesian Closed Categorical Combinators
- Nachiappan Valliappan
Chalmers University, Sweden
, - Alejandro Russo
Chalmers University, Sweden
PPDP '19: Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming•October 2019, Article No.: 20, pp 1-13• https://doi.org/10.1145/3354166.3354185Categorical combinators offer a simpler alternative to typed lambda calculi for static analysis and implementation. Since categorical combinators are accompanied by a rich set of conversion rules which arise from categorical laws, they also offer a ...
- 3Citation
- 100
- Downloads
MetricsTotal Citations3Total Downloads100Last 12 Months3
- Nachiappan Valliappan
- research-article
Generating random structurally rich algebraic data type values
- Agustín Mista
Chalmers University of Technology, Gothenburg, Sweden
, - Alejandro Russo
Chalmers University of Technology, Gothenburg, Sweden
AST '19: Proceedings of the 14th International Workshop on Automation of Software Test•May 2019, pp 48-54• https://doi.org/10.1109/AST.2019.00013Automatic generation of random values described by algebraic data types (ADTs) is often a hard task. State-of-the-art random testing tools can automatically synthesize random data generators based on ADTs definitions. In that manner, generated values ...
- 3Citation
- 36
- Downloads
MetricsTotal Citations3Total Downloads36Last 12 Months2
- Agustín Mista
- research-articleOpen AccessPublished By ACMPublished By ACM
From fine- to coarse-grained dynamic information flow control and back
- Marco Vassena
Chalmers University of Technology, Sweden
, - Alejandro Russo
Chalmers University of Technology, Sweden
, - Deepak Garg
MPI-SWS, Germany
, - Vineet Rajani
MPI-SWS, Germany
, - Deian Stefan
University of California at San Diego, USA
Proceedings of the ACM on Programming Languages, Volume 3, Issue POPL•January 2019, Article No.: 76, pp 1-31 • https://doi.org/10.1145/3290389We show that fine-grained and coarse-grained dynamic information-flow control (IFC) systems are equally expressive. To this end, we mechanize two mostly standard languages, one with a fine-grained dynamic IFC system and the other with a coarse-grained ...
- 11Citation
- 1,192
- Downloads
MetricsTotal Citations11Total Downloads1,192Last 12 Months141Last 6 weeks22- 1
Supplementary Materiala76-vassena.webm
- Marco Vassena
- Article
Towards Adding Variety to Simplicity
- Nachiappan Valliappan
Chalmers University of Technology, Gothenburg, Sweden
, - Solène Mirliaz
ENS Rennes, Rennes, France
, - Elisabet Lobo Vesga
Chalmers University of Technology, Gothenburg, Sweden
, - Alejandro Russo
Chalmers University of Technology, Gothenburg, Sweden
Leveraging Applications of Formal Methods, Verification and Validation. Industrial Practice•November 2018, pp 414-431• https://doi.org/10.1007/978-3-030-03427-6_31AbstractSimplicity is a Turing-incomplete typed combinator language for smart contracts with a formal semantics. The design of Simplicity makes it possible to statically estimate the resources (e.g., memory) required to execute contracts. Such a feature ...
- 0Citation
MetricsTotal Citations0
- Nachiappan Valliappan
- research-articlePublic AccessPublished By ACMPublished By ACM
Faceted Secure Multi Execution
- Thomas Schmitz
University of California, Santa Cruz, Santa Cruz, CA, USA
, - Maximilian Algehed
Chalmers University of Technology, Gothenburg, Sweden
, - Cormac Flanagan
University of California, Santa Cruz, Santa Cruz, CA, USA
, - Alejandro Russo
Chalmers University of Technology, Gothenburg, Sweden
CCS '18: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security•October 2018, pp 1617-1634• https://doi.org/10.1145/3243734.3243806To enforce non-interference, both Secure Multi-Execution (SME) and Multiple Facets (MF) rely on the introduction of multi-executions. The attractiveness of these techniques is that they are precise: secure programs running under SME or MF do not change ...
- 12Citation
- 541
- Downloads
MetricsTotal Citations12Total Downloads541Last 12 Months69Last 6 weeks14- 1
Supplementary Materialp1617-algehed.mp4
- Thomas Schmitz
- research-articlePublished By ACMPublished By ACM
Branching processes for QuickCheck generators
- Agustín Mista
Universidad Nacional de Rosario, Argentina
, - Alejandro Russo
Chalmers University of Technology, Sweden
, - John Hughes
Chalmers University of Technology, Sweden
Haskell 2018: Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell•September 2018, pp 1-13• https://doi.org/10.1145/3242744.3242747In QuickCheck (or, more generally, random testing), it is challenging to control random data generators' distributions---specially when it comes to user-defined algebraic data types (ADT). In this paper, we adapt results from an area of mathematics ...
Also Published in:
ACM SIGPLAN Notices: Volume 53 Issue 7, July 2018- 13Citation
- 215
- Downloads
MetricsTotal Citations13Total Downloads215Last 12 Months16Last 6 weeks2
- Agustín Mista
- research-articlefree
A Better Facet of Dynamic Information Flow Control
- Minh Ngo
INRIA, Sophia Antipolis Cedex, France
, - Nataliia Bielova
INRIA, Sophia Antipolis Cedex, France
, - Cormac Flanagan
University of California, Santa Cruz, Santa Cruz, CA, USA
, - Tamara Rezk
INRIA, Sophia Antipolis Cedex, France
, - Alejandro Russo
Chalmers University of Technology, Gothenburg, Sweden
, - Thomas Schmitz
University of California, Santa Cruz, Santa Cruz, CA, USA
WWW '18: Companion Proceedings of the The Web Conference 2018•April 2018, pp 731-739• https://doi.org/10.1145/3184558.3185979Multiple Facets (MF) is a dynamic enforcement mechanism which has proved to be a good fit for implementing information flow security for JavaScript. It relies on multi executing the program, once per each security level or view, to achieve soundness. By ...
- 9Citation
- 336
- Downloads
MetricsTotal Citations9Total Downloads336Last 12 Months71Last 6 weeks12
- Minh Ngo
- research-articlePublished By ACMPublished By ACM
Encoding DCC in Haskell
- Maximilian Algehed
Chalmers University of Technology, Göteborg, Sweden
, - Alejandro Russo
Chalmers University of Technology, Göteborg, Sweden
PLAS '17: Proceedings of the 2017 Workshop on Programming Languages and Analysis for Security•October 2017, pp 77-89• https://doi.org/10.1145/3139337.3139338The seminal work on the Dependency Core Calculus (DCC) shows how monads not only can be used for embedding effects in purely functional languages but also to statically track data dependencies. Such types of analysis have applications in research areas ...
- 12Citation
- 85
- Downloads
MetricsTotal Citations12Total Downloads85Last 12 Months4Last 6 weeks1
- Maximilian Algehed
- research-articleOpen AccessPublished By ACMPublished By ACM
Cryptographically Secure Information Flow Control on Key-Value Stores
- Lucas Waye
Harvard University, Cambridge, MA, USA
, - Pablo Buiras
Harvard University, Cambridge, MA, USA
, - Owen Arden
University of California, Santa Cruz, Santa Cruz, CA, USA
, - Alejandro Russo
Chalmers University of Technology, Gothenburg, Sweden
, - Stephen Chong
Harvard University, Cambridge, MA, USA
CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security•October 2017, pp 1893-1907• https://doi.org/10.1145/3133956.3134036We present Clio, an information flow control (IFC) system that transparently incorporates cryptography to enforce confidentiality and integrity policies on untrusted storage. Clio insulates developers from explicitly manipulating keys and cryptographic ...
- 4Citation
- 647
- Downloads
MetricsTotal Citations4Total Downloads647Last 12 Months71Last 6 weeks6- 1
Supplementary Materiallucaswaye-cryptographicallysecure.mp4
- Lucas Waye
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