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
27
views
18
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
2,483
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automated Reasoning
Inferring Network Invariants Automatically
other
Author(s):
Olga Grinchtein
,
Martin Leucker
,
Nir Piterman
Publication date
(Print):
2006
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
Exponential Random Graph Models
Most cited references
18
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Reasoning about rings
Kedar Namjoshi
,
E. Allen Emerson
(1995)
0
comments
Cited
38
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Reducing Model Checking of the Many to the Few
E. Allen Emerson
,
Vineet Kahlon
(2000)
0
comments
Cited
27
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
A platform for combining deductive with algorithmic verification
Amir Pnueli
,
Elad Shahar
(1996)
0
comments
Cited
22
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2006
Pages
: 483-497
DOI:
10.1007/11814771_40
SO-VID:
5d9197d6-0a0f-4fec-804f-ebb838b0a945
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 21
Flyspeck I: Tame Graphs
pp. 572
CASC-J3 The 3rd IJCAR ATP System Competition
pp. 125
Blocking and Other Enhancements for Bottom-Up Model Generation Methods
pp. 156
Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation
pp. 177
Towards Self-verification of HOL Light
pp. 235
Interpolation in Local Theory Extensions
pp. 281
AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework
pp. 287
CEL — A Polynomial-Time Reasoner for Life Science Ontologies
pp. 298
Importing HOL into Isabelle/HOL
pp. 483
Inferring Network Invariants Automatically
pp. 541
Presburger Modal Logic Is PSPACE-Complete
pp. 557
Tree Automata with Equality Constraints Modulo Equational Theories
pp. 574
Matrix Interpretations for Proving Termination of Term Rewriting
pp. 589
Partial Recursive Functions in Higher-Order Logic
Similar content
2,483
HIV-Infected Children Have Lower Frequencies of CD8+ Mucosal-Associated Invariant T (MAIT) Cells that Correlate with Innate, Th17 and Th22 Cell Subsets
Authors:
Alka Khaitan
,
Max Kilberg
,
Adam Kravietz
…
Endosomal aspartic proteinases are required for invariant-chain processing.
Authors:
Nathan Blum
,
Susan S. Taylor
,
M Maric
Goodness of Ergodic Adiabatic Invariants
Authors:
Edward Ott
See all similar
Cited by
9
Exact DFA Identification Using SAT Solvers
Authors:
Marijn Heule
,
Sicco Verwer
Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems
Authors:
Edmund Clarke
,
Murali Talupur
,
Helmut Veith
Learning Minimal Separating DFA’s for Compositional Verification
Authors:
Yu-Fang Chen
,
Azadeh Farzan
,
Edmund M. Clarke
…
See all cited by