@Proceedings{ICPC12,
editor = {Dirk Beyer and Arie van Deursen and Michael W. Godfrey},
title = {Proceedings of the 20th IEEE International Conference on Program Comprehension},
publisher = {IEEE},
year = {2012},
isbn = {978-1-4673-1216-5}
}
@InProceedings{TACAS12,
author = {Dirk Beyer},
title = {Competition on Software Verification ({SV-COMP})},
booktitle = {Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and of Analysis Systems (TACAS~2012, Tallinn, Estonia, March 27-30)},
publisher = {Springer-Verlag, Heidelberg},
editor = {C.~Flanagan and B.~K{\"o}nig},
series = {LNCS~7214},
pages = {504--524},
year = {2012},
isbn = {},
keyword = {Software Model Checking},
pdf = {http://www.sosy-lab.org/~dbeyer/Publications/2012-TACAS.Competition_on_Software_Verification.pdf},
url = {http://sv-comp.sosy-lab.org/},
abstract = { },
annote = {
},
}
| Software model checking, as an undecidable problem, has three possible outcomes: (1) the program satisfies the specification, (2) the program does not satisfy the specification, and (3) the model checker fails. The third outcome usually manifests itself in a space-out, time-out, or one component of the verification tool giving up; in all of these failing cases, significant computation is performed by the verification tool before the failure, but no result is reported. We propose to reformulate the model-checking problem as follows, in order to have the verification tool report a summary of the performed work even in case of failure: given a program and a specification, the model checker returns a condition P ---usually a state predicate--- such that the program satisfies the specification under the condition P ---that is, as long as the program does not leave the states in which P is satisfied. In our experiments, we investigated as one major application of conditional model checking the sequential combination of model checkers with information passing. We give the condition that one model checker produces, as input to a second conditional model checker, such that the verification problem for the second is restricted to the part of the state space that is not covered by the condition, i.e., the second model checker works on the problems that the first model checker could not solve. Our experiments demonstrate that repeated application of conditional model checkers, passing information from one model checker to the next, can significantly improve the verification results and performance, i.e., we can now verify programs that we could not verify before. |
@InProceedings{FSE12,
author = {Dirk Beyer and Thomas A. Henzinger and M. Erkan Keremoglu and Philipp Wendler},
title = {Conditional Model Checking: {A} Technique to Pass Information between Verifiers},
booktitle = {Proceedings of the 20th ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE~2012, Cary, NC, November 10-17)},
publisher = {ACM},
editor = {Tevfik Bultan and Martin Robillard},
pages = {},
year = {2012},
isbn = {978-1-4503-1614-9},
keyword = {Software Model Checking},
pdf = {http://www.sosy-lab.org/~dbeyer/Publications/2012-FSE.Conditional_Model_Checking.pdf},
url = {},
abstract = { Software model checking, as an undecidable problem, has three possible outcomes: (1) the program satisfies the specification, (2) the program does not satisfy the specification, and (3) the model checker fails. The third outcome usually manifests itself in a space-out, time-out, or one component of the verification tool giving up; in all of these failing cases, significant computation is performed by the verification tool before the failure, but no result is reported. We propose to reformulate the model-checking problem as follows, in order to have the verification tool report a summary of the performed work even in case of failure: given a program and a specification, the model checker returns a condition P ---usually a state predicate--- such that the program satisfies the specification under the condition P ---that is, as long as the program does not leave the states in which P is satisfied. In our experiments, we investigated as one major application of conditional model checking the sequential combination of model checkers with information passing. We give the condition that one model checker produces, as input to a second conditional model checker, such that the verification problem for the second is restricted to the part of the state space that is not covered by the condition, i.e., the second model checker works on the problems that the first model checker could not solve. Our experiments demonstrate that repeated application of conditional model checkers, passing information from one model checker to the next, can significantly improve the verification results and performance, i.e., we can now verify programs that we could not verify before. },
annote = {
},
}
@InProceedings{LDV12,
author = {Dirk Beyer and Alexander K. Petrenko},
title = {{Linux} Driver Verification},
booktitle = {Proceedings of the 5th International Symposium on Leveraging Applications of Formal Methods, Verification, and Validation (ISoLA~2012, Part II, Heraklion, Crete, October 15-18)},
publisher = {Springer-Verlag, Heidelberg},
editor = {T.~Margaria and B.~Steffen},
series = {LNCS~7610},
pages = {1-6},
year = {2012},
isbn = {},
keyword = {Software Model Checking},
pdf = {http://www.sosy-lab.org/~dbeyer/Publications/2012-ISOLA.Linux_Driver_Verification.pdf},
url = {},
abstract = { },
annote = {
},
}
@InProceedings{FMCAD12,
author = {Dirk Beyer and Philipp Wendler},
title = {Algorithms for Software Model Checking: Predicate Abstraction vs. {IMPACT}},
booktitle = {Proceedings of the 12th International Conference on Formal Methods in Computer-Aided Design (FMCAD~2012, Cambrige, UK, October 22-25)},
publisher = {FMCAD},
editor = {Gianpiero Cabodi and Satnam Singh},
pages = {106-113},
year = {2012},
isbn = {978-1-4673-4831-7},
keyword = {Software Model Checking},
pdf = {http://www.sosy-lab.org/~dbeyer/Publications/2012-FMCAD.Algorithms_for_Software_Model_Checking.pdf},
url = {},
abstract = { },
annote = {
},
}
@InProceedings{RERS12,
author = {Falk Howar and Malte Isberner and Maik Merten and Bernhard Steffen and Dirk Beyer},
title = {The {RERS} Grey-Box Challenge 2012: Analysis of Event-Condition-Action Systems},
booktitle = {Proceedings of the 5th International Symposium on Leveraging Applications of Formal Methods, Verification, and Validation (ISoLA~2012, Part I, Heraklion, Crete, October 15-18)},
publisher = {Springer-Verlag, Heidelberg},
editor = {T.~Margaria and B.~Steffen},
series = {LNCS~7609},
pages = {608-614},
year = {2012},
isbn = {},
keyword = {Software Model Checking},
pdf = {http://www.sosy-lab.org/~dbeyer/Publications/2012-ISOLA.The_RERS_Grey-Box_Challenge_2012_Analysis_of_Event-Condition-Action_Systems.pdf},
url = {},
abstract = { },
annote = {
},
}
|
Online: http://arxiv.org/abs/1212.6542 |
@TechReport{TR1205-PA12,
author = {Dirk Beyer and Stefan L{\"o}we},
title = {Explicit-Value Analysis Based on {CEGAR} and Interpolation},
institution ={Department of Computer Science and Mathematics (FIM), University of Passau (PA)},
number = {MIP-1205},
month = {December},
year = {2012},
keyword = {Software Model Checking},
pdf = {http://www.sosy-lab.org/~dbeyer/Publications/2012-PA-TR1205.Explicit-Value_Analysis_Based_on_CEGAR_and_Interpolation.pdf},
url = {},
abstract = {},
annote = {Online: http://arxiv.org/abs/1212.6542
},
}
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.
This document was translated from BibTEX by bibtex2html