Test case generation for ultimately periodic paths

Authors:
Saddek Bensalem;Doron Peled;Hongyang Qu;Stavros Tripakis;Lenore Zuck
Affiliations:
Laboratoire Verimag, Gieres, France;Dept. of Computer Science, Bar Ilan University, Ramat Gan, Israel;Dept. of Computing, Imperial College London, London, UK;Cadence Berkeley Labs, Berkeley, CA;Dept. of Computer Science, University of Illinois at Chicago, IL
Venue:
HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
Year:
2007

Citing 14
Cited 0

Design and validation of computer protocols

Design and validation of computer protocols
Hilbert's tenth problem

Hilbert's tenth problem
Model checking

Model checking
An axiomatic basis for computer programming

Communications of the ACM
Simple on-the-fly automatic verification of linear temporal logic

Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Iterative Methods for the Analysis of Petri Nets

Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Basic notions of trace theory

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties

CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
The Mathematica Book

The Mathematica Book
Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Termination proofs for systems code

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
On commutativity based edge lean search

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

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.