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
48
views
27
references
Top references
cited by
17
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,437
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Aided Verification
Solving Existentially Quantified Horn Clauses
other
Author(s):
Tewodros A. Beyene
,
Corneliu Popeea
,
Andrey Rybalchenko
Publication date
(Print):
2013
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
27
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Abstract interpretation
Patrick Cousot
,
Radhia Cousot
(1977)
0
comments
Cited
364
times
– based on
0
reviews
Bookmark
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
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
All references
Author and book information
Book Chapter
Publication date (Print):
2013
Pages
: 869-882
DOI:
10.1007/978-3-642-39799-8_61
SO-VID:
5fee32be-eb6d-408c-9f15-50d1a37f44d2
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 85
Model-Checking Signal Transduction Networks through Decreasing Reachability Sets
pp. 191
Duet: Static Analysis for Unbounded Parallelism
pp. 364
Generating Non-linear Interpolants by Semidefinite Programming
pp. 107
Exploring Parameter Space of Stochastic Biochemical Systems Using Quantitative Model Checking
pp. 141
Partial Orders for Efficient Bounded Model Checking of Concurrent Software
pp. 174
Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates
pp. 242
Exponential-Condition-Based Barrier Certificate Generation for Safety Verification of Hybrid Systems
pp. 264
Efficient Robust Monitoring for STL
pp. 313
Beautiful Interpolants
pp. 347
Disjunctive Interpolants for Horn-Clause Verification
pp. 413
Better Termination Proving through Cooperation
pp. 463
A Fully Verified Executable LTL Model Checker
pp. 527
Polynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties
pp. 559
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
pp. 576
Importance Splitting for Statistical Model Checking Rare Properties
pp. 640
Finite Model Finding in SMT
pp. 690
A Tool for Estimating Information Leakage
pp. 708
Lengths May Break Privacy – Or How to Check for Equivalences with Length
pp. 756
Effectively-Propositional Reasoning about Reachability in Linked Data Structures
pp. 773
Automating Separation Logic Using SMT
pp. 846
Automatic Abstraction in SMT-Based Unbounded Software Model Checking
pp. 863
DiVinE 3.0 – An Explicit-State Model Checker for Multithreaded C & C++ Programs
pp. 869
Solving Existentially Quantified Horn Clauses
pp. 928
PARTY Parameterized Synthesis of Token Rings
Similar content
4,437
When structure competes with semantics: reading Chinese relative clauses.
Authors:
P Zhou
,
Y YAO
,
K. Christianson
…
De Vervulling van de Wet: Een Dogmatische Studie over de Verhouding van Openbaring en Existentie
Authors:
A.A. Van Ruler
,
A Van Ruler
,
A.A. Van Dijk
Experimental and theoretical approaches to relative clauses reconciled: 36 DGfS
Authors:
Nino Grillo
,
Giorgos Spathas
See all similar
Cited by
17
On Solving Universally Quantified Horn Clauses
Authors:
Nikolaj Bjørner
,
Ken McMillan
,
Andrey Rybalchenko
Higher-order constrained horn clauses for verification
Authors:
Toby Cathcart Burn
,
C-H Luke Ong
,
Steven Ramsay
Refinement Type Inference via Horn Constraint Optimization
Authors:
Kodai Hashimoto
,
Hiroshi Unno
See all cited by