Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
108
click to vote
SAS
2001
Springer
117
views
Formal Methods
»
more
SAS 2001
»
An Abstract Analysis of the Probabilistic Termination of Programs
15 years 7 months ago
Download
www-verimag.imag.fr
David Monniaux
Real-time Traffic
Formal Methods
|
SAS 2001
|
claim paper
Related Content
»
Termination Analysis of Java Bytecode
»
On Termination of Binary CLP Programs
»
An abstract MonteCarlo method for the analysis of probabilistic programs
»
Termination Analysis with Types Is More Accurate
»
Automatic Termination Proofs for Programs with ShapeShifting Heaps
»
Transition predicate abstraction and fair termination
»
From Outermost Termination to Innermost Termination
»
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
»
Automatic Termination Analysis of Logic Programs
more »
Post Info
More Details (n/a)
Added
30 Jul 2010
Updated
30 Jul 2010
Type
Conference
Year
2001
Where
SAS
Authors
David Monniaux
Comments
(0)
Researcher Info
Formal Methods Study Group
Computer Vision