2018
DOI: 10.1007/978-3-030-00801-7_5
|View full text |Cite
|
Sign up to set email alerts
|

An Operational Semantics for Constraint-Logic Imperative Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
15
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(15 citation statements)
references
References 14 publications
0
15
0
Order By: Relevance
“…As a result, this allows search to focus on branches relevant to the respective access, thus effectively reducing the state space. Note that these considerations are similar to those regarding the Label reduction rule from [3] that is used for substituting primitive type logic variables with their potential values. Similar to the present case, Label is suggested to be used only as a last resort if no other rule can be applied as its application results in one branch per potential value, which usually are a lot.…”
Section: Reference Type Logic Variables (Or Free Objects)mentioning
confidence: 95%
See 4 more Smart Citations
“…As a result, this allows search to focus on branches relevant to the respective access, thus effectively reducing the state space. Note that these considerations are similar to those regarding the Label reduction rule from [3] that is used for substituting primitive type logic variables with their potential values. Similar to the present case, Label is suggested to be used only as a last resort if no other rule can be applied as its application results in one branch per potential value, which usually are a lot.…”
Section: Reference Type Logic Variables (Or Free Objects)mentioning
confidence: 95%
“…However, if an expression contains unbound variables, they cannot evaluate to a specific value. Therefore, the execution environment treats those variables symbolically and creates a symbolic expression [3]. For instance, after executing Listing 2, y holds the constant value 5 (as expected in Java), whereas z holds the symbolic expression x + 5. int x free; int i = 2, j = 3; int y = i + j; // y == 5. int z = x + y; // z == x + 5.…”
Section: Constraint-logic Object-oriented Programming With Mulimentioning
confidence: 99%
See 3 more Smart Citations