1187 search results - page 60 / 238 » Computation in Extended Argumentation Frameworks |
ICIAP
2003
ACM
16 years 1 months ago
2003
ACM
The eight-point algorithm of Hartley occupies an important place in computer vision, notably as a means of providing an initial value of the fundamental matrix for use in iterativ...
SP
2009
IEEE
15 years 8 months ago
2009
IEEE
We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the ...
100
Voted
LICS
2009
IEEE
15 years 8 months ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
112
click to vote
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
126
click to vote
ICFP
2005
ACM
16 years 1 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...