Zobrazeno 1 - 10
of 57
pro vyhledávání: '"Lindsay Groves"'
Autor:
Brijesh Dongol, Lindsay Groves
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 209, Iss Proc. Refine 2015, Pp 107-111 (2016)
Correctness conditions for concurrent objects describe how atomicity of an abstract sequential object may be decomposed. Many different concurrent objects and proof methods for them have been developed. However, arguments about correctness are conduc
Externí odkaz:
https://doaj.org/article/d5d51a69790b4e22ab28259da0be6dc3
Publikováno v:
Journal of Automated Reasoning. 66:747-803
The quest to develop increasingly sophisticated verification systems continues unabated. Tools such as Dafny, Spec#, ESC/Java, SPARK Ada and Whiley attempt to seamlessly integrate specification and verification into a programming language, in a simil
Publikováno v:
Proceedings of the ACM on Programming Languages. 4:1-27
Path dependent types have long served as an expressive component of the Scala programming language. They allow for the modelling of both bounded polymorphism and a degree of nominal subtyping. Nominality in turn provides the ability to capture first
Publikováno v:
Parallel and Distributed Computing, Applications and Technologies ISBN: 9783030692438
PDCAT
PDCAT
This paper presents a new relaxed balanced concurrent binary search tree using a single word compare and swap primitive, in which all operations are lock-free. Our design separates balancing actions from update operations and includes a lock-free bal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b710eadd3fd360fca82b727343b75bb
https://doi.org/10.1007/978-3-030-69244-5_27
https://doi.org/10.1007/978-3-030-69244-5_27
We present a new relaxed balanced concurrent binary search tree in which all operations are non-blocking. We utilise the notion of separating balancing operation and update operations in a concurrent environment and design a nonblocking balancing ope
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ffe2cdb00bb74e181ac86239f76f2f5
https://doi.org/10.26686/wgtn.13211435.v1
https://doi.org/10.26686/wgtn.13211435.v1
This paper is the technical report for the conference paper "Syntactically Restricting Bounded Polymorphism for Decidable Subtyping", published at The 18th Asian Symposium on Programming Languages and Systems (APLAS 2020). This paper includes the ful
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1aa5814cce2cc78cd6b5353c8a02d68c
Publikováno v:
Programming Languages and Systems ISBN: 9783030644369
APLAS
APLAS
Subtyping of Bounded Polymorphism has long been known to be undecidable when coupled with contra-variance. While decidable forms of bounded polymorphism exist, they all sacrifice either useful properties such as contra-variance (Kernel F\(_{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe3c1a48dca27437c6d16b815bad3f12
https://doi.org/10.1007/978-3-030-64437-6_7
https://doi.org/10.1007/978-3-030-64437-6_7
Publikováno v:
Engineering Trustworthy Software Systems ISBN: 9783030176006
SETSS
SETSS
This tutorial introduces the basic ideas of software specification and verification, which are important techniques for assuring the quality of software and eliminating common kinds of errors such as buffer overflow. The tutorial takes a practical ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f48c518ffeda1e6274edf98b2e3a894
https://doi.org/10.1007/978-3-030-17601-3_1
https://doi.org/10.1007/978-3-030-17601-3_1
Publikováno v:
Journal of Network and Computer Applications. 176:102947
The packet forwarding behaviour of a network relies on the forwarding rules residing in the networking element (e.g. switches and routers) to forward packets. This applies to both traditional networking and software-defined networking (SDN). These fo
Autor:
Lindsay Groves, David J. Pearce
Publikováno v:
Science of Computer Programming. 113:191-220
We reflect on our experiences verifying software with the Whiley verifying compiler.We identify a number of patterns for resolving common verification problems.We report on three case studies illustrating software verification with Whiley. An ongoing