According to our database1, Ilya Sergey authored at least 32 papers between 2009 and 2019.
Legend:Book In proceedings Article PhD thesis Other
Structuring the synthesis of heap-manipulating programs.
A true positives theorem for a static race detector.
Distributed Protocol Combinators.
Proceedings of the Practical Aspects of Declarative Languages, 2019
Programming and proving with distributed protocols.
RacerD: compositional static race detection.
Temporal Properties of Smart Contracts.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Industrial Practice, 2018
Paxos Consensus, Deconstructed and Abstracted.
Proceedings of the Programming Languages and Systems, 2018
Mechanising blockchain consensus.
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018
EthIR: A Framework for High-Level Analysis of Ethereum Bytecode.
Proceedings of the Automated Technology for Verification and Analysis, 2018
Finding The Greedy, Prodigal, and Suicidal Contracts at Scale.
Proceedings of the 34th Annual Computer Security Applications Conference, 2018
Modular, higher order cardinality analysis in theory and practice.
J. Funct. Program., 2017
Concurrent Data Structures Linked in Time (Artifact).
Programming Language Abstractions for Modularly Verified Distributed Systems.
Proceedings of the 2nd Summit on Advances in Programming Languages, 2017
A Concurrent Perspective on Smart Contracts.
Proceedings of the Financial Cryptography and Data Security, 2017
Concurrent Data Structures Linked in Time.
Proceedings of the 31st European Conference on Object-Oriented Programming, 2017
Hoare-style specifications as correctness conditions for non-linearizable concurrent objects.
Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, 2016
Experience report: growing and shrinking polygons for random testing of computational geometry algorithms.
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016
Mechanized verification of fine-grained concurrent programs.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity.
Proceedings of the Programming Languages and Systems, 2015
Pushdown flow analysis with abstract garbage collection.
J. Funct. Program., 2014
Modular, higher-order cardinality analysis in theory and practice.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014
Deriving interpretations of the gradually-typed lambda calculus.
Proceedings of the ACM SIGPLAN 2014 workshop on Partial evaluation and program manipulation, 2014
Communicating State Transition Systems for Fine-Grained Concurrent Resources.
Proceedings of the Programming Languages and Systems, 2014
Ownership Types: A Survey.
Proceedings of the Aliasing in Object-Oriented Programming. Types, 2013
Monadic abstract interpreters.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2013
Fixing idioms: a recursion primitive for applicative DSLs.
Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation, 2013
A correspondence between type checking via reduction and type checking via evaluation.
Inf. Process. Lett., 2012
Calculating Graph Algorithms for Dominance and Shortest Path.
Proceedings of the Mathematics of Program Construction - 11th International Conference, 2012
Introspective pushdown analysis of higher-order programs.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012
Gradual Ownership Types.
Proceedings of the Programming Languages and Systems, 2012
From type checking by recursive descent to type checking with an abstract machine.
Proceedings of the Language Descriptions, Tools and Applications, 2011
A semantics for context-oriented programming with layers.
Proceedings of the International Workshop on Context-Oriented Programming, 2009