3713 search results - page 125 / 743 » Constructing a Calculus of Programs |
129
Voted
ESOP
2006
Springer
15 years 7 months ago
2006
Springer
We present a sound and complete method for reasoning about contextual equivalence in the untyped, imperative object calculus of Abadi and Cardelli [1]. Our method is based on bisim...
149
click to vote
TABLEAUX
1995
Springer
15 years 6 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
137
click to vote
ENTCS
2007
15 years 3 months ago
2007
Action Labelled transition systems (LTS) have proved to be a fundamental model for describing and proving properties of concurrent systems. In this paper,Multiple Labelled Transit...
132
click to vote
IFIP
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We introduce a calculus with mobile names, distributed principals and primitives for secure remote communication, without any reference to explicit cryptography. The calc...
129
click to vote
RTA
2004
Springer
15 years 8 months ago
2004
Springer
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...