logics of programs, pre- and post-conditions, specification techniques; Submitted for publication. Computer Scienc
This is the artifact for the OOPSLA '23 paper 'Proof Automation for Linearizability in Separation Lo...
Abstract. Dynamic data structures are used in most programs. Sep-aration Logic is an established Hoa...
We present an algebraic approach to separation logic. In particular, we give an algebraic characteri...
Framing is important for specification and verification, especially in programs that mutate data str...
Separation logic is a concise method for specifying programs that manipulate dynamically allocated s...
This paper introduces a dynamic logic extension of separation logic. Theassertion language of separa...
Spaceinvader are probably some of the best know examples. There are also formalisations inside theor...
Separation logic is an extension of Hoare logic that allows local reasoning about mutable data struc...
Program Logic a la Hoare Logic for reasoning about programs with pointers (or references to shared m...
Direct approach vs. translation for non-classical logics In order to mechanize non-classical logics,...
Specification languages have long featured ways to describe what does not change when an imperative ...
Two programming disciplines • Locality: One function accesses only a few data structures. • Informat...
Separation logic is an extension of Hoare logic which permits reasoning about low-level imperative p...
In the embedded, multimedia community, designers deal with data management at different levels of ab...
The work presented in this memory covers the most significant topics I have been interested in durin...
This is the artifact for the OOPSLA '23 paper 'Proof Automation for Linearizability in Separation Lo...
Abstract. Dynamic data structures are used in most programs. Sep-aration Logic is an established Hoa...
We present an algebraic approach to separation logic. In particular, we give an algebraic characteri...
Framing is important for specification and verification, especially in programs that mutate data str...
Separation logic is a concise method for specifying programs that manipulate dynamically allocated s...
This paper introduces a dynamic logic extension of separation logic. Theassertion language of separa...
Spaceinvader are probably some of the best know examples. There are also formalisations inside theor...
Separation logic is an extension of Hoare logic that allows local reasoning about mutable data struc...
Program Logic a la Hoare Logic for reasoning about programs with pointers (or references to shared m...
Direct approach vs. translation for non-classical logics In order to mechanize non-classical logics,...
Specification languages have long featured ways to describe what does not change when an imperative ...
Two programming disciplines • Locality: One function accesses only a few data structures. • Informat...
Separation logic is an extension of Hoare logic which permits reasoning about low-level imperative p...
In the embedded, multimedia community, designers deal with data management at different levels of ab...
The work presented in this memory covers the most significant topics I have been interested in durin...
This is the artifact for the OOPSLA '23 paper 'Proof Automation for Linearizability in Separation Lo...
Abstract. Dynamic data structures are used in most programs. Sep-aration Logic is an established Hoa...
We present an algebraic approach to separation logic. In particular, we give an algebraic characteri...