Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
45
views
26
references
Top references
cited by
11
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,795
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Tools and Algorithms for the Construction and Analysis of Systems
Proving Nontermination via Safety
other
Author(s):
Hong-Yi Chen
,
Byron Cook
,
Carsten Fuhs
,
Kaustubh Nimkar
,
Peter O’Hearn
Publication date
(Print):
2014
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Security and Safety (S&S)
Most cited references
26
Record
: found
Abstract
: not found
Book Chapter
: not found
Lazy Abstraction with Interpolants
Kenneth McMillan
(2006)
0
comments
Cited
79
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework
Jürgen Giesl
,
Peter Schneider-Kamp
,
René Thiemann
(2006)
0
comments
Cited
44
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Proving and Disproving Termination of Higher-Order Functions
Jürgen Giesl
,
René Thiemann
,
Peter Schneider-Kamp
(2005)
0
comments
Cited
31
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2014
Pages
: 156-171
DOI:
10.1007/978-3-642-54862-8_11
SO-VID:
d6565835-4582-4c25-8fb7-f494727070b1
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 357
Temporal-Logic Based Runtime Observer Pairs for System Health Management of Real-Time Systems
pp. 62
SMT-Based Verification of Software Countermeasures against Side-Channel Attacks
pp. 124
GRASShopper
pp. 140
Alternating Runtime and Size Complexity Analysis of Integer Programs
pp. 156
Proving Nontermination via Safety
pp. 187
FDR3 — A Modern Refinement Checker for CSP
pp. 389
CBMC – C Bounded Model Checker
pp. 398
Lazy-CSeq: A Lazy Sequentialization Tool for C
pp. 402
MU-CSeq: Sequentialization of C Programs by Shared Memory Unwindings
pp. 424
Discounting in LTL
pp. 470
Synthesis for Human-in-the-Loop Control Systems
pp. 515
Computing Conditional Probabilities in Markovian Models Efficiently
pp. 562
SACO: Static Analyzer for Concurrent Objects
pp. 568
VeriMAP: A Tool for Verifying Programs through Transformations
pp. 587
APTE: An Algorithm for Proving Trace Equivalence
pp. 593
The Modest Toolset: An Integrated Environment for Quantitative Modelling and Verification
Similar content
1,795
On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars
Authors:
Artur Jeż
,
Alexander Okhotin
Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language R with R1⊆R⊆R2 for given regular languages R1,R2
Authors:
Kosaburo Hashiguchi
Cervicothoracic nonterminal myelocystocele with mature teratoma
Authors:
Loyola Gressot
,
Carrie Mohila
,
Andrew Jea
…
See all similar
Cited by
11
Proving Nontermination via Safety
Authors:
Hong-Yi Chen
,
Byron Cook
,
Carsten Fuhs
…
Refinement Type Inference via Horn Constraint Optimization
Authors:
Kodai Hashimoto
,
Hiroshi Unno
Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs
Authors:
Takuya Kuwahara
,
Ryosuke Sato
,
Hiroshi Unno
…
See all cited by