Marco Patrignani

726 total citations
29 papers, 281 citations indexed

About

Marco Patrignani is a scholar working on Artificial Intelligence, Signal Processing and Computer Networks and Communications. According to data from OpenAlex, Marco Patrignani has authored 29 papers receiving a total of 281 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Artificial Intelligence, 13 papers in Signal Processing and 8 papers in Computer Networks and Communications. Recurrent topics in Marco Patrignani's work include Security and Verification in Computing (22 papers), Logic, programming, and type systems (14 papers) and Advanced Malware Detection Techniques (13 papers). Marco Patrignani is often cited by papers focused on Security and Verification in Computing (22 papers), Logic, programming, and type systems (14 papers) and Advanced Malware Detection Techniques (13 papers). Marco Patrignani collaborates with scholars based in Belgium, Germany and United States. Marco Patrignani's co-authors include Dave Clarke, Frank Piessens, Dominique Devriese, Deepak Garg, Amal Ahmed, Bart Jacobs, Raoul Strackx, Pieter Agten, Gilbert Bernstein and Ross Daly and has published in prestigious journals such as SHILAP Revista de lepidopterología, ACM Computing Surveys and ACM SIGPLAN Notices.

In The Last Decade

Marco Patrignani

27 papers receiving 275 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Marco Patrignani Belgium 11 236 142 95 62 34 29 281
Ghada Dessouky Germany 11 260 1.1× 114 0.8× 118 1.2× 74 1.2× 24 0.7× 17 308
Joseph Tassarotti United States 10 253 1.1× 58 0.4× 80 0.8× 149 2.4× 86 2.5× 24 308
Sumant Kowshik United States 7 280 1.2× 109 0.8× 185 1.9× 149 2.4× 19 0.6× 14 361
Fraser Brown United States 10 122 0.5× 77 0.5× 67 0.7× 34 0.5× 22 0.6× 21 207
Peter Collingbourne United Kingdom 4 164 0.7× 130 0.9× 69 0.7× 52 0.8× 23 0.7× 4 225
Gordon Stewart United States 7 191 0.8× 34 0.2× 60 0.6× 73 1.2× 93 2.7× 24 226
Gregory J. Duck Singapore 10 237 1.0× 114 0.8× 71 0.7× 114 1.8× 35 1.0× 23 358
Sebastian Österlund Netherlands 6 194 0.8× 154 1.1× 83 0.9× 61 1.0× 9 0.3× 7 284
Suan Hsi Yong United States 6 149 0.6× 66 0.5× 94 1.0× 61 1.0× 12 0.4× 8 204
David Costanzo United States 8 214 0.9× 68 0.5× 92 1.0× 118 1.9× 59 1.7× 8 252

Countries citing papers authored by Marco Patrignani

Since Specialization
Citations

This map shows the geographic impact of Marco Patrignani'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 Marco Patrignani with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marco Patrignani more than expected).

Fields of papers citing papers by Marco Patrignani

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Marco Patrignani. 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 Marco Patrignani. The network helps show where Marco Patrignani may publish in the future.

Co-authorship network of co-authors of Marco Patrignani

This figure shows the co-authorship network connecting the top 25 collaborators of Marco Patrignani. A scholar is included among the top collaborators of Marco Patrignani 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 Marco Patrignani. Marco Patrignani 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.
Gollamudi, Anitha, et al.. (2023). MSWasm: Soundly Enforcing Memory-Safe Execution of Unsafe Code. Proceedings of the ACM on Programming Languages. 7(POPL). 425–454. 13 indexed citations
2.
Devriese, Dominique, Marco Patrignani, & Frank Piessens. (2022). Two Parametricities Versus Three Universal Types. ACM Transactions on Programming Languages and Systems. 44(4). 1–43. 1 indexed citations
3.
Patrignani, Marco, et al.. (2022). Automatic Detection of Speculative Execution Combinations. Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. 965–978. 10 indexed citations
4.
Patrignani, Marco, et al.. (2021). On the semantic expressiveness of recursive types. Institutional Research Information System (Università degli Studi di Trento). 6 indexed citations
5.
Patrignani, Marco, Amal Ahmed, & Dave Clarke. (2019). Formal Approaches to Secure Compilation. ACM Computing Surveys. 51(6). 1–36. 31 indexed citations
6.
Blanco, Roberto, et al.. (2018). Exploring Robust Property Preservation for Secure Compilation.. arXiv (Cornell University). 1 indexed citations
7.
Devriese, Dominique, et al.. (2017). Modular, Fully-abstract Compilation by Approximate Back-translation. SHILAP Revista de lepidopterología. 11 indexed citations
8.
Devriese, Dominique, Marco Patrignani, & Frank Piessens. (2017). Parametricity versus the universal type. Proceedings of the ACM on Programming Languages. 2(POPL). 1–23. 11 indexed citations
9.
Patrignani, Marco & Deepak Garg. (2017). Secure Compilation and Hyperproperty Preservation. Institutional Research Information System (Università degli Studi di Trento). 392–404. 14 indexed citations
10.
Patrignani, Marco, et al.. (2016). Implementing a secure abstract machine. Institutional Research Information System (Università degli Studi di Trento). 2041–2048. 3 indexed citations
11.
Patrignani, Marco, et al.. (2016). A Formal Model for Capability Machines An Illustrative Case Study towards Secure Compilation to CHERI. Max Planck Digital Library. 1 indexed citations
12.
Devriese, Dominique, Marco Patrignani, & Frank Piessens. (2016). Fully-abstract compilation by approximate back-translation. ACM SIGPLAN Notices. 51(1). 164–177. 5 indexed citations
13.
Patrignani, Marco & Dave Clarke. (2015). Fully abstract trace semantics for protected module architectures. Computer Languages Systems & Structures. 42. 22–45. 9 indexed citations
14.
Patrignani, Marco. (2015). The Tome of Secure Compilation: Fully Abstract Compilation to Protected Modules Architectures. 3 indexed citations
15.
Patrignani, Marco, Dominique Devriese, & Frank Piessens. (2015). Multi-module fully abstract compilation (extended abstract). Lirias (KU Leuven). 2 indexed citations
16.
Devriese, Dominique, Marco Patrignani, & Frank Piessens. (2015). Fully-abstract compilation by approximate back-translation: Technical appendix. Lirias (KU Leuven). 1 indexed citations
17.
Patrignani, Marco, Pieter Agten, Raoul Strackx, et al.. (2015). Secure Compilation to Protected Module Architectures. ACM Transactions on Programming Languages and Systems. 37(2). 1–50. 51 indexed citations
18.
Patrignani, Marco & Dave Clarke. (2014). Fully abstract trace semantics for low-level isolation mechanisms. Institutional Research Information System (Università degli Studi di Trento). 1562–1569. 6 indexed citations
19.
Patrignani, Marco & Dave Clarke. (2013). Fully abstract trace semantics for low-level isolation mechanisms — Extended version. Lirias (KU Leuven).
20.
Patrignani, Marco, Nelson Matthys, José Proença, Danny Hughes, & Dave Clarke. (2012). Formal analysis of policies in wireless sensor network applications. Lirias (KU Leuven). 51. 15–21. 3 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026