Proteus: Computing Disjunctive Loop Summary via Path Dependency Analysis. Xiaofei Xie, Bihuan Chen, Yang Liu, Wei Le, and Xiaohong Li.Non-termination Checking for Imperative Programs. Constraint Solving for Program Verification: Theory and Practice by Example. ARMC: the logical choice for software model checking with abstraction refinement. Andreas Podelski and Andrey Rybalchenko.A complete method for the synthesis of linear ranking functions. The Program Dependence Graph in a Software Development Environment. Practical Methods for Proving Program Termination. A Fast and Precise Static Loop Analysis based on Abstract. Paul Lokuciejewski, Daniel Cordes, Heiko Falk, and Peter Marwedel.The Size-change Principle for Program Termination. LLVM: A compilation framework for lifelong program analysis & transformation. Proving termination of imperative programs using Max-SMT. Daniel Larraz, Albert Oliveras, Enric Rodríguez-Carbonell, and Albert Rubio.Daniel Larraz, Kaustubh Nimkar, Albert Oliveras, Enric Rodríguez-Carbonell, and Albert Rubio.Termination analysis with compositional transition invariants. Daniel Kroening, Natasha Sharygina, Aliaksei Tsitovich, and Christoph M.An Axiomatic Basis for Computer Programming. Ultimate Automizer with Two-track Proofs (Competition Contribution). Matthias Heizmann, Daniel Dietsch, Marius Greitschus, Jan Leike, Betim Musa, Claus Schatzle, and Andreas Podelski.Henzinger, Rupak Majumdar, Andrey Rybalchenko, and Ru-Gang Xu. Termination analysis of C programs using compiler intermediate languages. Stephan Falke, Deepak Kapur, and Carsten Sinz.Leonardo de Moura and Nikolaj Bjørner.Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs. Cristina David, Daniel Kroening, and Matt Lewis.Byron Cook, Abigail See, and Florian Zuleger.Proving program termination (Review article). Byron Cook, Andreas Podelski, and Andrey Rybalchenko.Ranking Function Synthesis for Bit-vector Relations. Byron Cook, Daniel Kroening, Philipp Rümmer, and Christoph M.Temporal property verification as a program analysis task. Byron Cook, Eric Koskinen, and Moshe Vardi.Proving That Programs Eventually Do Something Good. Byron Cook, Alexey Gotsman, Andreas Podelski, Andrey Rybalchenko, and Moshe Y.SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers. Ben-Amram, Carsten Fuhs, and Jürgen Giesl.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |