default search action
Peter Schrammel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c40]Viktor Malík
, Peter Schrammel
Template-Based Verification of Array-Manipulating Programs. Taming the Infinities of Concurrency 2024: 206-224 - [c39]Zaiyu Cheng
JCWIT: A Correctness-Witness Validator for Java Programs Based on Bounded Model Checking. ISSTA 2024: 1831-1835 - [c38]Bernd Fischer
Static Data Race Detection via Lazy Sequentialization. NETYS 2024: 124-141 - 2023
- [c37]Matthias Güdemann
BlueCov: Integrating Test Coverage and Model Checking with JBMC. SAC 2023: 1695-1697 - [c36]Viktor Malík
2LS: Arrays and Loop Unwinding - (Competition Contribution). TACAS (2) 2023: 529-534 - [i17]Daniel Kroening, Viktor Malík, Peter Schrammel, Tomás Vojnar:
2LS for Program Analysis. CoRR abs/2302.02380 (2023) - [i16]Romain Brenguier, Lucas C. Cordeiro, Daniel Kroening, Peter Schrammel:
JBMC: A Bounded Model Checking Tool for Java Bytecode. CoRR abs/2302.02381 (2023) - [i15]Daniel Kroening, Peter Schrammel, Michael Tautschnig:
CBMC: The C Bounded Model Checker. CoRR abs/2302.02384 (2023) - 2022
- [c35]Bernd Fischer
CBMC-SSM: Bounded Model Checking of C Programs with Symbolic Shadow Memory. ASE 2022: 156:1-156:5 - [c34]Tong Wu
Wit4Java: A Violation-Witness Validator for Java Verifiers (Competition Contribution). TACAS (2) 2022: 484-489 - [d2]Viktor Malík
2LS. Zenodo, 2022 - [i14]Matthias Güdemann, Peter Schrammel:
BlueCov: Integrating Test Coverage and Model Checking with JBMC. CoRR abs/2212.14779 (2022) - 2021
- [j8]Dario Cattaruzza, Alessandro Abate
Unbounded-Time Safety Verification of Guarded LTI Models with Inputs by Abstract Acceleration. J. Autom. Reason. 65(2): 157-203 (2021) - 2020
- [c33]Peter Schrammel
The FMCAD 2020 Student Forum. FMCAD 2020: 1 - [c32]Peter Schrammel:
How testable is business software? FMCAD 2020: 1 - [c31]Viktor Malík
2LS: Heap Analysis and Memory Safety - (Competition Contribution). TACAS (2) 2020: 368-372 - [e1]Maria Christakis, Nadia Polikarpova
Software Verification - 12th International Conference, VSTTE 2020, and 13th International Workshop, NSV 2020, Los Angeles, CA, USA, July 20-21, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12549, Springer 2020, ISBN 978-3-030-63617-3 [contents] - [d1]Viktor Malík
The 2LS Software Verification Framework for SV-COMP 2020. Zenodo, 2020 - [i13]Peter Schrammel:
How Testable is Business Software? CoRR abs/2011.00630 (2020)
2010 – 2019
- 2019
- [c30]Lucas C. Cordeiro
JBMC: Bounded Model Checking for Java Bytecode - (Competition Contribution). TACAS (3) 2019: 219-223 - [i12]Viktor Malík, Martin Hruska, Peter Schrammel, Tomás Vojnar:
2LS: Heap Analysis and Memory Safety (Competition Contribution). CoRR abs/1903.00712 (2019) - 2018
- [j7]Lucas C. Cordeiro
Benchmarking of Java Verification Tools at the Software Verification Competition (SV-COMP). ACM SIGSOFT Softw. Eng. Notes 43(4): 56 (2018) - [j6]Lihao Liang
Effective Verification for Low-Level Software with Competing Interrupts. ACM Trans. Embed. Comput. Syst. 17(2): 36:1-36:26 (2018) - [j5]Hong-Yi Chen, Cristina David, Daniel Kroening
Bit-Precise Procedure-Modular Termination Analysis. ACM Trans. Program. Lang. Syst. 40(1): 1:1-1:38 (2018) - [c29]Lucas C. Cordeiro
JBMC: A Bounded Model Checking Tool for Verifying Java Bytecode. CAV (1) 2018: 183-190 - [c28]Viktor Malík
Template-Based Verification of Heap-Manipulating Programs. FMCAD 2018: 1-9 - [c27]Viktor Malík
2LS: Memory Safety and Non-termination - (Competition Contribution). TACAS (2) 2018: 417-421 - [i11]Lucas C. Cordeiro, Daniel Kroening, Peter Schrammel:
Benchmarking of Java Verification Tools at the Software Verification Competition (SV-COMP). CoRR abs/1809.03739 (2018) - 2017
- [j4]Peter Schrammel
Incremental bounded model checking for embedded software. Formal Aspects Comput. 29(5): 911-931 (2017) - [c26]Kumar Madhukar, Peter Schrammel
Compositional Safety Refutation Techniques. ATVA 2017: 164-183 - [c25]Sumanth Prabhu, Peter Schrammel
Concurrent Program Verification with Invariant-Guided Underapproximation. ATVA 2017: 241-248 - [c24]Rajdeep Mukherjee, Peter Schrammel
Lifting CDCL to Template-Based Abstract Domains for Program Verification. ATVA 2017: 307-326 - [c23]Dario Cattaruzza, Alessandro Abate
Sound Numerical Computations in Abstract Acceleration. NSV@CAV 2017: 38-60 - [c22]Truc L. Nguyen, Peter Schrammel
Parallel bug-finding in concurrent programs via reduced interleaving instances. ASE 2017: 753-764 - [i10]Rajdeep Mukherjee, Peter Schrammel, Leopold Haller, Daniel Kroening, Tom Melham:
Lifting CDCL to Template-based Abstract Domains for Program Verification. CoRR abs/1707.02011 (2017) - 2016
- [j3]Peter Schrammel
Generating test case chains for reactive systems. Int. J. Softw. Tools Technol. Transf. 18(3): 319-334 (2016) - [c21]Rajdeep Mukherjee, Peter Schrammel, Daniel Kroening, Tom Melham:
Unbounded safety verification for hardware using software analyzers. DATE 2016: 1152-1155 - [c20]Daniel Kroening
Sound static deadlock analysis for C/Pthreads. ASE 2016: 379-390 - [c19]Adam Nellis, Pascal Kesseli
Assisted Coverage Closure. NFM 2016: 49-64 - [c18]Peter Schrammel
2LS for Program Analysis - (Competition Contribution). TACAS 2016: 905-907 - [c17]Peter Schrammel
Challenges in Decomposing Encodings of Verification Problems. HCVS@ETAPS 2016: 29-32 - [i9]Daniel Kroening, Daniel Poetzl, Peter Schrammel, Björn Wachter:
Sound Static Deadlock Analysis for C/Pthreads (Extended Version). CoRR abs/1607.06927 (2016) - 2015
- [c16]Daniel Kroening, Lihao Liang, Tom Melham, Peter Schrammel, Michael Tautschnig:
Effective verification of low-level software with nested interrupts. DATE 2015: 229-234 - [c15]Peter Schrammel
Unbounded-time reachability analysis of hybrid systems by abstract acceleration. EMSOFT 2015: 51-54 - [c14]Peter Schrammel
Successful Use of Incremental BMC in the Automotive Industry. FMICS 2015: 62-77 - [c13]Hong-Yi Chen, Cristina David, Daniel Kroening
Synthesising Interprocedural Bit-Precise Termination Proofs (T). ASE 2015: 53-64 - [c12]Martin Brain, Saurabh Joshi, Daniel Kroening
Safety Verification and Refutation by k-Invariants and k-Induction. SAS 2015: 145-161 - [c11]Dario Cattaruzza, Alessandro Abate, Peter Schrammel
Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration. SAS 2015: 312-331 - [i8]Hong-Yi Chen, Cristina David, Daniel Kroening, Peter Schrammel, Björn Wachter:
Synthesising Interprocedural Bit-Precise Termination Proofs (extended version). CoRR abs/1505.04581 (2015) - [i7]Dario Cattaruzza, Alessandro Abate, Peter Schrammel, Daniel Kroening:
Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration (extended version). CoRR abs/1506.05607 (2015) - [i6]Martin Brain, Saurabh Joshi, Daniel Kroening, Peter Schrammel:
Safety Verification and Refutation by k-invariants and k-induction (extended version). CoRR abs/1506.05671 (2015) - [i5]Adam Nellis, Pascal Kesseli, Philippa Ryan Conmy, Daniel Kroening, Peter Schrammel, Michael Tautschnig:
Assisted Coverage Closure. CoRR abs/1509.04587 (2015) - 2014
- [j2]Laure Gonnord, Peter Schrammel
Abstract acceleration in linear relation analysis. Sci. Comput. Program. 93: 125-153 (2014) - [c10]Mohamed Nassim Seghir, Peter Schrammel
Necessary and Sufficient Preconditions via Eager Abstraction. APLAS 2014: 236-254 - [c9]Martin Brain, Cristina David, Daniel Kroening
Model and Proof Generation for Heap-Manipulating Programs. ESOP 2014: 432-452 - [c8]Ajitha Rajan, Subodh Sharma, Peter Schrammel
Accelerated test execution using GPUs. ASE 2014: 97-102 - [c7]Bertrand Jeannet, Peter Schrammel
Abstract acceleration of general linear loops. POPL 2014: 529-540 - [c6]David Monniaux, Peter Schrammel
Speeding Up Logico-Numerical Strategy Iteration. SAS 2014: 253-267 - [i4]David Monniaux, Peter Schrammel:
Scaling up logico-numerical strategy iteration (extended version). CoRR abs/1403.2319 (2014) - [i3]Peter Schrammel, Daniel Kroening, Martin Brain, Ruben Martins, Tino Teige, Tom Bienmüller:
Incremental Bounded Model Checking for Embedded Software (extended version). CoRR abs/1409.5872 (2014) - 2013
- [c5]Peter Schrammel
Chaining Test Cases for Reactive System Testing. ICTSS 2013: 133-148 - [c4]Peter Schrammel
Logico-Numerical Max-Strategy Iteration. VMCAI 2013: 414-433 - [i2]Peter Schrammel, Tom Melham, Daniel Kroening:
Chaining Test Cases for Reactive System Testing (extended version). CoRR abs/1306.3882 (2013) - [i1]Bertrand Jeannet, Peter Schrammel, Sriram Sankaranarayanan:
Abstract Acceleration of General Linear Loops. CoRR abs/1311.0768 (2013) - 2012
- [b1]Peter Schrammel:
Méthodes logico-numériques pour la vérification des systèmes discrets et hybrides. (Logico-Numerical Verification Methods for Discrete and Hybrid Systems). Grenoble Alpes University, France, 2012 - [j1]Peter Schrammel
Applying abstract acceleration to (co-)reachability analysis of reactive programs. J. Symb. Comput. 47(12): 1512-1532 (2012) - [c3]Peter Schrammel
From hybrid data-flow languages to hybrid automata: a complete translation. HSCC 2012: 167-176 - 2011
- [c2]Peter Schrammel
Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs. SAS 2011: 233-248 - 2010
- [c1]Peter Schrammel
Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs. NSAD@SAS 2010: 101-114
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: