Searching for Counter-Examples Adaptively

Abstract

We describe a framework for finding counter-examples in a transition system. This framework constructs an on-the-fly heuristic for choosing states that are good candidates for exploration. and refines this heuristic when it realizes it made mistakes. The refinements are always relative to the mistakes made, and therefore the amount of overhead needed for constructing the heuristic is minimized. This heuristic is used for partial exploration of the state space, directed toward reaching a user specified set of states. Empirical results show this method to be a strong competitor to the standard BFS based methods.

Contributors

Sharon Keidar

Yoav Rodeh

Conference

Publication date: July 2003

Publication date (Print): July 2003

Page: 1

Affiliations

IBM Haifa Research Laboratory

IBM Haifa Research Laboratory, and Weizmann Institute of Science, Rehovot, Israel

Article

DOI: 10.14236/ewic/IWFM2003.2

Copyright statement: © Sharon Keidar. Published by BCS Learning and Development Ltd. 6th International Workshop on Formal Methods, Dublin City University, Ireland

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: 6th International Workshop on Formal Methods

Conference acronym: FM

Conference number: 6

Conference location: Dublin City University, Ireland

Conference date: 11 July 2003

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: Formal Methods

Product

Product Information: 1477-9358BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/IWFM2003.2

Self URI (journal page): https://ewic.bcs.org/

Categories

Series title: Electronic Workshops in Computing