280 search results - page 19 / 56 » Equivalence of Two Formal Semantics for Functional Logic Pro... |
137
Voted
CHARME
2003
Springer
15 years 9 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
158
Voted
ICLP
2004
Springer
15 years 9 months ago
2004
Springer
We introduce our implemented modal logic programming system MProlog. This system is written in Prolog as a module for Prolog. Codes, libraries, and most features of Prolog can be u...
161
Voted
CCS
2011
ACM
14 years 3 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-...
145
Voted
NGC
1998
Springer
15 years 3 months ago
1998
Springer
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
124
Voted
PPDP
2007
Springer
15 years 9 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...