Sciweavers

3384 search results - page 84 / 677
» More Testable Properties
Sort
View
PLDI
2012
ACM
11 years 11 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
NDJFL
1998
105views more  NDJFL 1998»
13 years 8 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
RV
2010
Springer
127views Hardware» more  RV 2010»
13 years 7 months ago
You Should Better Enforce Than Verify
This tutorial deals with runtime enforcement which is an extension of runtime verification aiming to circumvent misbehaviors of systems. After an historical overview of previous a...
Yliès Falcone
EUSFLAT
2007
111views Fuzzy Logic» more  EUSFLAT 2007»
13 years 10 months ago
Fuzziness - Representation of Dynamic Changes?
The paper brings a discussion about the source of the inaccuracy in observations of objects and demonstrates that the essential reason of the lack of precision is changeability, a...
Witold Kosinski, Piotr Prokopowicz
ACL
2006
13 years 10 months ago
Factorizing Complex Models: A Case Study in Mention Detection
As natural language understanding research advances towards deeper knowledge modeling, the tasks become more and more complex: we are interested in more nuanced word characteristi...
Radu Florian, Hongyan Jing, Nanda Kambhatla, Imed ...