Carroll C Morgan
Applied Filters
- Carroll C Morgan
- AuthorRemove filter
People
Colleagues
- Annabelle K McIver (43)
- Larissa A Meinicke (5)
- Thai Son Hoang (5)
- Rob Jan van Glabbeek (4)
- Yuxin Deng (4)
- Ken Robinson (3)
- Mário Sérgio Alvim (3)
- Matthew C B Hennessy (3)
- Roger Gimson (3)
- Bernard A Sufrin (2)
- Chenyi Zhang (2)
- Jim C P Woodcock (2)
- Joe Hurd (2)
- Joost Pieter Katoen (2)
- Karen Seidel (2)
- Konstantinos Chatzikokolakis (2)
- Paul H B Gardiner (2)
- Roland Wen (2)
- Trevor Norman Vickers (2)
Roles
Publication
Journal/Magazine Names
- Formal Aspects of Computing (7)
- Electronic Notes in Theoretical Computer Science (ENTCS) (5)
- Information Processing Letters (5)
- Theoretical Computer Science (5)
- Science of Computer Programming (3)
- ACM Transactions on Programming Languages and Systems (2)
- Acta Informatica (2)
- ACM SIGMETRICS Performance Evaluation Review (1)
- ACM Transactions on Computational Logic (1)
- Communications of the ACM (1)
- IBM Journal of Research and Development (1)
- IEEE Transactions on Software Engineering (1)
- Journal of Information Security and Applications (1)
- Proceedings of the ACM on Programming Languages (1)
Proceedings/Book Names
- Specification case studies (3)
- FM '09: Proceedings of the 2nd World Congress on Formal Methods (2)
- Programming methodology (2)
- The Analysis of Concurrent Systems (2)
- ZB'03: Proceedings of the 3rd international conference on Formal specification and development in Z and B (2)
- ZB'05: Proceedings of the 4th international conference on Formal Specification and Development in Z and B (2)
- A classical mind (1)
- Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science) (1)
- Beauty is our business (1)
- CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (1)
- CONCUR 2009: Proceedings of the 20th International Conference on Concurrency Theory (1)
- ESOP'07: Proceedings of the 16th European Symposium on Programming (1)
- FM '08: Proceedings of the 15th international symposium on Formal Methods (1)
- ICALP'10: Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II (1)
- Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles (1)
- LICS '07: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (1)
- Programming from specifications (2nd ed.) (1)
- RelMiCS'06/AKA'06: Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra (1)
- SAS'10: Proceedings of the 17th international conference on Static analysis (1)
- Theoretical Aspects of Computing – ICTAC 2024 (1)
Publisher
- Springer-Verlag (39)
- Association for Computing Machinery (9)
- Elsevier North-Holland, Inc. (8)
- Elsevier Science Publishers B. V. (5)
- Elsevier Science Publishers Ltd. (5)
- IEEE Computer Society (5)
- Prentice Hall International (UK) Ltd. (5)
- BCS Learning & Development Ltd. (2)
- Elsevier Science Inc. (1)
- IBM Corp. (1)
- IEEE Press (1)
- Prentice-Hall, Inc. (1)
- SpringerVerlag (1)
- Turku Centre for Computer Science (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
On Formal Methods Thinking in Computer Science Education
- Brijesh Dongol
University of Surrey, Guildford, United Kingdom of Great Britain and Northern Ireland
, - Catherine Dubois
Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Enterprise, Evry, France
, - Stefan Hallerstede
Aarhus Universitet, Aarhus, Denmark
, - Eric Hehner
University of Toronto, Toronto, Canada
, - Carroll Morgan
University of New South Wales, Sydney, Australia
, - Peter Müller
ETH Zurich, Zurich, Switzerland
, - Leila Ribeiro
Federal University of Rio Grande do Sul, Porto Alegre, Brazil
, - Alexandra Silva
Cornell University, Ithaca, United States
, - Graeme Smith
School of EECS, The University of Queensland, Brisbane, Australia
, - Erik de Vink
Eindhoven University of Technology, Eindhoven, Netherlands
Formal Aspects of Computing, Volume 37, Issue 1•March 2025, Article No.: 8, pp 1-23 • https://doi.org/10.1145/3670419Formal Methods (FMs) radically improve the quality of the code artefacts they help to produce. They are simple, probably accessible to first-year undergraduate students and certainly to second-year students and beyond. Nevertheless, in many cases, they ...
- 7Citation
- 655
- Downloads
MetricsTotal Citations7Total Downloads655Last 12 Months655Last 6 weeks222
- Brijesh Dongol
- Article
Probabilistic Datatypes
- Chris Chen
https://ror.org/01sf06y89School of Computing, Macquarie University, Sydney, Australia
, - Annabelle McIver
https://ror.org/01sf06y89School of Computing, Macquarie University, Sydney, Australia
, - Carroll Morgan
University of New South Wales and Trustworthy Systems, Sydney, Australia
Theoretical Aspects of Computing – ICTAC 2024•November 2024, pp 3-16• https://doi.org/10.1007/978-3-031-77019-7_1AbstractAn encapsulated datatype collects related data together with the operations used to access them. Datatype refinement then provides a clear separation between the expectations of programs that call the operations (i.e. from outside the ...
- 0Citation
MetricsTotal Citations0
- Chris Chen
- research-articlePublished By ACMPublished By ACM
A Novel Analysis of Utility in Privacy Pipelines, Using Kronecker Products and Quantitative Information Flow
- Mário S. Alvim
UFMG, Belo Horizonte, Brazil
, - Natasha Fernandes
Macquarie University, Sydney, Australia
, - Annabelle McIver
Macquarie University, Sydney, NSW, Australia
, - Carroll Morgan
UNSW & Trustworthy Systems, Sydney, NSW, Australia
, - Gabriel H. Nunes
Macquarie University & UFMG, Sydney, NSW, Australia
CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security•November 2023, pp 1718-1731• https://doi.org/10.1145/3576915.3623081We combine Kronecker products, and quantitative information flow, to give a novel formal analysis for the fine-grained verification of utility in complex privacy pipelines. The combination explains a surprising anomaly in the behaviour of utility of ...
- 4Citation
- 292
- Downloads
MetricsTotal Citations4Total Downloads292Last 12 Months219Last 6 weeks23
- Mário S. Alvim
- research-articlePublished By ACMPublished By ACM
The laplace mechanism has optimal utility for differential privacy over continuous queries
- Natasha Fernandes
Macquarie University, Sydney and UNSW, Sydney
, - Annabelle McIver
Macquarie University, Sydney
, - Carroll Morgan
UNSW, Sydney
LICS '21: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science•June 2021, Article No.: 50, pp 1-12• https://doi.org/10.1109/LICS52264.2021.9470718Differential Privacy protects individuals' data when statistical queries are published from aggregated databases: applying "obfuscating" mechanisms to the query results makes the released information less specific but, unavoidably, also decreases its ...
- 2Citation
- 29
- Downloads
MetricsTotal Citations2Total Downloads29Last 12 Months11Last 6 weeks3
- Natasha Fernandes
- Article
Correctness by Construction for Probabilistic Programs
- Annabelle McIver
Macquarie University, Sydney, Australia
, - Carroll Morgan
University of New South Wales and Trustworthy Systems, Data61, CSIRO, Sydney, Australia
Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles•October 2020, pp 216-239• https://doi.org/10.1007/978-3-030-61362-4_12AbstractThe “correct by construction” paradigm is an important component of modern Formal Methods, and here we use the probabilistic Guarded-Command Language pGCL to illustrate its application to probabilistic programming.
pGCL extends Dijkstra’s guarded-...
- 1Citation
MetricsTotal Citations1
- Annabelle McIver
- research-article
An axiomatization of information flow measures
- Mário S. Alvim
Universidade Federal de Minas Gerais, Belo Horizonte, Brazil
, - Konstantinos Chatzikokolakis
CNRS, Palaiseau, France
LIX, École Polytechnique, Palaiseau, France
, - Annabelle McIver
Macquarie University, Sydney, Australia
, - Carroll Morgan
University of New South Wales, Sydney, Australia
Data61, Sydney, Australia
, - Catuscia Palamidessi
Inria Saclay, Palaiseau, France
LIX, École Polytechnique, Palaiseau, France
, - Geoffrey Smith
Florida International University, Miami, United States of America
Theoretical Computer Science, Volume 777, Issue C•Jul 2019, pp 32-54 • https://doi.org/10.1016/j.tcs.2018.10.016AbstractQuantitative information flow aims to assess and control the leakage of sensitive information by computer systems. A key insight in this area is that no single leakage measure is appropriate in all operational scenarios; as a result, ...
- 0Citation
MetricsTotal Citations0
- Mário S. Alvim
- research-articleOpen AccessPublished By ACMPublished By ACM
A new proof rule for almost-sure termination
- Annabelle McIver
Macquarie University, Australia
, - Carroll Morgan
UNSW, Australia / Data61 at CSIRO, Australia
, - Benjamin Lucien Kaminski
RWTH Aachen University, Germany / University College London, UK
, - Joost-Pieter Katoen
RWTH Aachen University, Germany / IST Austria, Austria
Proceedings of the ACM on Programming Languages, Volume 2, Issue POPL•January 2018, Article No.: 33, pp 1-28 • https://doi.org/10.1145/3158121We present a new proof rule for proving almost-sure termination of probabilistic programs, including those that contain demonic non-determinism.
An important question for a probabilistic program is whether the probability mass of all its diverging runs ...
- 76Citation
- 1,166
- Downloads
MetricsTotal Citations76Total Downloads1,166Last 12 Months227Last 6 weeks32- 1
Supplementary Materialalmostsuretermination.webm
- Annabelle McIver
- research-article
Privacy in elections
- Annabelle McIver
Macquarie University, Sydney
, - Tahiry Rabehaja
Macquarie University, Sydney
, - Roland Wen
University of NSW, Sydney
, - Carroll Morgan
University of NSW, Sydney
Journal of Information Security and Applications, Volume 36, Issue C•October 2017, pp 112-126 • https://doi.org/10.1016/j.jisa.2017.08.003We study the impact on privacy in results reporting in elections. In the interests of transparency election commissions report details of aggregated vote counts; in the interests of privacy some of that information must be suppressed. We apply recent ...
- 1Citation
MetricsTotal Citations1
- Annabelle McIver
- Article
Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow
LICS '15: Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)•July 2015, pp 597-608• https://doi.org/10.1109/LICS.2015.61- 1Citation
- 42
- Downloads
MetricsTotal Citations1Total Downloads42Last 12 Months2
- Article
Additive and Multiplicative Notions of Leakage, and Their Capacities
- Mário S. Alvim,
- Konstantinos Chatzikokolakis,
- Annabelle Mciver,
- Carroll Morgan,
- Catuscia Palamidessi,
- Geoffrey Smith
CSF '14: Proceedings of the 2014 IEEE 27th Computer Security Foundations Symposium•July 2014, pp 308-322• https://doi.org/10.1109/CSF.2014.29Protecting sensitive information from improper disclosure is a fundamental security goal. It is complicated, and difficult to achieve, often because of unavoidable or even unpredictable operating conditions that can lead to breaches in planned security ...
- 13Citation
MetricsTotal Citations13
- Article
Towards a Formal Analysis of Information Leakage for Signature Attacks in Preferential Elections
- Roland Wen
Department of Computing, Macquarie University, Sydney, Australia and School of Computer Science and Engineering, The University of New South Wales, Sydney, Australia
, - Annabelle Mciver
Department of Computing, Macquarie University, Sydney, Australia
, - Carroll Morgan
School of Computer Science and Engineering, The University of New South Wales, Sydney, Australia
Proceedings of the 19th International Symposium on FM 2014: Formal Methods - Volume 8442•May 2014, pp 595-610• https://doi.org/10.1007/978-3-319-06410-9_40Electronic voting is rich with paradoxes. How can a voter verify that his own vote has been correctly counted, but at the same time be prevented from revealing his vote to a third party? Not only is there no generally recognised solution to those ...
- 0Citation
MetricsTotal Citations0
- Roland Wen
- research-articleOpen Access
Abstractions of non-interference security: probabilistic versus possibilistic
- T. S. Hoang
Institute of Information Security, ETH Zurich, Zurich, Switzerland
, - A. K. McIver
Department of Computing, Macquarie University, Sydney, Australia
, - L. Meinicke
Department of Computing, Macquarie University, Sydney, Australia
, - C. C. Morgan
School of Computer Science and Engineering, UNSW, Sydney, Australia
, - A. Sloane
Department of Computing, Macquarie University, Sydney, Australia
, - E. Susatyo
Department of Computing, Macquarie University, Sydney, Australia
Formal Aspects of Computing, Volume 26, Issue 1•Jan 2014, pp 169-194 • https://doi.org/10.1007/s00165-012-0237-4AbstractThe Shadow Semantics (Morgan, Math Prog Construction, vol 4014, pp 359–378, 2006; Morgan, Sci Comput Program 74(8):629–653, 2009) is a possibilistic (qualitative) model for noninterference security. Subsequent work (McIver et al., Proceedings of ...
- 2Citation
- 79
- Downloads
MetricsTotal Citations2Total Downloads79Last 12 Months55Last 6 weeks6
- T. S. Hoang
- Article
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism
LICS '12: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science•June 2012, pp 461-470• https://doi.org/10.1109/LICS.2012.56We propose a novel domain-theoretic model for nondeterminism, probability and hidden state, with relations on it that compare information flow. One relation is Smyth-like, based on a structural, refinement-like order between semantic elements; the other ...
- 4Citation
- 54
- Downloads
MetricsTotal Citations4Total Downloads54Last 12 Months1
- Article
Elementary probability theory in the eindhoven style
- Carroll Morgan
University of New South Wales, NSW, Australia
MPC'12: Proceedings of the 11th international conference on Mathematics of Program Construction•June 2012, pp 48-73• https://doi.org/10.1007/978-3-642-31113-0_5We extend the Eindhoven quantifier notation to elementary probability theory by adding "distribution comprehensions" to it.
Even elementary theories can be used in complicated ways, and this occurs especially when reasoning about computer programs: an ...
- 0Citation
MetricsTotal Citations0
- Carroll Morgan
- research-articleOpen Access
Compositional noninterference from first principles
- Carroll Morgan
School of Computer Science and Engineering, University of NSW, 2052, Sydney, Australia
Formal Aspects of Computing, Volume 24, Issue 1•Jan 2012, pp 3-26 • https://doi.org/10.1007/s00165-010-0167-yAbstractThe recently formulated Shadow Semantics for noninterference-style security of sequential programs avoids the Refinement Paradox by preserving demonic nondeterminism in those cases where reducing it would compromise security. The construction (...
- 9Citation
- 29
- Downloads
MetricsTotal Citations9Total Downloads29Last 12 Months14Last 6 weeks1
- Carroll Morgan
- research-articleOpen Access
Compositional refinement in agent-based security protocols
- A. K. McIver
Department of Computer Science, Macquarie University, 2109, Sydney, NSW, Australia
, - C. C. Morgan
School of Computational Science and Engineering, University of New South Wales, 2052, Sydney, NSW, Australia
Formal Aspects of Computing, Volume 23, Issue 6•Nov 2011, pp 711-737 • https://doi.org/10.1007/s00165-010-0164-1AbstractA truly secure protocol is one which never violates its security requirements, no matter how bizarre the circumstances, provided those circumstances are within its terms of reference. Such cast-iron guarantees, as far as they are possible, require ...
- 4Citation
- 66
- Downloads
MetricsTotal Citations4Total Downloads66Last 12 Months50Last 6 weeks11
- A. K. McIver
- Article
Linear-invariant generation for probabilistic programs: automated support for proof-based methods
- Joost-Pieter Katoen
RWTH Aachen University, Germany
, - Annabelle K. McIver
Dept. Computer Science, Macquarie University, NSW, Australia
, - Larissa A. Meinicke
Dept. Computer Science, Macquarie University, NSW, Australia
, - Carroll C. Morgan
School of Comp. Sci. and Eng., Univ. New South Wales, NSW, Australia
SAS'10: Proceedings of the 17th international conference on Static analysis•September 2010, pp 390-406We present a constraint-based method for automatically generating quantitative invariants for linear probabilistic programs, and we show how it can be used, in combination with proof-based methods, to verify properties of probabilistic programs that ...
- 32Citation
MetricsTotal Citations32
- Joost-Pieter Katoen
- Article
Compositional closure for Bayes Risk in probabilistic noninterference
- Annabelle McIver
Dept. Computer Science, Macquarie University, NSW, Australia
, - Larissa Meinicke
Dept. Computer Science, Macquarie University, NSW, Australia
, - Carroll Morgan
School of Comp. Sci. and Eng., Univ. New South Wales, NSW, Australia
ICALP'10: Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II•July 2010, pp 223-235We give a quantitative sequential model for noninterference security with probability (but not demonic choice), and a novel refinement order that we prove to be the greatest compositional relation consistent with an "elementary" order based on Bayes ...
- 8Citation
MetricsTotal Citations8
- Annabelle McIver
- article
How to Brew-up a Refinement Ordering
- Carroll Morgan
School of Computer Science and Engineering, University of New South Wales, Sydney, Australia
Electronic Notes in Theoretical Computer Science (ENTCS), Volume 259•December, 2009, pp 123-141 • https://doi.org/10.1016/j.entcs.2009.12.021Fifty years ago there were few mathematical models of program semantics, perhaps none. Now there is probably a new one created every day. How do we do it? How should we do it? In our community we understand the utility of the refinement order, and we ...
- 1Citation
MetricsTotal Citations1
- Carroll Morgan
- Article
Security, Probability and Nearly Fair Coins in the Cryptographers' Café
- Annabelle Mciver
Dept. Computer Science, Macquarie University, Australia 2109
, - Larissa Meinicke
Dept. Computer Science, Macquarie University, Australia 2109
, - Carroll Morgan
School of Comp. Sci. and Eng., Univ. New South Wales, Australia 2052
FM '09: Proceedings of the 2nd World Congress on Formal Methods•November 2009, pp 41-71• https://doi.org/10.1007/978-3-642-05089-3_5Security and probability are both artefacts that we hope to bring increasingly within the reach of refinement-based Formal Methods; although we have worked on them separately, in the past, the goal has always been to bring them together.
In this report ...
- 3Citation
MetricsTotal Citations3
- Annabelle Mciver
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