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
49
views
17
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
3,942
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Tools and Algorithms for the Construction and Analysis of Systems
Interprocedural Analysis of Concurrent Programs Under a Context Bound
other
Author(s):
Akash Lal
,
Tayssir Touili
,
Nicholas Kidd
,
Thomas Reps
Publication date
(Print):
2008
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
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
Core Readings in Statistical Mediation Analysis
Most cited references
17
Record
: found
Abstract
: not found
Book
: not found
Principles of Program Analysis
Flemming Nielson
,
Hanne Nielson
,
Chris Hankin
(1999)
0
comments
Cited
66
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Partial-Order Methods for the Verification of Concurrent Systems
Patrice Godefroid
(1996)
0
comments
Cited
54
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Automatic predicate abstraction of C programs
Sriram Rajamani
,
Todd Millstein
,
Rupak Majumdar
…
(2001)
0
comments
Cited
47
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Pages
: 282-298
DOI:
10.1007/978-3-540-78800-3_20
SO-VID:
bd5e7a64-fe74-4fae-a86b-ea79f5b0a600
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 2
Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
pp. 33
Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems
pp. 93
Computing Simulations over Tree Automata
pp. 18
Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
pp. 315
On Verifying Fault Tolerance of Distributed Protocols
pp. 428
Accelerating Interpolation-Based Model-Checking
pp. 63
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
pp. 78
On-the-Fly Techniques for Game-Based Software Model Checking
pp. 173
On Automated Verification of Probabilistic Programs
pp. 265
On Local Reasoning in Verification
pp. 282
Interprocedural Analysis of Concurrent Programs Under a Context Bound
pp. 299
Context-Bounded Analysis of Concurrent Queue Systems
pp. 337
Z3: An Efficient SMT Solver
pp. 346
GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic
pp. 351
RWset: Attacking Path Explosion in Constraint-Based Test Generation
pp. 367
Demand-Driven Compositional Symbolic Execution
pp. 382
Peephole Partial Order Reduction
pp. 397
Efficient Interpolant Generation in Satisfiability Modulo Theories
pp. 413
Quantified Invariant Generation Using an Interpolating Saturation Prover
pp. 443
Automatically Refining Abstract Interpretations
pp. 486
Rocket-Fast Proof Checking for SMT Solvers
Similar content
3,942
A safe approximate algorithm for interprocedural aliasing
Authors:
William Landi
,
Barbara G. Ryder
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
Authors:
Philip Brisk
,
Ajay K. Verma
,
Paolo Ienne
Interprocedural slicing using dependence graphs
Authors:
S Horwitz
,
T Reps
,
D Binkley
See all similar
Cited by
16
Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations
Authors:
Salvatore La Torre
,
Margherita Napoli
MSO Decidability of Multi-Pushdown Systems via Split-Width
Authors:
Aiswarya Cyriac
,
Paul B Gastin
,
K Kumar
Symbolic Context-Bounded Analysis of Multithreaded Java Programs
Authors:
Dejvuth Suwimonteerabuth
,
Javier Esparza
,
Stefan Schwoon
See all cited by