Browse by UCL people
Group by: Type | Date
Number of items: 13.
2019
Gorogiannis, N;
O'Hearn, PW;
Sergey, I;
(2019)
A True Positives Theorem for a Static Race Detector - Extended Version.
Proceedings of the ACM on Programming Languages archive
, 3
, Article 57. 10.1145/3290370.
|
2018
Blackshear, S;
Gorogiannis, N;
O'Hearn, P;
Sergey, I;
(2018)
RacerD: compositional static race detection.
Proceedings of the ACM on Programming Languages
, 2
, Article 144. 10.1145/3276514.
|
García-Pérez, Á;
Gotsman, A;
Meshman, Y;
Sergey, I;
(2018)
Paxos Consensus, Deconstructed and Abstracted.
In: Ahmed, A, (ed.)
Programming Languages and Systems.
(pp. pp. 912-939).
Springer: Cham, Switzerland.
|
Pîrlea, G;
Sergey, I;
(2018)
Mechanising blockchain consensus.
In: Andronick, J and Felty, A, (eds.)
CPP 2018: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs.
(pp. pp. 78-90).
Association for Computing Machinery (ACM): New York, NY, USA.
|
Sergey, I;
Wilcox, JR;
Tatlock, Z;
(2018)
Programming and Proving with Distributed Protocols.
In:
Proceedings of the Programming and Proving with Distributed Protocols - 2017.
(pp. p. 28).
ACM: New York, USA.
|
2017
Delbianco, GA;
Sergey, I;
Nanevski, A;
Banerjee, A;
(2017)
Concurrent Data Structures Linked in Time.
In: Muller, P, (ed.)
Proceedings of the 31st European Conference on Object-Oriented Programming (ECOOP 2017).
(pp. 8:1-8:30).
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik: Dagstuhl, Germany.
|
Delbianco, GA;
Sergey, I;
Nanevski, A;
Banerjee, A;
(2017)
Concurrent Data Structures Linked in Time (Artifact).
Dagstuhl Artifacts Series
, 3
(2)
4:1-4:4.
10.4230/DARTS.3.2.4.
|
Sergey, I;
Hobor, A;
(2017)
A Concurrent Perspective on Smart Contracts.
In: Brenner, M and Rohloff, K and Bonneau, J and Miller, A and Ryan, P Y A and Teague, V and Bracciali, A and Sala, M and Pintore, F and Jakobsson, M, (eds.)
Financial Cryptography and Data Security. FC 2017.
(pp. pp. 478-493).
Springer, Cham
|
Sergey, I;
Vytiniotis, D;
Jones, SLP;
Breitner, J;
(2017)
Modular, higher order cardinality analysis in theory and practice.
Journal of Functional Programming
, 27
, Article e11. 10.1017/S0956796817000016.
|
Wilcox, JR;
Sergey, I;
Tatlock, Z;
(2017)
Programming Language Abstractions for Modularly Verified Distributed Systems.
In: Lerner, BS and Bodik, R and Krishnamu, S, (eds.)
Proceedings of the 2nd Summit on Advances in Programming Languages (SNAPL 2017).
(pp. 19:1-19:12).
Schloss Dagstuhl: Dagstuhl, Germany.
|
2016
Sergey, I;
(2016)
Experience Report: Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms.
In:
ICFP 2016 Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming.
(pp. pp. 193-199).
ACM
|
Sergey, I;
Nanevski, A;
Banerjee, A;
Andres Delbianco, G;
(2016)
Hoare-Style Specifications as Correctness Conditions for Non-linearizable Concurrent Objects.
In:
Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications.
(pp. pp. 92-110).
ACM
|
2015
Sergey, I;
Nanevski, A;
Banerjee, A;
(2015)
Mechanized Verification of Fine-Grained Concurrent Programs.
In:
(Proceedings) 36th ACM SIGPLAN Conference on Programming Language Design and Implementation.
(pp. pp. 77-87).
ACM
|