1 citations · 2 across the 4 of their papers we have counts for
Showing cs.SEShow all
3 papers · 1 filter
cs.SE2020
How Testable is Business Software?
Peter Schrammel
Most businesses rely on a significant stack of software to perform their daily operations. This software is business-critical as defects in this software have major impacts on reve…
cs.SE2019
2LS: Heap Analysis and Memory Safety (Competition Contribution)
Viktor Malik, Martin Hruska, Peter Schrammel +1
2LS is a framework for analysis of sequential C programs that can verify and refute program assertions and termination. The 2LS framework is built upon the CPROVER infrastructure a…
cs.SE2015★ 1 cited
Synthesising Interprocedural Bit-Precise Termination Proofs (extended version)
Hong-Yi Chen, Cristina David, Daniel Kroening +2
Proving program termination is key to guaranteeing absence of undesirable behaviour, such as hanging programs and even security vulnerabilities such as denial-of-service attacks. T…