416 search results - page 64 / 84 » Audiences in argumentation frameworks |
144
click to vote
SP
2009
IEEE
16 years 19 days 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 ...
146
click to vote
LICS
2009
IEEE
16 years 16 days 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...
190
click to vote
IDC
2009
Springer
16 years 14 days ago
2009
Springer
Abstract. Based on the plethora of proposals and standards for logic- and rulebased reasoning for the Semantic Web (SW), a key factor for the success of SW agents is interoperabili...
148
click to vote
CANDC
2009
ACM
16 years 13 days ago
2009
ACM
Video and transcripts of two architectural design meetings are presented in an analysis of a specific design process. The focus of the analysis presented here is the social and c...
159
click to vote
LICS
2008
IEEE
16 years 9 days 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...