Applied Filters
- Nikolai Kosmatov
- AuthorRemove filter
People
Colleagues
- Nikolai Kosmatov (59)
- Julien Signoles (13)
- Virgile Prevosto (12)
- Pascale Le Gall (9)
- Nicky Williams (8)
- Frédéric Loulergue (6)
- Alain Giorgetti (5)
- Jacques Julliand (5)
- Omar Chebaro (5)
- Bernard Botella (4)
- Loïc Correnson (4)
- Adel Djoudi (3)
- Allan Blanchard (3)
- Boris Yakobowski (3)
- Christophe Gaston (3)
- Florent Kirchner (3)
- Jean Christophe Léchenet (3)
- Lionel Blatter (3)
- Muriel Roger (3)
- Sébastien Bardin (3)
Publication
Journal/Magazine Names
- Formal Aspects of Computing (4)
- International Journal on Software Tools for Technology Transfer (STTT) (2)
- ACM SIGAda Ada Letters (1)
- ACM SIGPLAN Notices (1)
- Automated Software Engineering (1)
- Communications of the ACM (1)
- Science of Computer Programming (1)
- Software and Systems Modeling (SoSyM) (1)
- Software Quality Journal (1)
- Theoretical Computer Science (1)
Proceedings/Book Names
- TAP'12: Proceedings of the 6th international conference on Tests and Proofs (2)
- Tests and Proofs (2)
- ASE '05: Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering (1)
- Computer Security. ESORICS 2023 International Workshops (1)
- Formal Methods (1)
- Fundamental Approaches to Software Engineering (1)
- iFM 2023 (1)
- Integrated Formal Methods (1)
- Integrated Formal Methods (1)
- Leveraging Applications of Formal Methods, Verification and Validation. Industrial Practice (1)
- Leveraging Applications of Formal Methods, Verification and Validation. Specification and Verification (1)
- Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles (1)
- Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles (1)
- Runtime Verification (1)
- SAC '06: Proceedings of the 2006 ACM symposium on Applied computing (1)
- SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied Computing (1)
- Tests and Proofs (1)
- Tools and Algorithms for the Construction and Analysis of Systems (1)
- Tools and Algorithms for the Construction and Analysis of Systems (1)
- Verification, Model Checking, and Abstract Interpretation (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
High-Level Program Properties in Frama-C: Definition, Verification and Deduction
- Virgile Robles
Tarides, Paris, France
, - Nikolai Kosmatov
Thales Research & Technology, Palaiseau, France
, - Virgile Prevosto
https://ror.org/03xjwb503Université Paris-Saclay, CEA, List, Palaiseau, France
, - Pascale Le Gall
Laboratoire de Mathématiques et Informatique pour la Complexité et les Systèmes, CentraleSupélec, Université Paris-Saclay, Gif-Sur-Yvette, France
Leveraging Applications of Formal Methods, Verification and Validation. Specification and Verification•October 2024, pp 159-177• https://doi.org/10.1007/978-3-031-75380-0_10AbstractIn deductive verification of software, a contract is typically associated to each function and the implementation is shown to respect it. Such contracts for C programs can be expressed in the ACSL specification language. However, high-level (or ...
- 1Citation
MetricsTotal Citations1
- Virgile Robles
- Article
Runtime Verification for High-Level Security Properties: Case Study on the TPM Software Stack
- Yani Ziani
Thales Research and Technology, Palaiseau, France
Univ. Orléans, INSA Centre Val de Loire, LIFO EA 4022, Orléans, France
, - Nikolai Kosmatov
Thales Research and Technology, Palaiseau, France
, - Frédéric Loulergue
Univ. Orléans, INSA Centre Val de Loire, LIFO EA 4022, Orléans, France
, - Daniel Gracia Pérez
Thales Research and Technology, Palaiseau, France
AbstractThe Trusted Platform Module (TPM) is a cryptoprocessor designed to provide hardware-based secure storage and protect integrity of modern computers. Communications with the TPM go through the TPM Software Stack (TSS), a popular implementation of ...
- 0Citation
MetricsTotal Citations0
- Yani Ziani
- Article
No Smoke Without Fire: Detecting Specification Inconsistencies with Frama-C/WP
- Allan Blanchard
https://ror.org/03xjwb503Université Paris-Saclay, CEA, List, Palaiseau, France
, - Loïc Correnson
https://ror.org/03xjwb503Université Paris-Saclay, CEA, List, Palaiseau, France
, - Adel Djoudi
Thales Digital Identity and Security, Meudon, France
, - Nikolai Kosmatov
Thales Research and Technology, Palaiseau, France
AbstractDeductive verification provides a proof that, under the provided pre-conditions, each terminating execution of a given function satisfies the stated post-conditions. In general, pre- and post-conditions are expressed in a logical specification ...
- 0Citation
MetricsTotal Citations0
- Allan Blanchard
- ArticleOpen Access
Combining Deductive Verification with Shape Analysis
- Téo Bernier
Thales Research & Technology, Palaiseau, France
, - Yani Ziani
Thales Research & Technology, Palaiseau, France
Univ. Orléans, INSA Centre Val de Loire, LIFO EA 4022, Orléans, France
, - Nikolai Kosmatov
Thales Research & Technology, Palaiseau, France
, - Frédéric Loulergue
Univ. Orléans, INSA Centre Val de Loire, LIFO EA 4022, Orléans, France
Fundamental Approaches to Software Engineering•April 2024, pp 280-289• https://doi.org/10.1007/978-3-031-57259-3_14AbstractDeductive verification tools can prove a large range of program properties, but often face issues on recursive data structures. Abstract interpretation tools based on separation logic and shape analysis can efficiently reason about such structures ...
- 0Citation
MetricsTotal Citations0
- Téo Bernier
- ArticleOpen Access
Automate where Automation Fails: Proof Strategies for Frama-C/WP
- Loïc Correnson
https://ror.org/03xjwb503Université Paris-Saclay, CEA, List, Palaiseau, France
, - Allan Blanchard
https://ror.org/03xjwb503Université Paris-Saclay, CEA, List, Palaiseau, France
, - Adel Djoudi
Thales Digital Identity & Security, Meudon, France
, - Nikolai Kosmatov
Thales Research & Technology, Palaiseau, France
Tools and Algorithms for the Construction and Analysis of Systems•April 2024, pp 331-339• https://doi.org/10.1007/978-3-031-57246-3_18AbstractModern deductive verification tools succeed in automatically proving the great majority of program annotations thanks in particular to constantly evolving SMT solvers they rely on. The remaining proof goals still require interactively created ...
- 0Citation
MetricsTotal Citations0
- Loïc Correnson
- research-articleOpen AccessPublished By ACMPublished By ACM
Sound Runtime Assertion Checking for Memory Properties via Program Transformation
- Dara Ly
Université Paris-Saclay, CEA, List, Palaiseau, France
, - Nikolai Kosmatov
Université Paris-Saclay, CEA, List & Thales Research and Technology, Palaiseau, France
, - Frédéric Loulergue
Université d’Orléans, INSA Centre Val de Loire, LIFO EA 4022, Orléans, France
, - Julien Signoles
Université Paris-Saclay, CEA, List, Palaiseau, France
Formal Aspects of Computing, Volume 36, Issue 1•March 2024, Article No.: 4, pp 1-46 • https://doi.org/10.1145/3605951Runtime Assertion Checking (RAC) for expressive specification languages is a non-trivial verification task that becomes even more complex for memory-related properties of imperative languages with dynamic memory allocation. It is important to ensure the ...
- 0Citation
- 518
- Downloads
MetricsTotal Citations0Total Downloads518Last 12 Months478Last 6 weeks55
- Dara Ly
- Article
Execution at RISC: Stealth JOP Attacks on RISC-V Applications
- Loïc Buckwell
Thales Research and Technology, Palaiseau, France
, - Olivier Gilles
Thales Research and Technology, Palaiseau, France
, - Daniel Gracia Pérez
Thales Research and Technology, Palaiseau, France
, - Nikolai Kosmatov
Thales Research and Technology, Palaiseau, France
Computer Security. ESORICS 2023 International Workshops•September 2023, pp 377-391• https://doi.org/10.1007/978-3-031-54129-2_22AbstractRISC-V is a recently developed open instruction set architecture gaining a lot of attention. To improve the security of these systems and design efficient countermeasures, a better understanding of vulnerabilities to novel and future attacks is ...
- 0Citation
MetricsTotal Citations0
- Loïc Buckwell
- Article
Towards Formal Verification of a TPM Software Stack
- Yani Ziani
Thales Research & Technology, Palaiseau, France
Univ. Orléans, INSA Centre Val de Loire, LIFO EA 4022, Orléans, France
, - Nikolai Kosmatov
Thales Research & Technology, Palaiseau, France
, - Frédéric Loulergue
Univ. Orléans, INSA Centre Val de Loire, LIFO EA 4022, Orléans, France
, - Daniel Gracia Pérez
Thales Research & Technology, Palaiseau, France
, - Téo Bernier
Thales Research & Technology, Palaiseau, France
AbstractThe Trusted Platform Module (TPM) is a cryptoprocessor designed to protect integrity and security of modern computers. Communications with the TPM go through the TPM Software Stack (TSS), a popular implementation of which is the open-source ...
- 0Citation
MetricsTotal Citations0
- Yani Ziani
- research-article
Efficient computation of arbitrary control dependencies
- Jean-Christophe Léchenet
Université Paris-Saclay, CEA, List, Palaiseau, France
Laboratoire de Mathématiques et Informatique pour la Complexité et les Systèmes, CentraleSupélec, Université Paris-Saclay, Gif-sur-Yvette, France
, - Nikolai Kosmatov
Université Paris-Saclay, CEA, List, Palaiseau, France
Thales Research & Technology, Palaiseau, France
, - Pascale Le Gall
Laboratoire de Mathématiques et Informatique pour la Complexité et les Systèmes, CentraleSupélec, Université Paris-Saclay, Gif-sur-Yvette, France
Theoretical Computer Science, Volume 969, Issue C•Aug 2023 • https://doi.org/10.1016/j.tcs.2023.114029AbstractIn 2011, Danicic et al. introduced an elegant generalization of the notion of control dependence for any directed graph. They also proposed an algorithm computing the weak control-closure of a subset of graph vertices and performed a paper-and-...
- 0Citation
MetricsTotal Citations0
- Jean-Christophe Léchenet
- research-articlePublished By ACMPublished By ACM
An Efficient Black-Box Support of Advanced Coverage Criteria for Klee
- Nicolas Berthier
OCamlPro, Paris, France
, - Steven De Oliveira
OCamlPro, Paris, France
, - Nikolai Kosmatov
Thales Research and Technology, Palaiseau, France
, - Delphine Longuet
Thales Research and Technology, Palaiseau, France
, - Romain Soulat
Thales Research and Technology, Palaiseau, France
SAC '23: Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing•March 2023, pp 1706-1715• https://doi.org/10.1145/3555776.3577713Dynamic symbolic execution (DSE) is a powerful test generation approach based on an exploration of the path space of the program under test. Well-adapted for path coverage, this approach is however less efficient for conditions, decisions, advanced ...
- 0Citation
- 35
- Downloads
MetricsTotal Citations0Total Downloads35Last 12 Months23Last 6 weeks2
- Nicolas Berthier
- Article
An Efficient VCGen-Based Modular Verification of Relational Properties
- Lionel Blatter
Karlsruhe Institute of Technology, 76131, Karlsruhe, Germany
Max Planck Institute for Security and Privacy, 44799, Bochum, Germany
, - Nikolai Kosmatov
Université Paris-Saclay, CEA, List, 91120, Palaiseau, France
Thales Research and Technology, 91120, Palaiseau, France
, - Virgile Prevosto
Université Paris-Saclay, CEA, List, 91120, Palaiseau, France
, - Pascale Le Gall
CentraleSupélec, Université Paris-Saclay, 91190, Gif-sur-Yvette, France
Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles•October 2022, pp 498-516• https://doi.org/10.1007/978-3-031-19849-6_28AbstractDeductive verification typically relies on function contracts that specify the behavior of each function for a single function call. Relational properties link several function calls together within a single specification. They can express more ...
- 1Citation
MetricsTotal Citations1
- Lionel Blatter
- Article
Certified Verification of Relational Properties
- Lionel Blatter
Karlsruhe Institute of Technology, Karlsruhe, Germany
, - Nikolai Kosmatov
Université Paris-Saclay, CEA, List, 91120, Palaiseau, France
Thales Research and Technology, 91120, Palaiseau, France
, - Virgile Prevosto
Université Paris-Saclay, CEA, List, 91120, Palaiseau, France
, - Pascale Le Gall
CentraleSupélec, Université Paris-Saclay, 91190, Gif-sur-Yvette, France
AbstractThe use of function contracts to specify the behavior of functions often remains limited to the scope of a single function call. Relational properties link several function calls together within a single specification. They can express more ...
- 1Citation
MetricsTotal Citations1
- Lionel Blatter
- posterPublished By ACMPublished By ACM
Verifying redundant-check based countermeasures: a case study
- Thibault Martin
Université Paris-Saclay, Palaiseau, France
, - Nikolai Kosmatov
Thales Research and Technology, Palaiseau, France
, - Virgile Prevosto
Université Paris-Saclay, Palaiseau, France
SAC '22: Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing•April 2022, pp 1849-1852• https://doi.org/10.1145/3477314.3507341To thwart fault injection based attacks on critical embedded systems, designers of sensitive software use redundancy based countermeasure schemes. In some of these schemes, critical checks (i.e. conditionals) in the code are duplicated to ensure that an ...
- 3Citation
- 46
- Downloads
MetricsTotal Citations3Total Downloads46Last 12 Months19Last 6 weeks2
- Thibault Martin
- editorial
Editorial
- Christophe Gaston
Université Paris-Saclay, CEA, List, F-91120, Palaiseau, France
, - Nikolai Kosmatov
Thales Research & Technology, Palaiseau, France
, - Pascale Le Gall
Laboratoire de Mathématiques et Informatique pour la Complexité et les Systèmes CentraleSupélec, Université Paris-Saclay - Plateau de Moulon, 9 rue Joliot-Curie, F-91191, Gif-sur-Yvette Cedex, France
Software Quality Journal, Volume 30, Issue 1•Mar 2022, pp 1-2 • https://doi.org/10.1007/s11219-022-09590-5- 0Citation
MetricsTotal Citations0
- Christophe Gaston
- Article
Formal Verification of a JavaCard Virtual Machine with Frama-C
- Adel Djoudi
Thales Digital Identity and Security, Meudon, France
, - Martin Hána
Thales Digital Identity and Security, Prague, Czech Republic
, - Nikolai Kosmatov
Thales Research and Technology, Palaiseau, France
AbstractFormal verification of real-life industrial software remains a challenging task. It provides strong guarantees of correctness, which are particularly important for security-critical products, such as smart cards. Security of a smart card strongly ...
- 5Citation
MetricsTotal Citations5
- Adel Djoudi
- articlefreePublished By ACMPublished By ACM
The dogged pursuit of bug-free C programs: the Frama-C software analysis platform
- Patrick Baudin
Université Paris-Saclay, CEA, List, Palaiseau, France
, - François Bobot
Université Paris-Saclay, CEA, List, Palaiseau, France
, - David Bühler
Université Paris-Saclay, CEA, List, Palaiseau, France
, - Loïc Correnson
Université Paris-Saclay, CEA, List, Palaiseau, France
, - Florent Kirchner
Université Paris-Saclay, CEA, List, Palaiseau, France
, - Nikolai Kosmatov
Thales Research and Technology, Palaiseau, France
, - André Maroneze
Université Paris-Saclay, CEA, List, Palaiseau, France
, - Valentin Perrelle
Université Paris-Saclay, CEA, List, Palaiseau, France
, - Virgile Prevosto
Université Paris-Saclay, CEA, List, Palaiseau, France
, - Julien Signoles
Université Paris-Saclay, CEA, List, Palaiseau, France
, - Nicky Williams
Université Paris-Saclay, CEA, List, Palaiseau, France
Communications of the ACM, Volume 64, Issue 8•August 2021, pp 56-68 • https://doi.org/10.1145/3470569A panoramic view of a popular platform for C program analysis and verification.
- 33Citation
- 14,854
- Downloads
MetricsTotal Citations33Total Downloads14,854Last 12 Months830Last 6 weeks101
- Patrick Baudin
- correction
Correction to: PolyGraph: a data flow model with frequency arithmetic
- Paul Dubrulle
CEA List, 91191, Gif-sur-Yvette, France
, - Nikolai Kosmatov
CEA List, 91191, Gif-sur-Yvette, France
Thales Research and Technology, 91120, Palaiseau, France
, - Christophe Gaston
CEA List, 91191, Gif-sur-Yvette, France
, - Arnault Lapitre
CEA List, 91191, Gif-sur-Yvette, France
International Journal on Software Tools for Technology Transfer (STTT), Volume 23, Issue 3•Jun 2021, pp 519-519 • https://doi.org/10.1007/s10009-020-00590-zThe publication of this article unfortunately contained a mistake.
- 0Citation
MetricsTotal Citations0
- Paul Dubrulle
- research-article
PolyGraph: a data flow model with frequency arithmetic
- Paul Dubrulle
CEA List, 91191, Gif-sur-Yvette, France
, - Nikolai Kosmatov
CEA List, 91191, Gif-sur-Yvette, France
Thales Research and Technology, 91120, Palaiseau, France
, - Christophe Gaston
CEA List, 91191, Gif-sur-Yvette, France
, - Arnault Lapitre
CEA List, 91191, Gif-sur-Yvette, France
International Journal on Software Tools for Technology Transfer (STTT), Volume 23, Issue 3•Jun 2021, pp 489-517 • https://doi.org/10.1007/s10009-020-00586-9AbstractData flow formalisms are commonly used to model systems in order to solve problems of buffer sizing and task scheduling. A prerequisite for static analysis of a modeled system is the existence of a periodic schedule in which the sizes of ...
- 0Citation
MetricsTotal Citations0
- Paul Dubrulle
- Article
Runtime Abstract Interpretation for Numerical Accuracy and Robustness
- Franck Védrine
https://ror.org/03xjwb503Université Paris -Saclay, CEA, List, Palaiseau, France
, - Maxime Jacquemin
https://ror.org/03xjwb503Université Paris -Saclay, CEA, List, Palaiseau, France
, - Nikolai Kosmatov
https://ror.org/03xjwb503Université Paris -Saclay, CEA, List, Palaiseau, France
Thales Research and Technology, Palaiseau, France
, - Julien Signoles
https://ror.org/03xjwb503Université Paris -Saclay, CEA, List, Palaiseau, France
Verification, Model Checking, and Abstract Interpretation•January 2021, pp 243-266• https://doi.org/10.1007/978-3-030-67067-2_12AbstractVerification of numerical accuracy properties in modern software remains an important and challenging task. One of its difficulties is related to unstable tests, where the execution can take different branches for real and floating-point numbers. ...
- 0Citation
MetricsTotal Citations0
- Franck Védrine
- Article
Detection of Polluting Test Objectives for Dataflow Criteria
- Thibault Martin
Université Paris-Saclay, CEA, List, Palaiseau, France
, - Nikolai Kosmatov
Université Paris-Saclay, CEA, List, Palaiseau, France
Thales Research and Technology, Palaiseau, France
, - Virgile Prevosto
Université Paris-Saclay, CEA, List, Palaiseau, France
, - Matthieu Lemerre
Université Paris-Saclay, CEA, List, Palaiseau, France
AbstractDataflow test coverage criteria, such as all-defs and all-uses, belong to the most advanced coverage criteria. These criteria are defined by complex artifacts combining variable definitions, uses and program paths. Detection of polluting (i.e. ...
- 0Citation
MetricsTotal Citations0
- Thibault Martin
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