181 search results - page 31 / 37 » Programming Language Techniques for Cryptographic Proofs |
FASE
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
MPC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
ENTCS
2007
14 years 11 months ago
2007
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
APLAS
2008
ACM
15 years 1 months ago
2008
ACM
Abstract. We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between th...