default search action
Aquinas Hobor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c32]Tamer Abdelaziz
, Aquinas Hobor:
Schooling to Exploit Foolish Contracts. BCCA 2023: 388-395 - [c31]Vijeth Aradhya
Robust Overlays Meet Blockchains - On Handling High Churn and Catastrophic Failures. SSS 2023: 191-206 - [c30]Tamer Abdelaziz, Aquinas Hobor:
Smart Learning to Find Dumb Contracts. USENIX Security Symposium 2023: 1775-1792 - [i13]Tamer Abdelaziz, Aquinas Hobor:
Smart Learning to Find Dumb Contracts. CoRR abs/2304.10726 (2023) - [i12]Tamer Abdelaziz
Schooling to Exploit Foolish Contracts. CoRR abs/2304.10737 (2023) - 2022
- [i11]Vijeth Aradhya, Seth Gilbert, Aquinas Hobor:
OverChain: Building a robust overlay with a blockchain. CoRR abs/2201.12809 (2022) - 2021
- [c29]Anshuman Mohan, Wei Xiang Leow, Aquinas Hobor:
Functional Correctness of C Implementations of Dijkstra's, Kruskal's, and Prim's Algorithms. CAV (2) 2021: 801-826 - 2020
- [c28]James Brotherston, Diana Costa, Aquinas Hobor, John Wickerson:
Reasoning over Permissions Regions in Concurrent Separation Logic. CAV (2) 2020: 203-224 - [c27]Linh Tran, Anshuman Mohan
A functional proof pearl: inverting the Ackermann hierarchy. CPP 2020: 129-142 - [c26]Shweta Shinde, Shengyi Wang, Pinghai Yuan, Aquinas Hobor, Abhik Roychoudhury, Prateek Saxena:
BesFS: A POSIX Filesystem for Enclaves with a Mechanized Safety Proof. USENIX Security Symposium 2020: 523-540 - [i10]Xuan Bach Le, Aquinas Hobor, Anthony W. Lin:
Complexity Analysis of Tree Share Structure. CoRR abs/2010.02340 (2020)
2010 – 2019
- 2019
- [j2]Shengyi Wang, Qinxiang Cao, Anshuman Mohan
Certifying graph-manipulating C programs via localizations within data structures. Proc. ACM Program. Lang. 3(OOPSLA): 171:1-171:30 (2019) - [c25]Aquinas Hobor, Elaine Li, Frank Stephan
Pumping, with or Without Choice. APLAS 2019: 427-446 - [c24]Aashish Kolluri, Ivica Nikolic, Ilya Sergey
Exploiting the laws of order in smart contracts. ISSTA 2019: 363-373 - [i9]Qinxiang Cao, Shengyi Wang, Aquinas Hobor, Andrew W. Appel:
Proof Pearl: Magic Wand as Frame. CoRR abs/1909.08789 (2019) - 2018
- [c23]Ivica Nikolic, Aashish Kolluri, Ilya Sergey
Finding The Greedy, Prodigal, and Suicidal Contracts at Scale. ACSAC 2018: 653-663 - [c22]Xuan Bach Le, Aquinas Hobor, Anthony W. Lin:
Complexity Analysis of Tree Share Structure. APLAS 2018: 89-108 - [c21]Xuan Bach Le, Aquinas Hobor:
Logical Reasoning for Disjoint Permissions. ESOP 2018: 385-414 - [c20]Ilya Sergey
Temporal Properties of Smart Contracts. ISoLA (4) 2018: 323-338 - [i8]Ilya Sergey
Scilla: a Smart Contract Intermediate-Level LAnguage. CoRR abs/1801.00687 (2018) - [i7]Ivica Nikolic, Aashish Kolluri, Ilya Sergey
Finding The Greedy, Prodigal, and Suicidal Contracts at Scale. CoRR abs/1802.06038 (2018) - [i6]Shweta Shinde, Shengyi Wang, Pinghai Yuan, Aquinas Hobor, Abhik Roychoudhury, Prateek Saxena:
BesFS: Mechanized Proof of an Iago-Safe Filesystem for Enclaves. CoRR abs/1807.00477 (2018) - [i5]Aashish Kolluri, Ivica Nikolic, Ilya Sergey, Aquinas Hobor, Prateek Saxena:
Exploiting The Laws of Order in Smart Contracts. CoRR abs/1810.11605 (2018) - 2017
- [c19]Ilya Sergey
A Concurrent Perspective on Smart Contracts. Financial Cryptography Workshops 2017: 478-493 - [c18]Xuan Bach Le, Thanh-Toan Nguyen, Wei-Ngan Chin, Aquinas Hobor:
A Certified Decision Procedure for Tree Shares. ICFEM 2017: 226-242 - [i4]Ilya Sergey, Aquinas Hobor:
A Concurrent Perspective on Smart Contracts. CoRR abs/1702.05511 (2017) - 2016
- [c17]Azalea Raad, Aquinas Hobor, Jules Villard
Verifying Concurrent Graph Algorithms. APLAS 2016: 314-334 - [c16]Loi Luu, Duc-Hiep Chu, Hrishi Olickel, Prateek Saxena, Aquinas Hobor:
Making Smart Contracts Smarter. CCS 2016: 254-269 - [c15]Xuan Bach Le, Aquinas Hobor, Anthony W. Lin
Decidability and Complexity of Tree Share Formulas. FSTTCS 2016: 19:1-19:14 - [i3]Loi Luu, Duc-Hiep Chu, Hrishi Olickel, Prateek Saxena, Aquinas Hobor:
Making Smart Contracts Smarter. IACR Cryptol. ePrint Arch. 2016: 633 (2016) - 2015
- [c14]Loi Luu, Ratul Saha, Inian Parameshwaran, Prateek Saxena, Aquinas Hobor:
On Power Splitting Games in Distributed Computation: The Case of Bitcoin Pooled Mining. CSF 2015: 397-411 - [c13]Asankhaya Sharma, Shengyi Wang, Andreea Costea, Aquinas Hobor, Wei-Ngan Chin:
Certified Reasoning with Infinity. FM 2015: 496-513 - [c12]Asankhaya Sharma, Aquinas Hobor, Wei-Ngan Chin:
Specifying Compatible Sharing in Data Structures. ICFEM 2015: 349-365 - [i2]Loi Luu, Ratul Saha, Inian Parameshwaran, Prateek Saxena, Aquinas Hobor:
On Power Splitting Games in Distributed Computation: The Case of Bitcoin Pooled Mining. IACR Cryptol. ePrint Arch. 2015: 155 (2015) - 2014
- [c11]Ton Chanh Le, Cristian Gherghina, Aquinas Hobor, Wei-Ngan Chin:
A Resource-Based Logic for Termination and Non-termination Proofs. ICFEM 2014: 267-283 - 2013
- [c10]Aquinas Hobor, Jules Villard
The ramifications of sharing in data structures. POPL 2013: 523-536 - 2012
- [j1]Aquinas Hobor, Cristian Gherghina:
Barriers in Concurrent Separation Logic: Now With Tool Support! Log. Methods Comput. Sci. 8(2) (2012) - [c9]Xuan Bach Le, Cristian Gherghina, Aquinas Hobor:
Decision Procedures over Sophisticated Fractional Permissions. APLAS 2012: 368-385 - [c8]Robert Dockins, Aquinas Hobor:
Time Bounds for General Function Pointers. MFPS 2012: 139-155 - [e1]Wei-Ngan Chin, Aquinas Hobor:
Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs, FTfJP 2012, Beijing, China, June 12, 2012. ACM 2012, ISBN 978-1-4503-1272-1 [contents] - 2011
- [c7]Martin Henz
Teaching Experience: Logic and Formal Methods with Coq. CPP 2011: 199-215 - [c6]Aquinas Hobor, Cristian Gherghina:
Barriers in Concurrent Separation Logic. ESOP 2011: 276-296 - 2010
- [c5]Aquinas Hobor, Robert Dockins, Andrew W. Appel
A Logical Mix of Approximation and Separation. APLAS 2010: 439-454 - [c4]Aquinas Hobor, Robert Dockins, Andrew W. Appel
A theory of indirection via approximation. POPL 2010: 171-184 - [i1]Robert Dockins, Aquinas Hobor:
A Theory of Termination via Indirection. Modelling, Controlling and Reasoning About State 2010
2000 – 2009
- 2009
- [c3]Robert Dockins, Aquinas Hobor, Andrew W. Appel
A Fresh Look at Separation Algebras and Share Accounting. APLAS 2009: 161-177 - 2008
- [c2]Aquinas Hobor, Andrew W. Appel
Oracle Semantics for Concurrent Separation Logic. ESOP 2008: 353-367 - [c1]Robert Dockins, Andrew W. Appel
Multimodal Separation Logic for Reasoning About Operational Semantics. MFPS 2008: 5-20
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-05-08 21:00 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: