1027 search results - page 151 / 206 » Representing and Reasoning with Operational Semantics |
201
click to vote
POPL
2007
ACM
16 years 28 days ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
118
Voted
LICS
1999
IEEE
15 years 4 months ago
1999
IEEE
Security protocols use cryptography to set up private communication channels on an insecure network. Many protocols contain flaws, and because security goals are seldom specified ...
113
Voted
LICS
1994
IEEE
15 years 4 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
89
Voted
LICS
1992
IEEE
15 years 4 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...
78
Voted
ICLP
1990
Springer
15 years 4 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...