1005 search results - page 30 / 201 » Operational Semantics and Program Equivalence |
CL
2000
Springer
13 years 7 months ago
2000
Springer
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...
PPDP
2004
Springer
14 years 27 days ago
2004
Springer
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...
LICS
1992
IEEE
13 years 11 months ago
1992
IEEE
The aim of this paper is to find the finest `observable' and `implementable' equivalence on concurrent processes. This is a part of a larger programme to develop a theor...
LPNMR
2001
Springer
14 years 1 hour ago
2001
Springer
In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for suc...
CCS
2011
ACM
12 years 7 months ago
2011
ACM
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...