Peter Schrammel

729 total citations
22 papers, 136 citations indexed

About

Peter Schrammel is a scholar working on Computational Theory and Mathematics, Software and Hardware and Architecture. According to data from OpenAlex, Peter Schrammel has authored 22 papers receiving a total of 136 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computational Theory and Mathematics, 19 papers in Software and 9 papers in Hardware and Architecture. Recurrent topics in Peter Schrammel's work include Formal Methods in Verification (19 papers), Software Testing and Debugging Techniques (16 papers) and Software Reliability and Analysis Research (8 papers). Peter Schrammel is often cited by papers focused on Formal Methods in Verification (19 papers), Software Testing and Debugging Techniques (16 papers) and Software Reliability and Analysis Research (8 papers). Peter Schrammel collaborates with scholars based in United Kingdom, France and United States. Peter Schrammel's co-authors include Daniel Kroening, Bertrand Jeannet, Björn Wachter, Tom Melham, Laure Gonnord, Michael Tautschnig, Ajitha Rajan, Subodh Sharma, Cristina David and Sriram Sankaranarayanan and has published in prestigious journals such as ACM SIGPLAN Notices, ACM Transactions on Programming Languages and Systems and Science of Computer Programming.

In The Last Decade

Peter Schrammel

20 papers receiving 133 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Peter Schrammel United Kingdom 9 84 81 68 45 29 22 136
Omar Inverso Italy 6 70 0.8× 55 0.7× 44 0.6× 35 0.8× 44 1.5× 22 118
Bertrand Jeannet France 8 125 1.5× 68 0.8× 63 0.9× 74 1.6× 19 0.7× 14 165
Matthias Heizmann Germany 8 95 1.1× 97 1.2× 27 0.4× 68 1.5× 21 0.7× 15 149
HoonSang Jin United States 7 112 1.3× 91 1.1× 51 0.8× 51 1.1× 33 1.1× 17 173
Arnaud Venet United States 6 90 1.1× 101 1.2× 47 0.7× 79 1.8× 31 1.1× 12 176
David Déharbe Brazil 8 73 0.9× 47 0.6× 25 0.4× 78 1.7× 24 0.8× 28 126
Deepak D’Souza India 6 71 0.8× 37 0.5× 31 0.5× 77 1.7× 28 1.0× 25 132
Jim Grundy United States 7 103 1.2× 39 0.5× 56 0.8× 108 2.4× 17 0.6× 21 157
Daron Vroon United States 7 66 0.8× 46 0.6× 29 0.4× 78 1.7× 22 0.8× 13 120
Laure Gonnord France 7 63 0.8× 35 0.4× 43 0.6× 57 1.3× 11 0.4× 22 93

Countries citing papers authored by Peter Schrammel

Since Specialization
Citations

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

Fields of papers citing papers by Peter Schrammel

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Peter Schrammel

This figure shows the co-authorship network connecting the top 25 collaborators of Peter Schrammel. A scholar is included among the top collaborators of Peter Schrammel 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 Peter Schrammel. Peter Schrammel 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.
Güdemann, Matthias & Peter Schrammel. (2023). BlueCov: Integrating Test Coverage and Model Checking with JBMC. 1695–1697.
2.
Abate, Alessandro, et al.. (2020). Unbounded-Time Safety Verification of Guarded LTI Models with Inputs by Abstract Acceleration. Journal of Automated Reasoning. 65(2). 157–203. 1 indexed citations
3.
Cordeiro, Lucas C., Daniel Kroening, & Peter Schrammel. (2018). Benchmarking of Java Verification Tools at the Software Verification Competition (SV-COMP). ACM SIGSOFT Software Engineering Notes. 43(4). 56–60. 1 indexed citations
4.
Hruška, Martin, et al.. (2018). Template-Based Verification of Heap-Manipulating Programs. 1–9. 1 indexed citations
5.
Chen, Hongyi, Cristina David, Daniel Kroening, Peter Schrammel, & Björn Wachter. (2017). Bit-Precise Procedure-Modular Termination Analysis. ACM Transactions on Programming Languages and Systems. 40(1). 1–38. 4 indexed citations
6.
Schrammel, Peter, et al.. (2017). Incremental bounded model checking for embedded software. Formal Aspects of Computing. 29(5). 911–931. 9 indexed citations
7.
Melham, Tom, et al.. (2017). Effective Verification for Low-Level Software with Competing Interrupts. ACM Transactions on Embedded Computing Systems. 17(2). 1–26. 7 indexed citations
8.
Schrammel, Peter. (2016). Challenges in decomposing encodings of verification problems. Sussex Research Online (University of Sussex). 1 indexed citations
9.
Kroening, Daniel, et al.. (2016). Sound static deadlock analysis for C/Pthreads. 379–390. 17 indexed citations
10.
Mukherjee, Rajdeep, Peter Schrammel, Daniel Kroening, & Tom Melham. (2016). Unbounded Safety Verification for Hardware Using Software Analyzers. 1152–1155.
11.
Kroening, Daniel, et al.. (2015). Effective verification of low-level software with nested interrupts. Design, Automation, and Test in Europe. 229–234. 9 indexed citations
12.
Schrammel, Peter. (2015). Unbounded-time reachability analysis of hybrid systems by abstract acceleration. 51–54. 1 indexed citations
13.
Chen, Hongyi, Cristina David, Daniel Kroening, Peter Schrammel, & Björn Wachter. (2015). Synthesising Interprocedural Bit-Precise Termination Proofs (T). Oxford University Research Archive (ORA) (University of Oxford). 53–64. 13 indexed citations
14.
Kroening, Daniel, et al.. (2015). Effective Verification of Low-Level Software with Nested Interrupts. Design, Automation & Test in Europe Conference & Exhibition (DATE), 2015. 229–234. 11 indexed citations
15.
Jeannet, Bertrand, Peter Schrammel, & Sriram Sankaranarayanan. (2014). Abstract acceleration of general linear loops. ACM SIGPLAN Notices. 49(1). 529–540. 8 indexed citations
16.
Schrammel, Peter, Tom Melham, & Daniel Kroening. (2014). Generating test case chains for reactive systems. International Journal on Software Tools for Technology Transfer. 18(3). 319–334. 5 indexed citations
17.
Rajan, Ajitha, Subodh Sharma, Peter Schrammel, & Daniel Kroening. (2014). Accelerated test execution using GPUs. 97–102. 14 indexed citations
18.
Gonnord, Laure & Peter Schrammel. (2013). Abstract acceleration in linear relation analysis. Science of Computer Programming. 93. 125–153. 11 indexed citations
19.
Schrammel, Peter & Bertrand Jeannet. (2011). Applying abstract acceleration to (co-)reachability analysis of reactive programs. Journal of Symbolic Computation. 47(12). 1512–1532. 8 indexed citations
20.
Schrammel, Peter & Bertrand Jeannet. (2010). Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs. Electronic Notes in Theoretical Computer Science. 267(1). 101–114. 6 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