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
21
views
26
references
Top references
cited by
7
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,459
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Graph Transformations
Weakest Preconditions for High-Level Programs
other
Author(s):
Annegret Habel
,
Karl-Heinz Pennemann
,
Arend Rensink
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
Dougmar Publishing Group
Most cited references
26
Record
: found
Abstract
: not found
Book Chapter
: not found
PVS: A prototype verification system
S. Owre
,
J. M. Rushby
,
N Shankar
(1992)
0
comments
Cited
87
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
ALGEBRAIC APPROACHES TO GRAPH TRANSFORMATION – PART I: BASIC CONCEPTS AND DOUBLE PUSHOUT APPROACH
A Corradini
,
U. Montanari
,
F. Rossi
…
(1997)
0
comments
Cited
41
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Introduction to the algebraic theory of graph grammars (a survey)
Hartmut Ehrig
(1979)
0
comments
Cited
37
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2006
Pages
: 445-460
DOI:
10.1007/11841883_31
SO-VID:
d85f182c-188e-4cbf-98d5-bfce9480fba9
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 30
Sesqui-Pushout Rewriting
pp. 77
Adaptive Star Grammars
pp. 184
Toposes Are Adhesive
pp. 383
GrGen: A Fast SPO-Based Graph Rewriting Tool
pp. 445
Weakest Preconditions for High-Level Programs
Similar content
4,459
You are the weakest link — goodbye: serving the information‐hungry corporate end‐user
Authors:
Paul Harwood
The Optimal Choice of Hypothesis Is the Weakest, Not the Shortest
Authors:
Michael Timothy Bennett
Finding the weakest link: exploring integrin-mediated mechanical molecular pathways.
Authors:
Pere Roca-Cusachs
,
Thomas Iskratsch
,
Michael Sheetz
See all similar
Cited by
7
Correctness of high-level transformation systems relative to nested conditions
Authors:
ANNEGRET HABEL
,
KARL-HEINZ PENNEMANN
Weakest Preconditions for High-Level Programs
Authors:
Annegret Habel
,
Karl-Heinz Pennemann
,
Arend Rensink
Resolution-Like Theorem Proving for High-Level Conditions
Authors:
Karl-Heinz Pennemann
See all cited by