3658 search results - page 141 / 732 » The logic of proofs, semantically |
88
Voted
TPHOL
1996
IEEE
15 years 4 months ago
1996
IEEE
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...
98
Voted
ASIAN
2006
Springer
15 years 4 months ago
2006
Springer
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
111
Voted
ESOP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. A verified compiler is an integral part of every security infrastructure. Previous work has come up with formal semantics for sequential and concurrent variants of Java a...
99
Voted
CTCS
1997
Springer
15 years 4 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
109
Voted
LICS
2005
IEEE
15 years 6 months ago
2005
IEEE
The universal Horn theory of relational Kleene algebra with tests (RKAT) is of practical interest, particularly for program semantics. We develop an (infinitary) proof system, ba...