Search Results - "Ruemmer, Philipp"
-
1
An Automatable Formal Semantics for IEEE-754 Floating-Point Arithmetic
Published in 2015 IEEE 22nd Symposium on Computer Arithmetic (01-06-2015)“…Automated reasoning tools often provide little or no support to reason accurately and efficiently about floating-point arithmetic. As a consequence, software…”
Get full text
Conference Proceeding -
2
OptiRica: Towards an Efficient Optimizing Horn Solver
Published in Electronic proceedings in theoretical computer science (22-11-2022)Get full text
Journal Article -
3
Guiding Craig interpolation with domain-specific abstractions
Published in Acta informatica (01-06-2016)“…Craig interpolation is a standard method to construct and refine abstractions in model checking. To obtain abstractions that are suitable for the verification…”
Get full text
Journal Article -
4
An Approximation Framework for Solvers and Decision Procedures
Published in Journal of automated reasoning (01-01-2017)“…We consider the problem of automatically and efficiently computing models of constraints, in the presence of complex background theories such as floating-point…”
Get full text
Journal Article -
5
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic
Published in Journal of automated reasoning (01-12-2011)“…Craig interpolation has become a versatile tool in formal verification, used for instance to generate program assertions that serve as candidates for loop…”
Get full text
Journal Article -
6
Test-case generation for embedded simulink via formal concept analysis
Published in 2011 48th ACM/EDAC/IEEE Design Automation Conference (DAC) (05-06-2011)“…Mutation testing suffers from the high computational cost of automated test-vector generation, due to the large number of mutants that can be derived from…”
Get full text
Conference Proceeding -
7
Integration of a security type system into a program logic
Published in Theoretical computer science (2008)“…Type systems and program logics are often thought to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a…”
Get full text
Journal Article -
8
Liveness of Randomised Parameterised Systems under Arbitrary Schedulers (Technical Report)
Published 04-06-2016“…We consider the problem of verifying liveness for systems with a finite, but unbounded, number of processes, commonly known as parameterised systems. Typical…”
Get full text
Journal Article -
9
Solving String Constraints With Regex-Dependent Functions Through Transducers With Priorities And Variables
Published 08-11-2021“…Regular expressions are a classical concept in formal language theory. Regular expressions in programming languages (RegEx) such as JavaScript, feature…”
Get full text
Journal Article -
10
Exploring Approximations for Floating-Point Arithmetic using UppSAT
Published 23-11-2017“…We consider the problem of solving floating-point constraints obtained from software verification. We present UppSAT --- a new implementation of a systematic…”
Get full text
Journal Article -
11
Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)
Published 29-10-2017“…We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all…”
Get full text
Journal Article -
12
Learning to Prove Safety over Parameterised Concurrent Systems (Full Version)
Published 20-09-2017“…We revisit the classic problem of proving safety over parameterised concurrent systems, i.e., an infinite family of finite-state concurrent systems that are…”
Get full text
Journal Article -
13
Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic (Extended Technical Report)
Published 03-11-2010“…Craig interpolation has emerged as an effective means of generating candidate program invariants. We present interpolation procedures for the theories of…”
Get full text
Journal Article -
14
Ensuring the Correctness of Lightweight Tactics for JavaCard Dynamic Logic
Published in Electronic notes in theoretical computer science (24-02-2008)“…The interactive theorem prover developed in the KeY project, which implements a sequent calculus for JavaCard Dynamic Logic (JavaCardDL) is based on taclets…”
Get full text
Journal Article -
15
Practical Aspects of Automated Deduction for Program Verification
Published in KI. Künstliche Intelligenz (Oldenbourg) (01-04-2010)“…Software is vital for modern society. It is used in many safety- or security-critical applications, where a high degree of correctness is desirable. Over the…”
Get full text
Magazine Article