Applied Filters
- Stefan Heule
- AuthorRemove filter
People
Colleagues
- Alexander J Summers (3)
- Peter Müller (3)
- Alejandro Russo (2)
- Alex Aiken (2)
- Deian Stefan (2)
- Eric Schkufza (2)
- K Rustan M Leino (2)
- Konstantin Weitz (2)
- Rahul Sharma (2)
- Alexander Hall (1)
- Emina Torlak (1)
- Ioannis T Kassios (1)
- John C. Mitchell (1)
- Jonathan DiLorenzo (1)
- Manu Sridharan (1)
- Marc Nunkesser (1)
- Michael D. Ernst (1)
- Minlan Yu (1)
- Zachary Tatlock (1)
Publication
Proceedings/Book Names
- ECOOP'13: Proceedings of the 27th European conference on Object-Oriented Programming (1)
- EDBT '13: Proceedings of the 16th International Conference on Extending Database Technology (1)
- ESEC/FSE 2015: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering (1)
- FTfJP '11: Proceedings of the 13th Workshop on Formal Techniques for Java-Like Programs (1)
- Guided Randomized Search over Programs for Synthesis and Program Optimization (1)
- HOTOS'15: Proceedings of the 15th USENIX conference on Hot Topics in Operating Systems (1)
- PLDI '16: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation (1)
- Proceedings of the 4th International Conference on Principles of Security and Trust - Volume 9036 (1)
- SIGCOMM '22: Proceedings of the ACM SIGCOMM 2022 Conference (1)
- VMCAI 2013: Proceedings of the 14th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 7737 (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 Access
Published By ACM
Published By ACM
SwitchV: automated SDN switch validation with P4 models
Kinan Dak Albab
Brown University
,Jonathan DiLorenzo
Google
,Stefan Heule
Financial Choice
,Ali Kheradmand
Google
,Steffen Smolka
Google
,Konstantin Weitz
Financial Choice
,Muhammad Timarzi
Google and Harvard University
,Jiaqi Gao
Harvard University
,Minlan Yu
Harvard University and Google
SIGCOMM '22: Proceedings of the ACM SIGCOMM 2022 Conference•August 2022, pp 365-379• https://doi.org/10.1145/3544216.3544220Increasing demand on computer networks continuously pushes manufacturers to incorporate novel features and capabilities into their switches at an ever-accelerating pace. However, the traditional approach to switch development relies on informal ...
- 2Citation
- 1,678
- Downloads
MetricsTotal Citations2Total Downloads1,678Last 12 Months460Last 6 weeks35- 1
Supplementary Materialp365-albab-supp.pdf
- Doctoral Theses
Guided Randomized Search over Programs for Synthesis and Program Optimization
Stefan Heule
Stanford University
,Aiken, Alex
Stanford University
,Mitchell, John
Stanford University
,Sridharan, Manu
Stanford University
AbstractThe ability to automatically reason about programs and extract useful information from them is very important and has received a lot of attention from both the academic community as well as practitioners in industry. Scaling such program analyses ...
- 0Citation
MetricsTotal Citations0
- research-articleOpen Access
Published By ACM
Published By ACM
SpaceSearch: a library for building and verifying solver-aided tools
Konstantin Weitz
University of Washington, USA
,Steven Lyubomirsky
University of Washington, USA
,Stefan Heule
Stanford University, USA
,Emina Torlak
University of Washington, USA
,Michael D. Ernst
University of Washington, USA
,Zachary Tatlock
University of Washington, USA
Proceedings of the ACM on Programming Languages, Volume 1, Issue ICFP•September 2017, Article No.: 25, pp 1-28 • https://doi.org/10.1145/3110269Many verification tools build on automated solvers. These tools reduce problems in a specific application domain (e.g., compiler optimization validation) to queries that can be discharged with a highly optimized solver. But the correctness of the ...
- 7Citation
- 676
- Downloads
MetricsTotal Citations7Total Downloads676Last 12 Months99Last 6 weeks13
- research-articlePublic Access
Published By ACM
Published By ACM
Stratified synthesis: automatically learning the x86-64 instruction set
Stefan Heule
Stanford University, USA
,Eric Schkufza
VMware, USA
,Rahul Sharma
Stanford University, USA
,Alex Aiken
Stanford University, USA
PLDI '16: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation•June 2016, pp 237-250• https://doi.org/10.1145/2908080.2908121The x86-64 ISA sits at the bottom of the software stack of most desktop and server software. Because of its importance, many software analysis and verification tools depend, either explicitly or implicitly, on correct modeling of the semantics of x86-...
Also Published in:
ACM SIGPLAN Notices: Volume 51 Issue 6, June 2016- 68Citation
- 1,587
- Downloads
MetricsTotal Citations68Total Downloads1,587Last 12 Months208Last 6 weeks35
- research-article
Published By ACM
Published By ACM
Mimic: computing models for opaque code
Stefan Heule
Stanford University, USA
,Manu Sridharan
Samsung Research, USA
,Satish Chandra
Samsung Research, USA
ESEC/FSE 2015: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering•August 2015, pp 710-720• https://doi.org/10.1145/2786805.2786875Opaque code, which is executable but whose source is unavailable or hard to process, can be problematic in a number of scenarios, such as program analysis. Manual construction of models is often used to handle opaque code, but this process is tedious ...
- 22Citation
- 299
- Downloads
MetricsTotal Citations22Total Downloads299Last 12 Months20Last 6 weeks3
- Article
The most dangerous code in the browser
Stefan Heule
Stanford University
,Devon Rifkin
Stanford University
,Alejandro Russo
Chalmers University of Technology
,Deian Stefan
Stanford University
HOTOS'15: Proceedings of the 15th USENIX conference on Hot Topics in Operating Systems•May 2015, pp 23-23Browser extensions are ubiquitous. Yet, in today's browsers, extensions are the most dangerous code to user privacy. Extensions are third-party code, like web applications, but run with elevated privileges. Even worse, existing browser extension systems ...
- 5Citation
MetricsTotal Citations5
- Article
IFC Inside: Retrofitting Languages with Dynamic Information Flow Control
Stefan Heule
Stanford University, Stanford, USA
,Deian Stefan
Stanford University, Stanford, USA
,Edward Z. Yang
Stanford University, Stanford, USA
,John C. Mitchell
Stanford University, Stanford, USA
,Alejandro Russo
Chalmers University, Gothenburg, Sweden
Proceedings of the 4th International Conference on Principles of Security and Trust - Volume 9036•April 2015, pp 11-31• https://doi.org/10.1007/978-3-662-46666-7_2Many important security problems in JavaScript, such as browser extension security, untrusted JavaScript libraries and safe integration of mutually distrustful websites mash-ups, may be effectively addressed using an efficient implementation of ...
- 4Citation
MetricsTotal Citations4
- Article
Verification condition generation for permission logics with abstract predicates and abstraction functions
Stefan Heule
ETH Zurich, Switzerland
,Ioannis T. Kassios
ETH Zurich, Switzerland
,Peter Müller
ETH Zurich, Switzerland
,Alexander J. Summers
ETH Zurich, Switzerland
ECOOP'13: Proceedings of the 27th European conference on Object-Oriented Programming•July 2013, pp 451-476• https://doi.org/10.1007/978-3-642-39038-8_19Abstract predicates are the primary abstraction mechanism for program logics based on access permissions, such as separation logic and implicit dynamic frames. In addition to abstract predicates, it is useful to also support classical abstraction ...
- 6Citation
MetricsTotal Citations6
- research-article
Published By ACM
Published By ACM
HyperLogLog in practice: algorithmic engineering of a state of the art cardinality estimation algorithm
Stefan Heule
ETH Zurich and Google, Inc.
,Marc Nunkesser
Google, Inc.
,Alexander Hall
Google, Inc.
EDBT '13: Proceedings of the 16th International Conference on Extending Database Technology•March 2013, pp 683-692• https://doi.org/10.1145/2452376.2452456Cardinality estimation has a wide range of applications and is of particular importance in database systems. Various algorithms have been proposed in the past, and the HyperLogLog algorithm is one of them. In this paper, we present a series of ...
- 212Citation
- 1,324
- Downloads
MetricsTotal Citations212Total Downloads1,324Last 12 Months206Last 6 weeks16
- Article
Abstract Read Permissions: Fractional Permissions without the Fractions
Stefan Heule
ETH Zurich, Switzerland
,K. Rustan Leino
Microsoft Research, USA
,Peter Müller
ETH Zurich, Switzerland
,Alexander J. Summers
ETH Zurich, Switzerland
VMCAI 2013: Proceedings of the 14th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 7737•January 2013, pp 315-334• https://doi.org/10.1007/978-3-642-35873-9_20Fractional Permissions are a popular approach to reasoning about programs that use shared-memory concurrency, because they provide a way of proving data race freedom while permitting concurrent read access. However, specification using fractional ...
- 9Citation
MetricsTotal Citations9
- research-article
Published By ACM
Published By ACM
Fractional permissions without the fractions
Stefan Heule
ETH Zurich
,K. Rustan M. Leino
Microsoft Research
,Peter Müller
ETH Zurich
,Alexander J. Summers
ETH Zurich
FTfJP '11: Proceedings of the 13th Workshop on Formal Techniques for Java-Like Programs•July 2011, Article No.: 1, pp 1-6• https://doi.org/10.1145/2076674.2076675Fractional permissions are a popular approach to reasoning about programs that use shared-memory concurrency. Abstractly, they provide a way of managing that either multiple readers or one writer thread can access a resource concurrently. Concretely, ...
- 18Citation
- 118
- Downloads
MetricsTotal Citations18Total Downloads118Last 12 Months3
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