ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
4
views
5
references
Top references
cited by
9
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,317
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Verification, Model Checking, and Abstract Interpretation
Lazy Synthesis
other
Author(s):
Bernd Finkbeiner
,
Swen Jacobs
Publication date
(Print):
2012
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
Genomic Prediction: Concepts, Benchmarks & Synthesis
Most cited references
5
Record
: found
Abstract
: not found
Conference Proceedings
: not found
The temporal logic of programs
Amir Pnueli
(1977)
0
comments
Cited
393
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Counterexample-Guided Abstraction Refinement
Edmund Clarke
,
Orna Grumberg
,
Somesh Jha
…
(2000)
0
comments
Cited
157
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Combinatorial sketching for finite programs
Armando Solar-Lezama
,
Vijay Saraswat
,
Liviu Tancau
…
(2006)
0
comments
Cited
27
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 219-234
DOI:
10.1007/978-3-642-27940-9_15
SO-VID:
07a19081-f090-4331-80cd-a3b29659a38f
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data
pp. 23
Software Verification with Liquid Types
pp. 24
Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs
pp. 39
Whale: An Interpolation-Based Algorithm for Inter-procedural Verification
pp. 56
Synchronizability for Verification of Asynchronously Communicating Systems
pp. 72
On the Termination of Integer Loops
pp. 88
Verification of Gap-Order Constraint Abstractions of Counter Systems
pp. 104
On Application of Multi-Rooted Binary Decision Diagrams to Probabilistic Model Checking
pp. 119
Regression Verification for Multi-threaded Programs
pp. 136
Crowfoot: A Verifier for Higher-Order Store Programs
pp. 152
Synthesizing Protocols for Digital Contract Signing
pp. 169
Model Checking Information Flow in Reactive Systems
pp. 186
Splitting via Interpolants
pp. 202
Automatic Inference of Access Permissions
pp. 219
Lazy Synthesis
pp. 235
Donut Domains: Efficient Non-convex Domains for Abstract Interpretation
pp. 251
Inferring Canonical Register Automata
pp. 267
Alternating Control Flow Reconstruction
pp. 283
Effective Synthesis of Asynchronous Systems from GR(1) Specifications
pp. 299
Sound Non-statistical Clustering of Static Analysis Alarms
pp. 315
Automating Induction with an SMT Solver
pp. 332
Modeling Asynchronous Message Passing for C Programs
pp. 348
Local Symmetry and Compositional Verification
pp. 363
versat: A Verified Modern SAT Solver
pp. 379
Decision Procedures for Region Logic
pp. 396
A General Framework for Probabilistic Characterizing Formulae
pp. 412
Loop Invariant Symbolic Execution for Parallel Programs
pp. 428
Synthesizing Efficient Controllers
pp. 445
Ideal Abstractions for Well-Structured Transition Systems
Similar content
1,317
Deriving a lazy abstract machine
Authors:
PETER SESTOFT
From Lazy to Prolific: Tackling Missing Labels in Open Vocabulary Extreme Classification by Positive-Unlabeled Sequence Learning
Authors:
Haoran Ranran Zhang
,
Bensu Uçar
,
Soumik Dey
…
Computationally-Efficient Roadmap-based Inspection Planning via Incremental Lazy Search
Authors:
Mengyu Fu
,
Oren Salzman
,
Ron Alterovitz
See all similar
Cited by
9
Encodings of Bounded Synthesis
Authors:
Peter Faymonville
,
Bernd Finkbeiner
,
Markus N. Rabe
…
PARTY Parameterized Synthesis of Token Rings
Authors:
Ayrat Khalimov
,
Swen Jacobs
,
Roderick Bloem
Parameterized Synthesis
Authors:
Swen Jacobs
,
Roderick Bloem
See all cited by