1,721,336 research outputs found
Artifact for the intermediate report "Modular termination verification with a higher-order concurrent separation logic" (December 2022) by Justus Fasse and Bart Jacobs
No full text# Artifact for the intermediate report "Modular termination verification with a higher-order concurrent separation logic" (December 2022) by Justus Fasse and Bart Jacobs
The file contains Coq theories built on top of Iris 4.0.
To facilitate comparison with the original Iris/HeapLang development, from which this artifact is derived, the source code is provided as a git bundle.
## How to build
Unpacking the git bundle
- `git clone artifact.bundle`
- `cd artifact`
- You should now already be on the `HeapLangLt` branch
To build
- `opam repo add coq-released https://coq.inria.fr/opam/released`
- `opam pin add coq-iris 4.0.0`
- `dune build`
## Directory structure
The rough directory structure of the development is described next. A precise list of changes can be obtained via git's diff mechanism.
1. The directory `modular_termination/` which defines the global ghost resource tracking the stock of call permissions, an instance of the Auth(Multiset) camera.
The Auth(Multiset) camera is reused in the proof of the concurrent stack with helping.
- `auth_gmultiset.v` constructs the general Auth(Multiset) camera construction with some helper lemmas
- `call_permissions.v` defines the global ghost resource used to reason about HeapLang<'s stock of call permissions
2. `iris_heap_lang/` provides an adapted version of Iris 4.0's HeapLang that defines HeapLang<.
- `lang.v` defines the extended syntax and semantics of HeapLang<
- `iris_heap_lang/primitive_laws.v` contains the `wp_burn` lemma
- `iris_heap_lang/termination.v` gives the definitions and proofs that a HeapLang< program with "enough burns" (defined in the same file) cannot have infinite executions
3. `concurrent-stack-with-helping` contains the code for the case study of a concurrent stack with helping with a HoCAP-style specification. In general both the original code and our adaptions are present. In those cases, the definition with the prime (e.g. `concurrent_stack` vs. `concurrent_stack'`) is the version adapted for termination verification.
- `specs.v` defines the HoCAP-style specification for concurrent stacks
- `concurrent_stack4.v` gives an implementation satisfying the extended specification. The main theorems of the example are `push'_works` (`push'` corresponds to `push_inner` in the report), `push_outer_works` (`push_outer` corresponds to `push` in the report) and finally the proofs that the implementation satisfies the specification: `spec'`.
- `client.v` defines a simple client of the specification. It creates a concurrent stack and pushes 42 twice to it, once in a forked off thread and once in the original thread.This research is partially funded by the Research Fund KU Leuven, and by the Flemish Research Programme Cybersecurity
Hyper Normalisation and Conditioning for Discrete Probability Distributions
No full textNormalisation in probability theory turns a subdistribution into a proper
distribution. It is a partial operation, since it is undefined for the zero
subdistribution. This partiality makes it hard to reason equationally about
normalisation. A novel description of normalisation is given as a
mathematically well-behaved total function. The output of this `hyper'
normalisation operation is a distribution of distributions. It improves
reasoning about normalisation.
After developing the basics of this theory of (hyper) normalisation, it is
put to use in a similarly new description of conditioning, producing a
distribution of conditional distributions. This is used to give a clean
abstract reformulation of refinement in quantitative information flow
Distances between states and between predicates
No full textContains fulltext :
216830.pdf (Publisher’s version ) (Open Access
VeriFast 18.02
No full text<p>Research prototype tool for modular formal verification of C and Java programs</p>
<p>By Bart Jacobs*, Jan Smans*, and Frank Piessens*, with contributions by Pieter Agten*, Cedric Cuypers*, Lieven Desmet*, Jan Tobias Muehlberg*, Willem Penninckx*, Pieter Philippaerts*, Amin Timany*, Thomas Van Eyck*, Gijs Vanspauwen*, Frédéric Vogels*, and external contributors</p>
<p>* imec-DistriNet research group, Department of Computer Science, KU Leuven - University of Leuven, Belgium</p>
<p>List of contributors, with number of commits (as produced by git shortlog -sne):</p>
<pre><code> 1174 Bart Jacobs <[email protected]>
319 Jan Smans <[email protected]>
190 Willem Penninckx <[email protected]>
189 Gijs Vanspauwen <[email protected]>
51 Jan Tobias Muehlberg <[email protected]>
46 Cedric Cuypers <[email protected]>
21 Frederic Vogels <[email protected]>
18 Pieter Philippaerts <[email protected]>
15 Pieter Agten <[email protected]>
12 Dries Vanoverberghe <[email protected]>
10 Willem Penninckx <[email protected]>
8 Amin Timany <[email protected]>
8 Raphael Cauderlier <[email protected]>
8 Kiwamu Okabe <[email protected]>
7 Thomas Van Eyck <[email protected]>
7 Amin Timany <[email protected]>
6 Martin Vassor <[email protected]>
5 Raphaël Cauderlier <[email protected]>
4 Lieven Desmet <[email protected]>
3 Willem Penninckx <[email protected]>
3 Necto <[email protected]>
3 Amin Timany <[email protected]>
2 gijsvanspauwen <[email protected]>
2 Jan Tobias Muehlberg <[email protected]>
2 Mahmoud Mohsen <[email protected]>
1 jafarhamin <[email protected]>
1 Gijs Vanspauwen <[email protected]>
1 Jasper Hawinkel <[email protected]>
1 Jörg Pfähler <[email protected]>
1 Kiwamu Okabe <[email protected]>
</code></pre>
<p>See the attached Git bundle for the full commit/contribution history.</p>
<p>This work was supported in part by the Flemish Research Fund (FWO-Vlaanderen), by the EU FP7 projects SecureChange, STANCE, ADVENT, and VESSEDIA, by Microsoft Research Cambridge as part of the Verified Software Initiative, and by the Research Fund KU Leuven.</p>
verifast/verifast: VeriFast 17.06
No full text<p>Research prototype tool for modular formal verification of C and Java programs</p>
<p>By Bart Jacobs*, Jan Smans*, and Frank Piessens*, with contributions by Pieter Agten*, Cedric Cuypers*, Lieven Desmet*, Jan Tobias Muehlberg*, Willem Penninckx*, Pieter Philippaerts*, Amin Timany*, Thomas Van Eyck*, Gijs Vanspauwen*, Frédéric Vogels*, and external contributors</p>
<p>* imec-DistriNet research group, Department of Computer Science, KU Leuven - University of Leuven, Belgium</p>
<p>All contributors, with number of commits (as produced by git shortlog -sne):<br>
1088 Bart Jacobs <[email protected]><br>
319 Jan Smans <[email protected]><br>
189 Willem Penninckx <[email protected]><br>
188 Gijs Vanspauwen <[email protected]><br>
51 Jan Tobias Muehlberg <[email protected]><br>
46 Cedric Cuypers <[email protected]><br>
21 Frederic Vogels <[email protected]><br>
18 Pieter Philippaerts <[email protected]><br>
15 Pieter Agten <[email protected]><br>
12 Dries Vanoverberghe <[email protected]><br>
10 Willem Penninckx <[email protected]><br>
8 Amin Timany <[email protected]><br>
7 Amin Timany <[email protected]><br>
7 Thomas Van Eyck <[email protected]><br>
6 Martin Vassor <[email protected]><br>
4 Lieven Desmet <[email protected]><br>
4 Raphaël Cauderlier <[email protected]><br>
3 Amin Timany <[email protected]><br>
3 Necto <[email protected]><br>
3 Willem Penninckx <[email protected]><br>
2 Mahmoud Mohsen <[email protected]><br>
2 gijsvanspauwen <[email protected]><br>
1 Gijs Vanspauwen <[email protected]><br>
1 Jan Tobias Muehlberg <[email protected]><br>
1 Jasper Hawinkel <[email protected]><br>
1 Jörg Pfähler <[email protected]><br>
1 Kiwamu Okabe <[email protected]></p>
<p>This work was supported in part by the Flemish Research Fund (FWO-Vlaanderen), by the EU FP7 projects SecureChange, STANCE, ADVENT, and VESSEDIA, by Microsoft Research Cambridge as part of the Verified Software Initiative, and by the Research Fund KU Leuven.</p>
A Recipe for State-and-Effect Triangles
No full textIn the semantics of programming languages one can view programs as statetransformers, or as predicate transformers. Recently the author has introducedstate-and-effect triangles which capture this situation categorically,involving an adjunction between state- and predicate-transformers. The currentpaper exploits a classical result in category theory, part of Jon Beck'smonadicity theorem, to systematically construct such a state-and-effecttriangle from an adjunction. The power of this construction is illustrated inmany examples, covering many monads occurring in program semantics, including(probabilistic) power domains
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
- …
