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
73
views
15
references
Top references
cited by
35
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,493
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Aided Verification
Linear Ranking with Reachability
other
Author(s):
Aaron R. Bradley
,
Zohar Manna
,
Henny B. Sipma
Publication date
(Print):
2005
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
ScienceOpen Research
Most cited references
15
Record
: found
Abstract
: not found
Book Chapter
: not found
Quantifier elimination for real closed fields by cylindrical algebraic decompostion
George E. Collins
(1975)
0
comments
Cited
118
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
A Complete Method for the Synthesis of Linear Ranking Functions
Andreas Podelski
,
Andrey Rybalchenko
(2004)
0
comments
Cited
68
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Linear Invariant Generation Using Non-linear Constraint Solving
Michael Colón
,
Sriram Sankaranarayanan
,
Henny B. Sipma
(2003)
0
comments
Cited
58
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2005
Pages
: 491-504
DOI:
10.1007/11513988_48
SO-VID:
57a30a53-ec65-4ffd-9e22-e7806717e435
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 5
Algorithmic Algebraic Model Checking I: Challenges from Systems Biology
pp. 20
SMT-COMP: Satisfiability Modulo Theories Competition
pp. 39
Interpolant-Based Transition Relation Approximation
pp. 67
Abstraction for Falsification
pp. 185
Formal Verification of Backward Compatibility of Microcode
pp. 266
On Statistical Model Checking of Stochastic Systems
pp. 301
F-Soft: Software Verification Platform
pp. 321
DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic
pp. 364
Efficient Monitoring of ω-Languages
pp. 429
Ymer: A Statistical Model Checker
pp. 462
A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs
pp. 476
Data Structure Specifications via Local Equality Axioms
pp. 491
Linear Ranking with Reachability
pp. 534
Automated Assume-Guarantee Reasoning for Simulation Conformance
pp. 548
Symbolic Compositional Verification by Learning Assumptions
Similar content
1,493
A survey of techniques for approximating reachable and controllable sets
Authors:
J.E. Gayek
Reachability and Termination Analysis of Concurrent Quantum Programs
Authors:
Nengkun Yu
,
Mingsheng Ying
Binary Reachability Analysis of Discrete Pushdown Timed Automata
Authors:
Zhe Dang
,
Oscar H. Ibarra
,
Tevfik Bultan
…
See all similar
Cited by
35
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Authors:
Christophe Alias
,
Alain Darte
,
Paul Feautrier
…
Synthesizing software verifiers from proof rules
Authors:
Andrey Rybalchenko
,
Corneliu Popeea
,
Nuno P. Lopes
…
Termination of Integer Linear Programs
Authors:
Mark Braverman
See all cited by