Sciweavers

194 search results - page 19 / 39
» Algebraic Laws for Feature Models
Sort
View
NDJFL
1998
105views more  NDJFL 1998»
14 years 9 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau
70
Voted
ITCC
2005
IEEE
15 years 3 months ago
Formalisation and implementation of Access control models
Access control software must be based on a security policy model. Flaws in them may come from a lack of precision or some incoherences in the policy model or from inconsistencies ...
Mathieu Jaume, Charles Morisset
88
Voted
CORR
2008
Springer
77views Education» more  CORR 2008»
14 years 9 months ago
Programming an interpreter using molecular dynamics
PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation deve...
Jan A. Bergstra, C. A. Middelburg
LICS
2002
IEEE
15 years 2 months ago
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
We observe that equivalence is not a robust concept in the presence of numerical information - such as probabilities - in the model. We develop a metric analogue of weak bisimulat...
Josee Desharnais, Radha Jagadeesan, Vineet Gupta, ...
IANDC
2008
150views more  IANDC 2008»
14 years 9 months ago
Hierarchical combination of intruder theories
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
Yannick Chevalier, Michaël Rusinowitch