Back to Results
First PageMeta Content
Program logic / Formal methods / Mathematical logic / Static program analysis / Termination analysis / Predicate transformer semantics / Transitive closure / Algorithm / Control flow / Mathematics / Abstract algebra / Theoretical computer science


Termination Analysis with Compositional Transition Invariants? Daniel Kroening1 , Natasha Sharygina2,4 , Aliaksei Tsitovich2 , and Christoph M. Wintersteiger3 1
Add to Reading List

Document Date: 2010-04-30 09:51:18


Open Document

File Size: 214,39 KB

Share Result on Facebook

Company

Computing Laboratory / Security Group / Intel / UK Formal Verification / /

Country

Switzerland / United States / United Kingdom / /

Facility

Oxford University / Carnegie Mellon University / University of Lugano / /

IndustryTerm

transition systems / trivial algorithm / /

OperatingSystem

Microsoft Windows / /

Organization

School of Computer Science / Computer Systems Institute / Carnegie Mellon University / European Union / Oxford University / Swiss National Science Foundation / Tasso Foundation / University of Lugano / /

Person

Then / /

/

Position

Driver / Model / /

ProgrammingLanguage

R / /

ProvinceOrState

Rhode Island / /

Technology

alternative algorithm / trivial algorithm / single-loop / end end end Algorithm / Compositional Termination Analysis Algorithm / /

URL

http /

SocialTag