default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJesse D. Bingham
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c17]Opeoluwa Matthews, Jesse D. Bingham, Daniel J. Sorin:
Verifiable hierarchical protocols with network invariants on parametric systems. FMCAD 2016: 101-108- 2015
- [j3]Meng Zhang, Jesse D. Bingham, John Erickson, Daniel J. Sorin:
PVCoherence: Designing Flat Coherence Protocols for Scalable Verification. IEEE Micro 35(3): 84-91 (2015) - 2014
- [c16]Meng Zhang, Jesse D. Bingham, John Erickson, Daniel J. Sorin:
PVCoherence: Designing flat coherence protocols for scalable verification. HPCA 2014: 392-403 - 2013
- [c15]Brad D. Bingham, Jesse D. Bingham, John Erickson, Mark R. Greenstreet:
Distributed Explicit State Model Checking of Deadlock Freedom. CAV 2013: 235-241 - 2011
- [c14]Brad D. Bingham, Mark R. Greenstreet, Jesse D. Bingham:
Parameterized verification of deadlock freedom in symmetric cache coherence protocols. FMCAD 2011: 186-195
2000 – 2009
- 2009
- [c13]Jesse D. Bingham, John Erickson, Gaurav Singh, Flemming Andersen:
Industrial strength refinement checking. FMCAD 2009: 180-183 - 2008
- [c12]Jesse D. Bingham:
Automatic Non-Interference Lemmas for Parameterized Model Checking. FMCAD 2008: 1-8 - 2007
- [j2]Jesse D. Bingham, Brad D. Bingham:
Hybrid one-dimensional reversible cellular automata are regular. Discret. Appl. Math. 155(18): 2555-2566 (2007) - [c11]Zvonimir Rakamaric, Jesse D. Bingham, Alan J. Hu:
An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures. VMCAI 2007: 106-121 - 2006
- [j1]Domagoj Babic, Jesse D. Bingham, Alan J. Hu:
B-Cubing: New Possibilities for Efficient SAT-Solving. IEEE Trans. Computers 55(11): 1315-1324 (2006) - [c10]Jesse D. Bingham, Zvonimir Rakamaric:
A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs. VMCAI 2006: 207-221 - 2005
- [c9]Domagoj Babic, Jesse D. Bingham, Alan J. Hu:
Efficient SAT solving: beyond supercubes. DAC 2005: 744-749 - [c8]Domagoj Babic, Jesse D. Bingham, Alan J. Hu:
B-cubing theory: new possibilities for efficient SAT-solving. HLDVT 2005: 192-199 - [c7]Michael R. Marty, Jesse D. Bingham, Mark D. Hill, Alan J. Hu, Milo M. K. Martin, David A. Wood:
Improving Multiple-CMP Systems Using Token Coherence. HPCA 2005: 328-339 - [c6]Jesse D. Bingham, Alan J. Hu:
Empirically Efficient Verification for a Class of Infinite-State Systems. TACAS 2005: 77-92 - 2004
- [c5]Jesse D. Bingham, Anne Condon, Alan J. Hu, Shaz Qadeer, Zhichuan Zhang:
Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values. CAV 2004: 427-439 - [c4]Jesse D. Bingham:
A New Approach to Upward-Closed Set Backward Reachability Analysis. INFINITY 2004: 37-48 - 2003
- [c3]Jesse D. Bingham, Anne Condon, Alan J. Hu:
Toward a decidable notion of sequential consistency. SPAA 2003: 304-313 - 2002
- [c2]Jesse D. Bingham, Alan J. Hu:
Semi-formal Bounded Model Checking. CAV 2002: 280-294 - 2000
- [c1]Jesse D. Bingham, Micaela Serra:
Solving Hamiltonian Cycle on FPGA Technology via Instance to Circuit Mappings. PDPTA 2000
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
