Petar Maksimović

Petar Maksimović

Auto-generated profile, based on publicly available information

Petar Maksimović

Imperial College London

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 June 2015 in Logic Journal of the IGPL
Verified
Journal Article
Closed access
PDF file
IKIoannis Kokkinis
Ioannis Kokkinis
PMPetar Maksimović
Petar Maksimović
ZOZoran Ognjanović
Zoran Ognjanović
TSThomas Studer
Thomas Studer
In this article, we introduce the probabilistic justification logic PJ, a logic in which we can reason about the probability of justification statements. We present its syntax and semantics, and establish a strong completeness theorem. Moreover, we investigate the relationship between PJ and the logic of uncertain justifications.

2 January 2019 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
PDF file
JSJosé Fragoso Santos
José Fragoso Santos
PMPetar Maksimović
Petar Maksimović
GSGabriela Sampaio
Gabriela Sampaio
PGPhilippa Gardner
Philippa Gardner
We propose a novel, unified approach to the development of compositional symbolic execution tools, bridging the gap between classical symbolic execution and compositional program reasoning based on separation logic. Using this approach, we build JaVerT 2.0, a symbolic analysis tool for JavaScript that follows the language semantics without simplifications. JaVerT 2.0 supports whole-program symbolic testing, verification, and, for the first time, automatic compositional testing based on bi-abduction. The meta-theory underpinning JaVerT 2.0 is developed modularly, streamlining the proofs and informing the implementation. Our explicit treatment of symbolic execution errors allows us to give meaningful feedback to the developer during whole-program symbolic testing and guides the inference of resource of the bi-abductive execution. We evaluate the performance of JaVerT 2.0 on a number of JavaScript data-structure libraries, demonstrating: the scalability of our whole-program symbolic testing; an improvement over the state-of-the-art in JavaScript verification; and the feasibility of automatic compositional testing for JavaScript.

27 December 2017 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
PDF file
JSJosé Fragoso Santos
José Fragoso Santos
PMPetar Maksimović
Petar Maksimović
DNDaiva Naudžiūnienė
Daiva Naudžiūnienė
TWThomas Wood
Thomas Wood
PGPhilippa Gardner
Philippa Gardner
The dynamic nature of JavaScript and its complex semantics make it a difficult target for logic-based verification. We introduce JaVerT, a semi-automatic JavaScript Verification Toolchain, based on separation logic and aimed at the specialist developer wanting rich, mechanically verified specifications of critical JavaScript code. To specify JavaScript programs, we design abstractions that capture its key heap structures (for example, prototype chains and function closures), allowing the developer to write clear and succinct specifications with minimal knowledge of the JavaScript internals. To verify JavaScript programs, we develop JaVerT, a verification pipeline consisting of: JS-2-JSIL, a well-tested compiler from JavaScript to JSIL, an intermediate goto language capturing the fundamental dynamic features of JavaScript; JSIL Verify, a semi-automatic verification tool based on a sound JSIL separation logic; and verified axiomatic specifications of the JavaScript internal functions. Using JaVerT, we verify functional correctness properties of: data-structure libraries (key-value map, priority queue) written in an object-oriented style; operations on data structures such as binary search trees (BSTs) and lists; examples illustrating function closures; and test cases from the official ECMAScript test suite. The verification times suggest that reasoning about larger, more complex code using JaVerT is feasible.

15 July 2021
Verified
Book Chapter
Open access
PDF file
PMPetar Maksimović
Petar Maksimović
SASacha-Élie Ayoun
Sacha-Élie Ayoun
JSJosé Fragoso Santos
José Fragoso Santos
PGPhilippa Gardner
Philippa Gardner
We introduce verification based on separation logic to Gillian, a multi-language platform for the development of symbolic analysis tools which is parametric on the memory model of the target language. Our work develops a methodology for constructing compositional memory models for Gillian, leading to a unified presentation of the JavaScript and C memory models. We verify the JavaScript and C implementations of the AWS Encryption SDK message header deserialisation module, specifically designing common abstractions used for both verification tasks, and find two bugs in the JavaScript and three bugs in the C implementation.

3 September 2018
Verified
Conference Paper
Open access
JSJosé Fragoso Santos
José Fragoso Santos
PMPetar Maksimović
Petar Maksimović
TGThéotime Grohens
Théotime Grohens
JDJulian Dolby
Julian Dolby
PGPhilippa Gardner
Philippa Gardner

10 June 2025 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
SASacha-Élie Ayoun
Sacha-Élie Ayoun
XDXavier Denis
Xavier Denis
PMPetar Maksimović
Petar Maksimović
PGPhilippa Gardner
Philippa Gardner
We propose a hybrid approach to end-to-end Rust verification where the proof effort is split into powerful automated verification of safe Rust and targeted semi-automated verification of unsafe Rust. To this end, we present Gillian-Rust, a proof-of-concept semi-automated verification tool built on top of the Gillian platform that can reason about type safety and functional correctness of unsafe code. Gillian-Rust automates a rich separation logic for real-world Rust, embedding the lifetime logic of RustBelt and the parametric prophecies of RustHornBelt, and is able to verify real-world Rust standard library code with only minor annotations and with verification times orders of magnitude faster than those of comparable tools. We link Gillian-Rust with Creusot, a state-of-the-art verifier for safe Rust, by providing a systematic encoding of unsafe code specifications that Creusot can use but cannot verify, demonstrating the feasibility of our hybrid approach.