545 search results - page 21 / 109 » Recursive logic frames |
189
click to vote
CADE
2011
Springer
13 years 11 months ago
2011
Springer
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
97
Voted
FOSSACS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
92
Voted
MLQ
2002
14 years 11 months ago
2002
A modal logic is called invariant if for all automorphisms of NExt K, () = . An invariant logic is therefore uniquely determined by its surrounding in the lattice. It will be est...
BIRTHDAY
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. With the recent trend of analysing the process of computation through the linear logic looking glass, it is well understood that the ability to copy and erase data is ess...
110
click to vote
PLPV
2009
ACM
15 years 8 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...