1,720,974 research outputs found
Categories: FSCD 2016
No full text<p>This is the version of the category theory development corresponding to the FSCD 2016 paper:</p>
<p>Category Theory in Coq 8.5<br />
By Amin Timany and Bart Jacobs<br />
(to appear) in FSCD 2016, 22-26 of June 2016, Porto, Portugal</p>
Mechanized Logical Relations for Termination-Insensitive Noninterference - Coq Artifact
No full textA Coq artifact accompanying the paper "Mechanized Logical Relations for Termination-Insensitive Noninterference" by Simon Oddershede Gregersen, Johan Bay, Amin Timany, and Lars Birkedal
Category Theory in Coq 8.5
Full text linkWe report on our experience implementing category theory in Coq 8.5.
Our work formalizes most of basic category theory, including concepts
not covered by existing formalizations, in a library that is fit to be
used as a general-purpose category-theoretical foundation.
Our development particularly takes advantage of two features new to
Coq 8.5: primitive projections for records and universe polymorphism.
Primitive projections allow for well-behaved dualities while universe
polymorphism provides a relative notion of largeness and smallness.
The latter is one of the main contributions of this paper. It pushes
the limits of the new universe polymorphism and constraint inference
algorithm of Coq 8.5.
In this paper we present in detail smallness and largeness in
categories and the foundation they are built on top of. We
furthermore explain how we have used the universe polymorphism of Coq 8.5
to represent smallness and largeness arguments by simply ignoring
them and entrusting them to the universe inference algorithm of Coq 8.5.
We also briefly discuss our experience throughout this
implementation, discuss concepts formalized in this development and
give a comparison with a few other developments of similar extent
Solving Guarded Domain Equations in Presheaves over Ordinals and Mechanizing It
Full text linkConstructing solutions to recursive domain equations is a well-known, important problem in the study of programs and programming languages. Mathematically speaking, the problem is finding a fixed point (up to isomorphism) of a suitable functor over a suitable category. A particularly useful instance, inspired by the step-indexing technique, is where the functor is over (a subcategory of) the category of presheaves over the ordinal ω and the functors are locally-contractive, also known as guarded functors. This corresponds to step-indexing over natural numbers. However, for certain problems, e.g., when dealing with infinite non-determinism, one needs to employ trans-finite step-indexing, i.e., consider presheaf categories over higher ordinals. Prior work on trans-finite step-indexing either only considers a very narrow class of functors over a particularly restricted subcategory of presheaves over higher ordinals, or treats the problem very generally working with sheaves over an arbitrary complete Heyting algebra with a well-founded basis.
In this paper we present a solution to the guarded domain equations problem over all guarded functors over the category of presheaves over ordinal numbers, as well as its mechanization in the Rocq Prover. As the categories of sheaves and presheaves over ordinals are equivalent, our main contribution is simplifying prior work from the setting of the category of sheaves to the setting of the category of presheaves and mechanizing it - presheaves are more amenable to mechanization in a proof assistant
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>
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>
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
- …
