Paper Info
Title
Inference of ranking functions for proving temporal properties by abstract interpretation
Abstract
We present new static analysis methods for proving liveness properties of programs. In particular, with reference to the hierarchy of temporal properties proposed by Manna and Pnueli, we focus on guarantee (i.e., “something good occurs at least once”) and recurrence (i.e., “something good occurs infinitely often”) temporal properties.
Year
DOI
Venue
2017
10.1016/j.cl.2015.10.001
Computer Languages, Systems & Structures
Keywords
Field
DocType
Static analysis,Abstract interpretation,Liveness,Temporal properties,Ranking functions,Termination
Programming language,Ranking,Computer science,Inference,Abstract interpretation,Static analysis,Theoretical computer science,Operator (computer programming),Hierarchy,Semantics,Liveness
Journal
Volume
ISSN
Citations 
47
1477-8424
3
PageRank 
References 
Authors
0.37
25
2
Name
Order
Citations
PageRank
Caterina Urban1795.39
Antoine Miné2111751.15