Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
28
views
15
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,606
similar
All similar
Record
: found
Abstract
: found
Book Chapter
: found
Is Open Access
Computer Aided Verification
Automata vs Linear-Programming Discounted-Sum Inclusion
other
Author(s):
Suguman Bansal
,
Swarat Chaudhuri
,
Moshe Y. Vardi
Publication date
(Online):
July 18 2018
Publisher:
Springer International Publishing
Read this book at
Publisher
Buy book
Download
XML
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
Smart Contracts Programming Languages
Most cited references
15
Record
: found
Abstract
: not found
Article
: not found
Relationships between nondeterministic and deterministic tape complexities
Walter J. Savitch
(1970)
0
comments
Cited
115
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Finite automata play the repeated prisoner's dilemma
Ariel M. Rubinstein
(1986)
0
comments
Cited
51
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Handbook of Weighted Automata
Manfred Droste
,
Werner Kuich
,
Heiko Vogler
(2009)
0
comments
Cited
35
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2018
Publication date (Online):
July 18 2018
Pages
: 99-116
DOI:
10.1007/978-3-319-96142-2_9
SO-VID:
264b39df-e648-4808-9d23-8ac6ef1fd9bd
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Let this Graph Be Your Witness!
pp. 12
MaxSMT-Based Type Inference for Python 3
pp. 20
The JKind Model Checker
pp. 28
The DEEPSEC Prover
pp. 37
SimpleCAR: An Efficient Bug-Finding Tool Based on Approximate Reachability
pp. 45
StringFuzz: A Fuzzer for String Solvers
pp. 55
Permission Inference for Array Programs
pp. 75
Program Analysis Is Harder Than Verification: A Computability Perspective
pp. 99
Automata vs Linear-Programming Discounted-Sum Inclusion
pp. 117
Model Checking Indistinguishability of Randomized Security Protocols
pp. 136
Lazy Self-composition for Security Verification
pp. 157
SCInfer: Refinement-Based Verification of Software Countermeasures Against Side-Channel Attacks
pp. 178
Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives
pp. 198
Attracting Tangles to Solve Parity Games
pp. 219
Delta-Decision Procedures for Exists-Forall Problems over the Reals
pp. 236
Solving Quantified Bit-Vectors Using Invertibility Conditions
pp. 256
Understanding and Extending Incremental Determinization for 2QBF
pp. 275
The Proof Complexity of SMT Solvers
pp. 294
Model Generation for Quantified Formulas: A Taint-Based Approach
pp. 317
Partial Order Aware Concurrency Sampling
pp. 336
Reasoning About TSO Programs Using Reduction and Abstraction
pp. 354
Quasi-Optimal Partial Order Reduction
pp. 372
On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony
pp. 392
Constrained Dynamic Partial Order Reduction
pp. 413
Formal Verification of a Vehicle-to-Vehicle (V2V) Messaging System
pp. 430
Continuous Formal Verification of Amazon s2n
pp. 447
Symbolic Liveness Analysis of Real-World Software
pp. 467
Model Checking Boot Code from AWS Data Centers
pp. 487
Android Stack Machine
pp. 505
Formally Verified Montgomery Multiplication
pp. 523
Inner and Outer Approximating Flowpipes for Delay Differential Equations
Similar content
3,606
Automata-Based Dynamic Fault Tolerant Task Scheduling Approach in Fog Computing
Authors:
Sara Ghanavati
,
Jemal Abawajy
,
Davood Izadi
Is irregular time estimation a common factor in smoking behavior and delay discounting?
Authors:
C Henrico Stam
,
Frederik M van der Veen
,
Ingmar H A Franken
A multi-period model for optimizing negative emission technology portfolios with economic and carbon value discount rates
Authors:
Maria Victoria Migo-Sumagang
,
Raymond R. Tan
,
Kathleen B. Aviso
See all similar