Publications of year 2012
Books and proceedings

Dirk Beyer,
Arie van Deursen,
and Michael W. Godfrey, editors.
Proceedings of the 20th IEEE International Conference on Program Comprehension, 2012.
IEEE.
[ Material ]@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 = {9781467312165}, url = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6230782}, }
Articles in conference or workshop proceedings

Dirk Beyer.
Competition on Software Verification (SVCOMP).
In C. Flanagan and B. König, editors, Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2012, Tallinn, Estonia, March 2730), LNCS 7214, pages 504524, 2012.
SpringerVerlag, Heidelberg.
[ Material ] [ Article ] Keyword(s): Competition on Software Verification (SVCOMP), Software Model Checking.
Abstract
This report describes the definitions, rules, setup, procedure, and results of the 1st International Competition on Software Verification. The verification community has performed competitions in various areas in the past, and SVCOMP'12 is the first competition of verification tools that take software programs as input and run a fully automatic verification of a given safety property. This year's competition is organized as a satellite event of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS).@InProceedings{TACAS12, author = {Dirk Beyer}, title = {Competition on Software Verification ({SVCOMP})}, booktitle = {Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS~2012, Tallinn, Estonia, March 2730)}, publisher = {SpringerVerlag, Heidelberg}, editor = {C.~Flanagan and B.~K{\"o}nig}, series = {LNCS~7214}, pages = {504524}, year = {2012}, isbn = {}, keyword = {Competition on Software Verification (SVCOMP),Software Model Checking}, pdf = {https://www.sosylab.org/research/pub/2012TACAS.Competition_on_Software_Verification.pdf}, url = {http://svcomp.sosylab.org/}, abstract = { This report describes the definitions, rules, setup, procedure, and results of the 1st International Competition on Software Verification. The verification community has performed competitions in various areas in the past, and SVCOMP'12 is the first competition of verification tools that take software programs as input and run a fully automatic verification of a given safety property. This year's competition is organized as a satellite event of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). }, }

Dirk Beyer,
Thomas A. Henzinger,
M. Erkan Keremoglu,
and Philipp Wendler.
Conditional Model Checking: A Technique to Pass Information between Verifiers.
In Tevfik Bultan and Martin Robillard, editors, Proceedings of the 20th ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE 2012, Cary, NC, November 1017), 2012.
ACM.
[ Article ] Keyword(s): CPAchecker, Software Model Checking.
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 spaceout, timeout, 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 modelchecking 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 1017)}, publisher = {ACM}, editor = {Tevfik Bultan and Martin Robillard}, pages = {}, year = {2012}, isbn = {9781450316149}, keyword = {CPAchecker,Software Model Checking}, pdf = {https://www.sosylab.org/research/pub/2012FSE.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 spaceout, timeout, 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 modelchecking 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. }, }

Dirk Beyer and Alexander K. Petrenko.
Linux Driver Verification.
In T. Margaria and B. Steffen, editors, Proceedings of the 5th International Symposium on Leveraging Applications of Formal Methods, Verification, and Validation (ISoLA 2012, Part II, Heraklion, Crete, October 1518), LNCS 7610, pages 16, 2012.
SpringerVerlag, Heidelberg.
[ Article ] Keyword(s): Software Model Checking.
@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 1518)}, publisher = {SpringerVerlag, Heidelberg}, editor = {T.~Margaria and B.~Steffen}, series = {LNCS~7610}, pages = {16}, year = {2012}, isbn = {}, keyword = {Software Model Checking}, pdf = {https://www.sosylab.org/research/pub/2012ISOLA.Linux_Driver_Verification.pdf}, url = {}, }

Dirk Beyer and Philipp Wendler.
Algorithms for Software Model Checking: Predicate Abstraction vs. IMPACT.
In Gianpiero Cabodi and Satnam Singh, editors, Proceedings of the 12th International Conference on Formal Methods in ComputerAided Design (FMCAD 2012, Cambrige, UK, October 2225), pages 106113, 2012.
FMCAD.
[ Article ] Keyword(s): CPAchecker, Software Model Checking.
Abstract
CEGAR, SMT solving, and Craig interpolation are successful approaches for software model checking. We compare two of the most important algorithms that are based on these techniques: lazy predicate abstraction (as in BLAST) and lazy abstraction with interpolants (as in IMPACT). We unify the algorithms formally (by expressing both in the CPA framework) as well as in practice (by implementing them in the same tool). This allows us to flexibly experiment with new configurations and gain new insights, both about their most important differences and commonalities, as well as about their performance characteristics. We show that the essential contribution of the IMPACT algorithm is the reduction of the number of refinements, and compare this to another approach for reducing refinement effort: adjustableblock encoding (ABE).@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 ComputerAided Design (FMCAD~2012, Cambrige, UK, October 2225)}, publisher = {FMCAD}, editor = {Gianpiero Cabodi and Satnam Singh}, pages = {106113}, year = {2012}, isbn = {9781467348317}, keyword = {CPAchecker,Software Model Checking}, pdf = {https://www.sosylab.org/research/pub/2012FMCAD.Algorithms_for_Software_Model_Checking.pdf}, url = {}, abstract = { CEGAR, SMT solving, and Craig interpolation are successful approaches for software model checking. We compare two of the most important algorithms that are based on these techniques: lazy predicate abstraction (as in BLAST) and lazy abstraction with interpolants (as in IMPACT). We unify the algorithms formally (by expressing both in the CPA framework) as well as in practice (by implementing them in the same tool). This allows us to flexibly experiment with new configurations and gain new insights, both about their most important differences and commonalities, as well as about their performance characteristics. We show that the essential contribution of the IMPACT algorithm is the reduction of the number of refinements, and compare this to another approach for reducing refinement effort: adjustableblock encoding (ABE). }, }

Falk Howar,
Malte Isberner,
Maik Merten,
Bernhard Steffen,
and Dirk Beyer.
The RERS GreyBox Challenge 2012: Analysis of EventConditionAction Systems.
In T. Margaria and B. Steffen, editors, Proceedings of the 5th International Symposium on Leveraging Applications of Formal Methods, Verification, and Validation (ISoLA 2012, Part I, Heraklion, Crete, October 1518), LNCS 7609, pages 608614, 2012.
SpringerVerlag, Heidelberg.
[ Article ] Keyword(s): Software Model Checking.
@InProceedings{RERS12, author = {Falk Howar and Malte Isberner and Maik Merten and Bernhard Steffen and Dirk Beyer}, title = {The {RERS} GreyBox Challenge 2012: Analysis of EventConditionAction Systems}, booktitle = {Proceedings of the 5th International Symposium on Leveraging Applications of Formal Methods, Verification, and Validation (ISoLA~2012, Part I, Heraklion, Crete, October 1518)}, publisher = {SpringerVerlag, Heidelberg}, editor = {T.~Margaria and B.~Steffen}, series = {LNCS~7609}, pages = {608614}, year = {2012}, isbn = {}, keyword = {Software Model Checking}, pdf = {https://www.sosylab.org/research/pub/2012ISOLA.The_RERS_GreyBox_Challenge_2012_Analysis_of_EventConditionAction_Systems.pdf}, url = {}, }

S. Löwe and P. Wendler.
CPAchecker with Adjustable Predicate Analysis (Competition Contribution).
In C. Flanagan and B. König, editors, Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2012, Tallinn, Estonia, March 2730), LNCS 7214, pages 528530, 2012.
SpringerVerlag, Heidelberg.
[ Material ] Keyword(s): CPAchecker, Competition on Software Verification (SVCOMP), Software Model Checking.
Won category ControlFlowInteger and received one silver and two bronze medals in SVCOMP'12@inproceedings{CPACHECKERABECOMP12, author = {S.~L{\"{o}}we and P.~Wendler}, title = {{{\sc CPAchecker}} with Adjustable Predicate Analysis (Competition Contribution)}, booktitle = {Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS~2012, Tallinn, Estonia, March 2730)}, editor = {C.~Flanagan and B.~K{\"o}nig}, series = {LNCS~7214}, pages = {528530}, year = {2012}, publisher = {SpringerVerlag, Heidelberg}, keyword = {CPAchecker,Competition on Software Verification (SVCOMP),Software Model Checking}, url = {https://doi.org/10.1007/9783642287565_40}, doi = {10.1007/9783642287565_40}, annote = {Won category ControlFlowInteger and received one silver and two bronze medals in SVCOMP'12}, }
Internal reports

