Practical verification of embedded software

Straunstrup, J.; Andersen, Henrik Reif; Hulgaard, Henrik; Lind-Nielsen, Jørn; Behrmann, Gerd; Kristoffersen, K.; Skou, Arne; Leerberg, Hh.; Theilgaard, N.B.

doi:10.1109/2.841786

Cited by 14 publications

(11 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that our definition is different from generation of a single product machine. Our understanding of hierarchy, concurrency and flattening is rather similar to that of [1,3,12,6] and substantially different than that of [10,11]. Also note that trace inclusion is a rather strong conformance requirement for input-enabled deterministic systems.…”

Section: Flatteningmentioning

confidence: 91%

On Succinctness of Hierarchical State Diagrams in Absence of Message Passing

Wąsowski

2005

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

Section: Flatteningmentioning

confidence: 91%

On Succinctness of Hierarchical State Diagrams in Absence of Message Passing

Wąsowski

2005

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…A verification algorithm that uses the compositional backward technique is proposed by [18]. Straunstrup et al verify six machine models ranging from 10 to 1,421 state machines, but they do not provide information about the characteristics of the embedded software.…”

Section: Related Workmentioning

confidence: 99%

Semiformal Verification of Embedded Software in Medical Devices Considering Stringent Hardware Constraints

Cordeiro

Fischer

Chen

et al. 2009

2009 International Conference on Embedded Software and Systems

View full text Add to dashboard Cite

show abstract

“…Advances in formal testing and verification methods, such as Symbolic Execution [10][11][12][22][23][24]42,49] and Model Checking [5,6,13,17,21,27,29,30,43,50], have enabled the practical analysis of real-world software. Many of these approaches are based on the formal specification of temporal system properties using sets of infinite sequences of states [1], which can be classified as either safety, liveness, or properties that are neither [31].…”

Section: Introductionmentioning

confidence: 99%

Symbolic Liveness Analysis of Real-World Software

Schemmel

Büning

Dustmann

et al. 2018

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. Liveness violation bugs are notoriously hard to detect, especially due to the difficulty inherent in applying formal methods to realworld programs. We present a generic and practically useful liveness property which defines a program as being live as long as it will eventually either consume more input or terminate. We show that this property naturally maps to many different kinds of real-world programs.To demonstrate the usefulness of our liveness property, we also present an algorithm that can be efficiently implemented to dynamically find lassos in the target program's state space during Symbolic Execution. This extends Symbolic Execution, a well known dynamic testing technique, to find a new class of program defects, namely liveness violations, while only incurring a small runtime and memory overhead, as evidenced by our evaluation. The implementation of our method found a total of five previously undiscovered software defects in BusyBox and the GNU Coreutils. All five defects have been confirmed and fixed by the respective maintainers after shipping for years, most of them well over a decade.

show abstract

Practical verification of embedded software

Cited by 14 publications

References 10 publications

On Succinctness of Hierarchical State Diagrams in Absence of Message Passing

On Succinctness of Hierarchical State Diagrams in Absence of Message Passing

Semiformal Verification of Embedded Software in Medical Devices Considering Stringent Hardware Constraints

Symbolic Liveness Analysis of Real-World Software

Contact Info

Product

Resources

About