Making software verification tools really work

For a relat Unbounded Model Checking by k-Induction. Our goal is to provide a powerful and competitive approach for reliable, general-purpose software verification based on BMC and k-induction, implemented in a state-of-the-art software verification f Our goal is to provide a powerful and competitive approach for reliable, general-purpose software verification based on BMC and k-induction, implemented in a state-of-the-art software-verification f An option is to strengthen the property, e.

Documents: Advanced Search Include Citations. Authors: Advanced Search Include Citations. The resulting code is then converted into a logical representation and simplified using rewrite rules.

The simplified formula is finally passed to an SMT solver. It can thus precisely model, e. A small model theorem for rectangular hybrid automata networks by Taylor T. Giese and , Rectangular hybrid automata RHA are finite state ma-chines with additional skewed clocks that are useful for modeling real-time systems. This paper is concerned with the uniform verification of safety properties of networks with arbitrarily many interacting RHAs.

Each automaton is equipp Each automaton is equipped with a finite collection of pointers to other automata that enables it to read their state. This paper presents a small model result for such networks that reduces the verification problem for a system with arbitrarily many processes to a system with finitely many processes. We have implemented a prototype tool called Passel relying on the satisfiability modulo theories SMT solver Z3 to check inductive invariants automatically.

Citation Context We discuss problems and barriers which stand in the way of producing verification tools that are robust, scalable and integrated in the software development cycle. Our analysis is that these barriers span a spectrum from theoretical, through practical and even logistical issues.

Soundness of data flow analyses for weak memory models. Springer, December Donaldson, Daniel Kroening, and Michael Tautschnig. Making software verification tools really work.

Seamless testing for models and code. Improving the confidence in measurement-based timing analysis. Timely time estimates. Seamless model-driven development put into practice.

An introduction to test specification in FQL. How did you specify your test suite? ACM, September Short regular expressions from finite automata: Empirical results. One click from model to reality. Query-driven program testing. Springer, January Optimizing automatic deployment using non-functional requirement annotations. Navigating the requirements jungle. A model driven development approach for implementing reactive systems in hardware. Automatic generation of systemc models from component-based designs for early design validation and performance analysis.

ACM, June A benchmarking suite for measurement-based WCET analysis tools. Awarded Certificate of Merit. Compatibility and reuse in component-based systems via type and unit inference. Tool-support for the analysis of hybrid systems and models. European Design and Automation Association, April Tools for Concurrency and Distributed Systems. RiSE Workshop, February Query-Driven Program Testing. Alpine Verification Meeting, May A Query Language for Programs.

Donaldson , Daniel Kroening , Michael Tautschnig. Venue: ATVA LNCS Citations: 3 - 0 self. Abstract We discuss problems and barriers which stand in the way of producing verification tools that are robust, scalable and integrated in the software development cycle.

Keyphrases software verification tool really verification tool real-world system feature weak memory academic research institution software development cycle tool quality long-term vision standard benchmark practical hurdle logistical issue simple measure development environment program verification accepted semantic model serious verification tool inherent complexity theoretical issue.