Abstraction Methods for Liveness

Subscribers:
349,000
Published on ● Video Link: https://www.youtube.com/watch?v=q4RsWoX_iQA



Duration: 1:31:20
59 views
3


It is a known fact that finitary state abstraction methods, such as predicate abstraction, are inadequate for verifying general liveness properties or even termination of sequential programs. In this talk we will present an abstraction approach called ranking




Other Videos By Microsoft Research


2016-09-06Generation of dense linear algebra software for shared memory and multicore architectures
2016-09-06The Computation of Economic equilibria [1/2]
2016-09-06Class Morphing: Safely Shaping a Class in the Image of Others [1/3]
2016-09-06Deep Photo and Gigapixel Images
2016-09-06Automated Revision of Distributed and Real-Time Programs
2016-09-06Candidate talk: Knowledge Analysis towards Automatic Question Answering for Discussion Forums
2016-09-06Improving Data Recovery From Embedded Networked Sensing Systems with Fault Detection and Diagnosis
2016-09-06A Discriminative Kernel-based Model to Rank Images from Text Queries
2016-09-06Concurrency Simple and Safe? State of SCOOP
2016-09-06Automated Termination Analysis of Programs using Term Rewriting
2016-09-06Abstraction Methods for Liveness
2016-09-06Effective and Efficient User Interaction for Long Queries [1/17]
2016-09-06Fault Localization in Large-Scale Computing Systems
2016-09-06Delegatable Anonymous Credentials
2016-09-06Enhancing the P racticality and R eachability of Interactive Technology
2016-09-06Computational methods for the detection of positive and lineage-specific selection from genomic data
2016-09-06State of the Art and Future Trends in Mobile Phone-based Augmented Reality
2016-09-06Candidate talk: Computing Nash Equilibria
2016-09-06Exploiting Hardware/Software Interactions for Embedded Systems Design
2016-09-06The Semantic Web in Action
2016-09-06Leveraging Fine-Grained Multithreading for Efficient SIMD Control Flow



Tags:
microsoft research