Compositional Security Analysis for Binaries
Lead Research Organisation:
University College London
Department Name: Computer Science
Abstract
Abstracts are not currently available in GtR for all funded research. This is normally because the abstract was not required at the time of proposal submission, but may be because it included sensitive information such as personal details.
Organisations
Publications
Domagoj Babic
(2013)
Proving termination of non-linear command sequences
in Formal Aspects of Computing (special issue from SEFM), 2013
Cook B
(2013)
Ranking function synthesis for bit-vector relations
in Formal Methods in System Design
Byron Cook
(2014)
Faster Temporal Reasoning for infinite-state programs
in Formal Methods of Computer Aided Design 2014
Byron Cook
(2014)
Disproving termination with overapproximation
in Formal Methods of Computer Aided Design 2014
Byron Cook
(2017)
Verifying Increasingly Expressive Temporal Logics for Infinite-State Systems
in Journal of the the ACM
Byron Cook
(2015)
Fairness for infinite-state systems
Andrey Chudnov
(2018)
Continuous formal verification of Amazon s2n
B. Cook
(2018)
Model checking boot code from AWS data centers
Byron Cook
(2015)
On automation of CTL* verification for infinite-state systems
Byron Cook
(2018)
Formal reasoning about the security of Amazon Web Services
Description | They have been used in industry. |
First Year Of Impact | 2017 |
Sector | Digital/Communication/Information Technologies (including Software) |
Impact Types | Societal |