Sciweavers

6 search results - page 1 / 2
» Circular Coinduction with Special Contexts
Sort
View
91
Voted
ICFEM
2009
Springer
15 years 4 months ago
Circular Coinduction with Special Contexts
Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected to provide a “good” relation extending one’s goal with additional lemmas, ...
Dorel Lucanu, Grigore Rosu
ICFEM
2010
Springer
14 years 8 months ago
Automating Coinduction with Case Analysis
Abstract. Coinduction is a major technique employed to prove behavioral properties of systems, such as behavioral equivalence. Its automation is highly desirable, despite the fact ...
Eugen-Ioan Goriac, Dorel Lucanu, Grigore Rosu
EUROCRYPT
2010
Springer
15 years 2 months ago
Computational Soundness, Co-induction, and Encryption Cycles
We analyze the relation between induction, co-induction and the presence of encryption cycles in the context of computationally sound symbolic equivalence of cryptographic express...
Daniele Micciancio
PADO
2001
Springer
15 years 2 months ago
Implementing Circularity Using Partial Evaluation
Complex data dependencies can often be expressed concisely by defining a variable in terms of part of its own value. Such a circular reference can be naturally expressed in a lazy...
Julia L. Lawall
65
Voted
ENTCS
2006
144views more  ENTCS 2006»
14 years 9 months ago
Infinitary Howe's Method
Howe's method is a well-known technique for proving that various kinds of applicative bisimilarity (or similarity) on a functional language are congruences (or precongruences...
Paul Blain Levy