Test case generation for ultimately periodic paths

Saddek Bensalem, Doron Peled, Hongyang Qu, Stavros Tripakis, Lenore Zuck

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Software verification is a hard yet important challenge. In general, the problem is undecidable. Nevertheless, it is still beneficial to look at solutions that either restrict the generality or are heuristic in nature (and do not guarantee to terminate). In this paper, we concentrate on a related problem, that of verifying that a cycle in the flow chart of a program does not terminate. We show some exact and sufficient conditions for cycle nontermination, and provide application for program verification. This allows us to check sequential and concurrent programs against temporal properties, using a truly symbolic approach, and to use temporal logic to guide the selection of test cases in such programs.

Original languageEnglish
Title of host publicationHardware and Software
Subtitle of host publicationVerification and Testing - Third International Haifa Verification Conference, HVC 2007, Proceedings
Pages120-135
Number of pages16
DOIs
StatePublished - 2008
Event3rd International Haifa Verification Conference, HVC 2007 - Haifa, Israel
Duration: 23 Oct 200725 Oct 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4899 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Haifa Verification Conference, HVC 2007
Country/TerritoryIsrael
CityHaifa
Period23/10/0725/10/07

Fingerprint

Dive into the research topics of 'Test case generation for ultimately periodic paths'. Together they form a unique fingerprint.

Cite this