Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(1)
Higher Order
Related Publications
(6)
An observationally complete program logic for imperative higherorder functions
From process logic to program logic
Verifying properties of wellfounded linked lists
A compositional logic for polymorphic higherorder functions
Introduction to mathematical logic
Subscribe
Academic
Publications
A logical analysis of aliasing for higherorder imperative functions
A logical analysis of aliasing for higherorder imperative functions,Martin Berger,Kohei Honda,Nobuko Yoshida
Edit
A logical analysis of aliasing for higherorder imperative functions
(
Citations: 9
)
BibTex

RIS

RefWorks
Download
Martin Berger
,
Kohei Honda
,
Nobuko Yoshida
Conference:
International Conference on Functional Programming  ICFP
, 2005
Cumulative
Annual
Citation Context
(5)
...Jumps are complementary to the evaluation formulae x� ˜ e� A, studied in [
5
, 16, 18, 36], which means a jump to x carrying values ˜ e leads to a program state where A holds...
...The present work adds a new member to a family of logics for MLlike languages [
5
, 16, 18, 36], and integrates in a strong sense: e.g...
Martin Berger
.
Program Logics for Sequential HigherOrder Control
...Our aim is to identify basic logical primitives needed to capture precisely the semantics of local state, on the basis of a stratification of logics for sequential higherorder functions in our preceding works [
2
,10,12,13]...
...It extends the logic [
2
] with two new primitives...
...!e denotes the dereference of a reference e. Formulae include standard logical connectives and firstorder quantifiers [17], and following [
2
,12], quantification over type variables...
...is universal content quantification, introduced in [
2
] for treating aliasing...
...The located assertion introduced in [
2
] is used for this purpose: {C}e•e0 =x{C0}@˜e where each ei is of a reference type and does not contain a...
...The full compositional proof rules are given in Appendix A. Despite our semantic enrichment, all compositional proof rules in [
2
] syntactically stay as they are, except for adding the following rule for reference generation, with fresh i,X:...
...However from the general invariance rule [Inv] from [
2
] below (on the left), which uses the located form of judgement {C} M :u {C0}@˜e (understood as located evaluation formulae), we can derive an invariance rule for #, [Inv#]...
...For the sake of space, detailed comparisons with existing program logics and reasoning methods, in particular with Clarke’s impossibility result, CairesCardelli’s spatial logic, recent mechanisations of reachability predicates [16], as well as other logics such as LCF, Dynamic logic, higherorder logic, specification logic, Larch/ML, and Extended ML are left to the long version [1] and our past papers [
2
,10,12,13]...
...The logic studied in the present work aims to capture the behaviour of sequential higherorder programs with local state in the framework of compositional program logics ` a la Hoare, stratified on the basis of simpler program logics [
2
,10,12,13]...
Nobuko Yoshida
,
et al.
Logical Reasoning for HigherOrder Functions with Local State
...Details are found in our coming report [
8
]...
Kohei Honda
,
et al.
An observationally complete program logic for imperative higherorder ...
...Current research on closures [14,15,
3
,16,29,24,19] in imperative programming languages is using higherorder logic...
...The most comprehensive framework for dealing with imperative higherorder language features is that of Yoshida, Honda and Berger [14,15,
3
,16,29], a total correctness Hoarelogic based framework...
Ioannis T. Kassios
,
et al.
Specification and Verification of Closures
...Such constructs include various atomic operations, structured message passing, objects and higherorder functions (for which we can use the embedding of the logics studied in [
10
,32,55]), unifying their treatment on a common mathematical foundation...
Kohei Honda
,
et al.
A Unified Theory of Program Logics: AnApproachbasedonthepCalculus
Sort by:
Citations
(9)
Program Logics for Sequential HigherOrder Control
(
Citations: 3
)
Martin Berger
Conference:
Fundamentals of Software Engineering  FSEN
, pp. 194211, 2009
Logical Reasoning for HigherOrder Functions with Local State
(
Citations: 2
)
Nobuko Yoshida
,
Kohei Honda
,
Martin Berger
,
Helmut Seidl
Journal:
Logical Methods in Computer Science  LMCS
, vol. abs/0806.2, no. 4, 2008
Logical Reasoning for HigherOrder Functions with Local State
(
Citations: 16
)
Nobuko Yoshida
,
Kohei Honda
,
Martin Berger
Conference:
Foundations of Software Science and Computation Structure  FoSSaCS
, pp. 361377, 2007
Descriptive and Relative Completeness of Logics for HigherOrder Functions
(
Citations: 11
)
Kohei Honda
,
Martin Berger
,
Nobuko Yoshida
Conference:
International Colloquium on Automata, Languages and Programming  ICALP
, pp. 360371, 2006
An observationally complete program logic for imperative higherorder functions
(
Citations: 43
)
Kohei Honda
,
Nobuko Yoshida
,
Martin Berger
Conference:
Logic in Computer Science  LICS
, pp. 270279, 2005