Sciweavers

2041 search results - page 7 / 409
» Modelling Generic Judgements
Sort
View
ASIACRYPT
2009
Springer
15 years 4 months ago
On the Analysis of Cryptographic Assumptions in the Generic Ring Model
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
Tibor Jager, Jörg Schwenk
ISIPTA
2005
IEEE
130views Mathematics» more  ISIPTA 2005»
15 years 3 months ago
Computing Lower and Upper Expectations under Epistemic Independence
This papers investigates the computation of lower/upper expectations that must cohere with a collection of probabilistic assessments and a collection of judgements of epistemic in...
Cassio Polpo de Campos, Fabio Gagliardi Cozman
JAR
2002
77views more  JAR 2002»
14 years 9 months ago
Proof Reflection in Coq
We formalise natural deduction for first-order logic in the proof assistant Coq, using De Bruijn indices for variable binding. The main judgement we model is of the form d [:] , ...
Dimitri Hendriks
67
Voted
COLING
2002
14 years 9 months ago
Probabilistic Models of Verb-Argument Structure
We evaluate probabilistic models of verb argument structure trained on a corpus of verbs and their syntactic arguments. Models designed to represent patterns of verb alternation b...
Daniel Gildea
MODELS
2007
Springer
15 years 3 months ago
A Generic Approach for Automatic Model Composition
Analyzing and modelling a software system with separate views is a good practice to deal with complexity and maintainability. When adopting such a modular approach for modelling, i...
Franck Fleurey, Benoit Baudry, Robert B. France, S...