This map shows the geographic impact of Jan Smans's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jan Smans with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jan Smans more than expected).
This network shows the impact of papers produced by Jan Smans. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jan Smans. The network helps show where Jan Smans may publish in the future.
Co-authorship network of co-authors of Jan Smans
This figure shows the co-authorship network connecting the top 25 collaborators of Jan Smans.
A scholar is included among the top collaborators of Jan Smans based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Jan Smans. Jan Smans is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Jacobs, Bart, Jan Smans, & Frank Piessens. (2017). The Verifast Program Verifier: A Tutorial. Zenodo (CERN European Organization for Nuclear Research).3 indexed citations
2.
Smans, Jan, et al.. (2014). Shared boxes: rely-guarantee reasoning in VeriFast. Lirias (KU Leuven).4 indexed citations
Jacobs, Bart, Jan Smans, & Frank Piessens. (2009). Verification of unloadable C modules - Soundness proof. Lirias (KU Leuven).1 indexed citations
12.
Smans, Jan. (2009). Specification and Automatic Verification of Frame Properties for Java-like Programs (Specificatie en automatische verificatie van frame eigenschappen voor Java-achtige programma's).1 indexed citations
13.
Jacobs, Bart, Jan Smans, & Frank Piessens. (2008). Verifying the Composite pattern using separation logic. Lirias (KU Leuven).5 indexed citations
14.
Jacobs, Bart, Frank Piessens, Jan Smans, K. Rustan M. Leino, & Wolfram Schulte. (2008). A programming model for concurrent object-oriented programs. ACM Transactions on Programming Languages and Systems. 31(1). 1–48.45 indexed citations
15.
Schulte, Wolfram, et al.. (2007). A glimpse of a verifying C compiler.9 indexed citations
16.
Jacobs, Bart, Jan Smans, Frank Piessens, & Wolfram Schulte. (2006). A Statically Verifiable Programming Model for Concurrent ObjectOriented Programs. Lirias (KU Leuven).5 indexed citations
17.
Smans, Jan, Bart Jacobs, & Frank Piessens. (2006). Static verification of Code Access Security policy compliance of .NET applications. Lirias (KU Leuven).
Moors, Adriaan, Jan Smans, Eddy Truyen, Frank Piessens, & Wouter Joosen. (2005). Safe language support for feature composition through feature-based dispatch.1 indexed citations
20.
Win, Bart De, Frank Piessens, Jan Smans, & Wouter Joosen. (2005). Towards a unifying view on security contracts. ACM SIGSOFT Software Engineering Notes. 30(4). 1–7.4 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.