Dirk Beyer and Stefan Löwe.
ExplicitValue Analysis Based on CEGAR and Interpolation.
Technical report MIP1205, Department of Computer Science and Mathematics (FIM), University of Passau (PA), December 2012.
[ Article ] Keyword(s): CPAchecker, Software Model Checking.
Online: http://arxiv.org/abs/1212.6542
@TechReport{TR1205PA12, author = {Dirk Beyer and Stefan L{\"o}we}, title = {ExplicitValue Analysis Based on {CEGAR} and Interpolation}, institution ={Department of Computer Science and Mathematics (FIM), University of Passau (PA)}, number = {MIP1205}, month = {December}, year = {2012}, keyword = {CPAchecker,Software Model Checking}, pdf = {https://www.sosylab.org/research/pub/2012PATR1205.ExplicitValue_Analysis_Based_on_CEGAR_and_Interpolation.pdf}, url = {}, abstract = {}, annote = {Online: http://arxiv.org/abs/1212.6542
}, }
Theses (PhD, MSc, BSc, Project)

Alexander Driemeyer.
SoftwareVerifikation von JavaProgrammen in CPAchecker.
Bachelor's Thesis, University of Passau, Software Systems Lab, 2012.
Keyword(s): CPAchecker, Software Model Checking.
@misc{DriemeyerJava, author = {Alexander Driemeyer}, title = {SoftwareVerifikation von JavaProgrammen in CPAchecker}, howpublished = {Bachelor's Thesis, University of Passau, Software Systems Lab}, year = {2012}, field = {Computer Science}, keyword = {CPAchecker,Software Model Checking}, }

Karlheinz Friedberger.
Ein typbasierter Ansatz zur Kombination verschiedener Verifikationstechniken.
Bachelor's Thesis, University of Passau, Software Systems Lab, 2012.
[ Article ] Keyword(s): CPAchecker, Software Model Checking.
Won the yearly award of the chamber of industry and commerce of Lower Bavaria (IHK Niederbayern) for an excellent Bachelor's thesis@misc{KarlheinzDomainTypes, author = {Karlheinz Friedberger}, title = {Ein typbasierter Ansatz zur Kombination verschiedener Verifikationstechniken}, howpublished = {Bachelor's Thesis, University of Passau, Software Systems Lab}, year = {2012}, pdf = {https://www.sosylab.org/research/bsc/2012.Friedberger.Ein_typbasierter_Ansatz_zur_Kombination_verschiedener_Verifikationstechniken.pdf}, field = {Computer Science}, keyword = {CPAchecker,Software Model Checking}, annote = {Won the yearly award of the chamber of industry and commerce of Lower Bavaria (IHK Niederbayern) for an excellent Bachelor's thesis}, }

Christopher Jahn.
Implementation of a CFA and ARG Visualization and Navigation Tool in Java.
Master's Thesis, University of Passau, Software Systems Lab, 2012.
Keyword(s): CPAchecker, Software Model Checking.
@misc{JahnVisualization, author = {Christopher Jahn}, title = {Implementation of a {CFA} and {ARG} Visualization and Navigation Tool in Java}, howpublished = {Master's Thesis, University of Passau, Software Systems Lab}, year = {2012}, keyword = {CPAchecker,Software Model Checking}, }
Disclaimer:
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.
Last modified: Fri Dec 14 05:03:24 2018
This document was translated from BibT_{E}X by bibtex2html