Applied Filters
- E Allen Emerson
- AuthorRemove filter
People
Colleagues
- Aravinda Prasad Sistla (19)
- Richard Jay Trefler (12)
- Kedar Sharad Namjoshi (11)
- Edmund Melson Clarke, Jr. (9)
- Joseph Halpern (6)
- Nina Amla (6)
- Paul Camille Attie (6)
- Charanjit S Jutla (5)
- Chin Laung Lei (5)
- Debashis Sahoo (4)
- Jai Srinivasan (4)
- Subramanian Krishnan Iyer (4)
- Thomas Wahl (4)
- Vineet Kahlon (4)
- Farn Wang (3)
- Jyotirmoy V Deshmukh (3)
- Jawahar Jain (2)
- Robert P Kurshan (2)
- Sriram Sankaranarayanan (2)
Publication
Journal/Magazine Names
- ACM Transactions on Programming Languages and Systems (5)
- Electronic Notes in Theoretical Computer Science (ENTCS) (3)
- ACM Transactions on Software Engineering and Methodology (2)
- ACM SIGSOFT Software Engineering Notes (1)
- Automated Software Engineering (1)
- Communications of the ACM (1)
- Formal Methods in System Design (1)
- Information and Computation (1)
- Information Processing Letters (1)
- International Journal on Software Tools for Technology Transfer (STTT) (1)
- Journal of Computer and System Sciences (1)
- Journal of the ACM (1)
- Real-Time Systems (1)
- Science of Computer Programming (1)
- SIAM Journal on Computing (1)
- Theoretical Computer Science (1)
Proceedings/Book Names
- 25 Years of Model Checking (2)
- CAV '93: Proceedings of the 5th International Conference on Computer Aided Verification (2)
- CAV '98: Proceedings of the 10th International Conference on Computer Aided Verification (2)
- CHARME '99: Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods (2)
- POPL '83: Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (2)
- POPL '89: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2)
- Proceedings of the 7th International Conference on Computer Aided Verification (2)
- ACM Turing award lectures (1)
- DAC '05: Proceedings of the 42nd annual Design Automation Conference (1)
- Handbook of theoretical computer science (vol. B) (1)
- ICSE '92: Proceedings of the 14th international conference on Software engineering (1)
- Logics and models of concurrent systems (1)
- PODC '96: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing (1)
- PODC '98: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing (1)
- POPL '85: Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1)
- POPL '95: Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1)
- STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1)
- STOC '84: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1)
- Verification, Model Checking, and Abstract Interpretation (1)
- Visual Information and Information Systems (1)
Publisher
- Springer-Verlag (48)
- Association for Computing Machinery (23)
- University of Texas at Austin (17)
- IEEE Computer Society (6)
- Elsevier Science Publishers B. V. (3)
- Kluwer Academic Publishers (3)
- Academic Press, Inc. (2)
- Elsevier North-Holland, Inc. (2)
- Elsevier Science Publishers Ltd. (1)
- IEEE Press (1)
- MIT Press (1)
- Society for Industrial and Applied Mathematics (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
Symbolic modular deadlock analysis
Jyotirmoy V. Deshmukh
Department of Computer and Information Science, University of Pennsylvania, Philadelphia, USA 19104
,E. Allen Emerson
Department of Computer Science, The University of Texas at Austin, Austin, USA 78712
,Sriram Sankaranarayanan
Department of Computer Science, University of Colorado Boulder, Boulder, USA 80309-0430
Automated Software Engineering, Volume 18, Issue 3-4•December 2011, pp 325-362 • https://doi.org/10.1007/s10515-011-0085-0Methods in object-oriented concurrent libraries often encapsulate internal synchronization details. As a result of information hiding, clients calling the library methods may cause thread safety violations by invoking methods in an unsafe manner. This is ...
- 3Citation
MetricsTotal Citations3
- Article
An algorithmic framework for synthesis of concurrent programs
E. Allen Emerson
Dept. of Computer Science and Computer Engineering Research Centre, University of Texas, Austin, TX
,Roopsha Samanta
Dept. of Computer Science and Computer Engineering Research Centre, University of Texas, Austin, TX
ATVA'11: Proceedings of the 9th international conference on Automated technology for verification and analysis•October 2011, pp 522-530We present a framework that takes unsynchronized sequential processes along with a temporal specification of their global concurrent behaviour, and automatically generates a concurrent program with synchronization code ensuring correct global behaviour. ...
- 4Citation
MetricsTotal Citations4
- Article
A more efficient BDD-based QBF solver
Oswaldo Olivo
Department of Computer Science, The University of Texas, Austin
,E. Allen Emerson
Department of Computer Science, The University of Texas, Austin
CP'11: Proceedings of the 17th international conference on Principles and practice of constraint programming•September 2011, pp 675-690In this paper we present a QBF solver that is based on BDD technologies but includes optimizations from search-based algorithms. We enhance the early quantification technique from model checking, favoring aggressive quantification over conjunction of ...
- 1Citation
MetricsTotal Citations1
- chapter
Published By ACM
Published By ACM
Model checking: A Personal Perspective
E. Allen Emerson
University of Texas at Austin
ACM Turing award lectures•January 2007, Year Awarded: 2007, pp 2007• https://doi.org/10.1145/1283920.1962299- 0Citation
- 243
- Downloads
MetricsTotal Citations0Total Downloads243- 1
Supplementary Materialpart2_768krev.mp4
- Article
Time of time
E. Allen Emerson
Department of Computer Science and Computer Engineering Research Center, The University of Texas at Austin, Austin, TX
In his landmark 1977 paper "The Temporal Logic of Programs", Amir Pnueli gave a fundamental recognition that the ideally nonterminating behavior of ongoing concurrent programs, such as operating systems and protocols, was a vital aspect of program ...
- 0Citation
MetricsTotal Citations0
- chapter
Meanings of model checking
E. Allen Emerson
Department of Computer Sciences
Model checking was introduced in the early 1980's to provide a practical automated method for verifying concurrent systems. Model checking has had substantive impact on program verification. For the first time industrial strength systems are being ...
- 0Citation
MetricsTotal Citations0
- Article
Symbolic Deadlock Analysis in Concurrent Libraries and Their Clients
ASE '09: Proceedings of the 24th IEEE/ACM International Conference on Automated Software Engineering•November 2009, pp 480-491• https://doi.org/10.1109/ASE.2009.14Methods in object-oriented concurrent libraries hide internal synchronization details. However, information hiding may result in clients causing thread safety violations by invoking methods in an unsafe manner.Given such a library, we present a technique ...
- 13Citation
- 177
- Downloads
MetricsTotal Citations13Total Downloads177Last 12 Months1
- research-articlefree
Published By ACM
Published By ACM
Model checking: algorithmic verification and debugging
Edmund M. Clarke
Carnegie Mellon University, Pittsburgh, PA
,E. Allen Emerson
University of Texas, Austin, TX
,Joseph Sifakis
Verimag Laboratory Gieres, France
Communications of the ACM, Volume 52, Issue 11•November 2009, pp 74-84 • https://doi.org/10.1145/1592761.1592781Turing Lecture from the winners of the 2007 ACM A.M. Turing Award.
In 1981, Edmund M. Clarke and E. Allen Emerson, working in the USA, and Joseph Sifakis working independently in France, authored seminal papers that founded what has become the highly ...
- 204Citation
- 19,051
- Downloads
MetricsTotal Citations204Total Downloads19,051Last 12 Months771Last 6 weeks95
- Article
Model Checking: Progress and Problems
E. Allen Emerson
University of Texas at Austin,
VMCAI '09: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation•December 2008, pp 1-1• https://doi.org/10.1007/978-3-540-93900-9_1Model checking is an automatic method of verifying finite state concurrent programs. The use of temporal logic and related frameworks to specify correctness has greatly facilitated simply thinking about the verification problem. Despite early worries ...
- 0Citation
MetricsTotal Citations0
- research-articlefree
Automatic generation of local repairs for Boolean programs
Roopsha Samanta
The University of Texas at Austin, Austin, TX
,Jyotirmoy V. Deshmukh
The University of Texas at Austin, Austin, TX
,E. Allen Emerson
The University of Texas at Austin, Austin, TX
FMCAD '08: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design•November 2008, Article No.: 27, pp 1-10Automatic techniques for software verification focus on obtaining witnesses of program failure. Such counterexamples often fail to localize the precise cause of an error and usually do not suggest a repair strategy. We present an efficient algorithm to ...
- 13Citation
- 65
- Downloads
MetricsTotal Citations13Total Downloads65Last 12 Months10Last 6 weeks4
- Article
Sviss: symbolic verification of symmetric systems
Thomas Wahl
Computer Systems Institute, ETH Zurich, Switzerland
,Nicolas Blanc
Computer Systems Institute, ETH Zurich, Switzerland
,E. Allen Emerson
Department of Computer Sciences, The University of Texas at Austin
TACAS'08/ETAPS'08: Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems•March 2008, pp 459-462SVISS is a flexible platform for incorporating efficient symmetry reduction into symbolic model checking. The tool comes with an extensive C++ library for system modeling using BDDs and a rich CTLbased model checking engine. Applications range from ...
- 0Citation
- 1
- Downloads
MetricsTotal Citations0Total Downloads1
- chapter
The Beginning of Model Checking: A Personal Perspective
E. Allen Emerson
Department of Computer Sciences, , and Computer Engineering Research Center, The University of Texas at Austin, Austin, USA TX 78712
Model checking provides an automated method for verifying concurrent systems. Correctness specifications are given in temporal logic. The method hinges on an efficient and flexible graph-theoretic reachability algorithm. At the time of its introduction ...
- 9Citation
MetricsTotal Citations9
- chapter
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
Edmund M. Clarke
Aiken Computation Laboratory, Harvard University, Cambridge, USA Mass. 02138
,E. Allen Emerson
Aiken Computation Laboratory, Harvard University, Cambridge, USA Mass. 02138
We Propose a method of constructing concurrent programs in which the <em>synchronization skeleton</em>of the program is automatically synthesized from a high-level (branching time) Temporal Logic specification. The synchronization skeleton is an ...
- 16Citation
MetricsTotal Citations16
- article
Improved verification of hardware designs through antecedent conditioned slicing
Shobha Vasudevan
Computer Engineering Research Center, University of Texas at Austin, Austin, USA 78712
,E. Allen Emerson
Department of Computer Sciences, University of Texas at Austin, Austin, USA 78712
,Jacob A. Abraham
Computer Engineering Research Center, University of Texas at Austin, Austin, USA 78712
Static slicing has shown itself to be a valuable tool, facilitating the verification of hardware designs. In this paper, we present a sharpened notion, antecedent conditioned slicing that provides a more effective abstraction for reducing the size of ...
- 5Citation
MetricsTotal Citations5
- Article
Reducing model checking of the few to the one
E. Allen Emerson
Department of Computer Sciences and Computer Engineering Research Center, The University of Texas, Austin
,Richard J. Trefler
David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada
,Thomas Wahl
Department of Computer Sciences and Computer Engineering Research Center, The University of Texas, Austin
ICFEM'06: Proceedings of the 8th international conference on Formal Methods and Software Engineering•November 2006, pp 94-113• https://doi.org/10.1007/11901433_6Verification of parameterized systems for an arbitrary number of instances is generally undecidable. Existing approaches resort to non-trivial restrictions on the system or lack automation. In practice, applications can often provide a suitable bound on ...
- 5Citation
MetricsTotal Citations5
- article
Under-approximation Heuristics for Grid-based Bounded Model Checking
Subramanian Iyer
Department of Computer Sciences, University of Texas at Austin, Austin, Texas, USA
,Jawahar Jain
Fujitsu Laboratories of America, Inc., Sunnyvale, California, USA
,Debashis Sahoo
Department of Electrical Engineering, Stanford University, Stanford, California, USA
,E. Allen Emerson
Department of Computer Sciences, University of Texas at Austin, Austin, Texas, USA
Electronic Notes in Theoretical Computer Science (ENTCS), Volume 135, Issue 2•February, 2006, pp 31-46 • https://doi.org/10.1016/j.entcs.2005.10.017In this paper, we consider the effect of BDD-based under-approximation on a hybrid approach using BDDs and SAT-BMC for error detection on a computing grid. We experimentally study effect of under-approximation approaches on a non-traditional ...
- 1Citation
MetricsTotal Citations1
- Article
Predictive reachability using a sample-based approach
Debashis Sahoo
Stanford University, Stanford, CA
,Jawahar Jain
Fujitsu Lab. of America
,Subramanian K. Iyer
University of Texas at Austin, Austin, TX
,David Dill
Stanford University, Stanford, CA
,E. Allen Emerson
University of Texas at Austin, Austin, TX
CHARME'05: Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods•October 2005, pp 388-392• https://doi.org/10.1007/11560548_38BDD based reachability methods suffer from lack of robustness in performance, whereby it is difficult to estimate which one should be adopted for a given problem. We present a novel approach that examines a few short samples of the computation leading ...
- 1Citation
MetricsTotal Citations1
- Article
On partitioning and symbolic model checking
Subramanian Iyer
University of Texas at Austin, Austin, TX
,Debashis Sahoo
Stanford University, Stanford, CA
,E. Allen Emerson
University of Texas at Austin, Austin, TX
,Jawahar Jain
Fujitsu Laboratoies of America, Sunnyvale, CA
FM'05: Proceedings of the 2005 international conference on Formal Methods•July 2005, pp 497-511• https://doi.org/10.1007/11526841_33State space partitioning-based approaches have been proposed in the literature to address the state-space explosion problem in model checking. These approaches, whether sequential or distributed, perform a large amount of work in the form of inter-...
- 0Citation
MetricsTotal Citations0
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