Back to Results
First PageMeta Content
IP / KeY / Byron Cook / Formal methods / Applied mathematics / Theoretical computer science / Static program analysis / Termination analysis


Cooperation For Better Termination Proving Marc Brockschmidt1 , Byron Cook2 , and Carsten Fuhs3 1 2 3
Add to Reading List

Document Date: 2013-08-26 10:13:12

Open Document

File Size: 469,56 KB

Share Result on Facebook

Company

Microsoft / /

Country

Germany / /

/

Facility

RWTH Aachen University / University College London / /

IndustryTerm

software verifiers / software model checking / termination proof search / program termination proving tools / rank function synthesis tool / proof search / Software verification / /

Organization

University College London / RWTH Aachen University / /

Person

Grégoire Sutre / Peter Lee / Marc Brockschmidt / Thomas A. Henzinger / Laure Gonnord / Corneliu Popeea / Andrey Rybalchenko / Aaron R. Bradley / Stephen Magill / Paul Feautrier / Ken McMillan / Viktor Schuppan / Alain Darte / Aliaksei Tsitovich / Cyrille Artho / Natasha Sharygina / Andreas Podelski / Florian Zuleger / Christoph M. Wintersteiger / Thomas Ball / Rupak Majumdar / Carsten Fuhs / Daniel Kroening / Henny B. Sipma / Byron Cook / Ranjit Jhala / Arie Gurfinkel / Sergey Grebenshchikov / Aws Albarghouthi / Armin Biere / Zohar Manna / Edmund Clarke / Yih-Kuen Tsay / Ming-Hsien Tsai / Sriram K. Rajamani / Marsha Chechik / Karen Yorav / Christophe Alias / /

ProgrammingLanguage

C / /

Technology

CAV / interpolation-based algorithm / /

URL

http /

SocialTag