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
33
views
6
references
Top references
cited by
0
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,441
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Programming Languages and Systems: 18th Asian Symposium, APLAS 2020, Fukuoka, Japan, November 30 – December 2, 2020, Proceedings
A New Refinement Type System for Automated \(\nu \text {HFL}_\mathbb {Z}\) Validity Checking
other
Author(s):
Hiroyuki Katsura
,
Naoki Iwayama
,
Naoki Kobayashi
,
Takeshi Tsukada
Publication date
(Online):
November 24 2020
Publisher:
Springer International Publishing
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
Studia z Filologii Polskiej i Słowiańskiej
Most cited references
6
Record
: found
Abstract
: not found
Book Chapter
: not found
Horn Clause Solvers for Program Verification
Nikolaj Bjørner
,
Arie Gurfinkel
,
Ken McMillan
…
(2015)
0
comments
Cited
31
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs
Takuya Kuwahara
,
Ryosuke Sato
,
Hiroshi Unno
…
(2015)
0
comments
Cited
5
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
A Higher Order Modal Fixed Point Logic
Mahesh Viswanathan
,
Ramesh Viswanathan
(2004)
0
comments
Cited
5
times
– based on
0
reviews
Bookmark
All references
Author and book information
Contributors
Hiroyuki Katsura:
(View ORCID Profile)
Naoki Kobayashi:
(View ORCID Profile)
Takeshi Tsukada:
(View ORCID Profile)
Book Chapter
Publication date (Print):
2020
Publication date (Online):
November 24 2020
Pages
: 86-104
DOI:
10.1007/978-3-030-64437-6_5
SO-VID:
5b636c52-1b2d-4f57-94b9-9acd416ee8b6
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
A Set-Based Context Model for Program Analysis
pp. 25
Declarative Stream Runtime Verification (hLola)
pp. 44
Formal Verification of Atomicity Requirements for Smart Contracts
pp. 67
Neural Networks, Secure by Construction
pp. 86
A New Refinement Type System for Automated $$\nu \text {HFL}_\mathbb {Z}$$ Validity Checking
pp. 105
Behavioural Types for Memory and Method Safety in a Core Object-Oriented Language
pp. 125
Syntactically Restricting Bounded Polymorphism for Decidable Subtyping
pp. 147
An Abstract Machine for Strong Call by Value
pp. 167
Certified Semantics for Relational Programming
pp. 186
Algebraic and Coalgebraic Perspectives on Interaction Laws
pp. 209
Stack-Driven Program Generation of WebAssembly
pp. 231
Banyan: Coordination-Free Distributed Transactions over Mergeable Types
pp. 251
Automatically Generating Descriptive Texts in Logging Statements: How Far Are We?
pp. 273
Parameterized Synthesis with Safety Properties
pp. 293
Relational Synthesis for Pattern Matching
pp. 311
REFINITY to Model and Prove Program Transformation Rules
pp. 323
A Counterexample-Guided Debugger for Non-recursive Datalog
pp. 343
A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving
pp. 364
$$\mathsf{P}^{3}$$: A Profiler Suite for Parallel Applications on the Java Virtual Machine
Similar content
2,441
The Slab Theorem for Minimal Surfaces in \(\mathbb{E}(-1,\tau)\)
Authors:
Vanderson Lima
The slice hyperholomorphic Bergman space on \(\mathbb{B}_R\): Integral representation and asymptotic behavior
Authors:
A. Kachkouri
,
A. Ghanmi
Discovery and Identification of W' Bosons in e gamma to nu q +X
Authors:
Arnd Leike
,
Pat Kalyniak
,
Basim Kamal
…
See all similar