-
V. Abily and M. Ducassé.
Benchmarking a distributed intrusion detection system based on ASAX: Preliminary results.
In H. Debar, editor,
RAID 2000 (Recent Advances on Intrusion Detection),
2000.
Note: Refereed extended abtract.
[WWW]
@inproceedings{abily2000,
author = {V. Abily and M. Ducassé},
title = {Benchmarking a distributed intrusion detection system based on {ASAX: P}reliminary results},
booktitle = {RAID 2000 (Recent Advances on Intrusion Detection)},
editor = {H. Debar},
note = {Refereed extended abtract},
year = {2000},
url = {http://www.raid-symposium.org/raid2000/program.html}
}
-
M. Ducassé and L. Rozé.
Proof obligations of the B formal method: Local proofs ensure global consistency.
In A. Bossi, editor,
LOgic-based Program Synthesis and TRansformation,
pages 11-30,
2000.
Springer-Verlag, Lecture Notes in Computer Science, 1817.
@InProceedings{ducasse2000b,
Author={M. Ducassé and L. Rozé},
Title={Proof obligations of the {B} formal method: {Local} proofs ensure global consistency},
Pages={11-30},
BookTitle={LOgic-based Program Synthesis and TRansformation},
Year={2000},
Editor={A. Bossi},
Publisher={Springer-Verlag, Lecture Notes in Computer Science, 1817}
}
-
Sébastien Ferré and Olivier Ridoux.
A File System Based on Concept Analysis.
In Yehoshua Sagiv, editor,
International Conference on Rules and Objects in Databases,
number 1861 of Lecture Notes in Computer Science,
pages 1033-1047,
July 2000.
Springer.
Keyword(s): concept analysis,
logic,
information system,
file system.
Abstract: |
We present the design of a file system whose organization is based on Concept Analysis ``à la Wille-Ganter''. The aim is to combine querying and navigation facilities in one formalism. The file system is supposed to offer a standard interface but the interpretation of common notions like directories is new. The contents of a file system is interpreted as a Formal Context, directories as Formal Concepts, and the sub-directory relation as Formal Concepts inclusion. We present an organization that allows for an efficient implementation of such a Conceptual File System. |
@InProceedings{FerRid2000a,
author = "Sébastien Ferré and Olivier Ridoux",
title = "A File System Based on Concept Analysis",
booktitle = "International Conference on Rules and Objects in Databases",
pages = "1033--1047",
year = "2000",
editor = "Yehoshua Sagiv",
number = "1861",
series = "Lecture Notes in Computer Science",
month = jul,
publisher = "Springer",
keywords = {concept analysis, logic, information system, file system},
langue = "anglais",
abstract = {We present the design of a file system whose organization is based on Concept Analysis ``à la Wille-Ganter''. The aim is to combine querying and navigation facilities in one formalism. The file system is supposed to offer a standard interface but the interpretation of common notions like directories is new. The contents of a file system is interpreted as a Formal Context, directories as Formal Concepts, and the sub-directory relation as Formal Concepts inclusion. We present an organization that allows for an efficient implementation of such a Conceptual File System.},
}
-
Sébastien Ferré and Olivier Ridoux.
A Logical Generalization of Formal Concept Analysis.
In Guy Mineau and Bernhard Ganter, editors,
International Conference on Conceptual Structures,
number 1867 of Lecture Notes in Computer Science,
pages 371-384,
August 2000.
Springer.
Keyword(s): concept analysis,
logic,
context,
information system.
Abstract: |
We propose a generalization of Formal Concept Analysis (FCA) in which sets of attributes are replaced by expressions of an almost arbitrary logic. We prove that all FCA can be reconstructed on this basis. We show that from any logic that is used in place of sets of attributes can be derived a contextualized logic that takes into account the formal context and that is isomorphic to the concept lattice. We then justify the generalization of FCA compared with existing extensions and in the perspective of its application to information systems. |
@InProceedings{FerRid2000b,
author = "Sébastien Ferré and Olivier Ridoux",
title = "A Logical Generalization of Formal Concept Analysis",
booktitle = "International Conference on Conceptual Structures",
pages = "371--384",
year = "2000",
editor = "Guy Mineau and Bernhard Ganter",
number = "1867",
series = "Lecture Notes in Computer Science",
month = aug,
publisher = "Springer",
keywords = {concept analysis, logic, context, information system},
langue = "anglais",
abstract = "We propose a generalization of Formal Concept Analysis (FCA) in which sets of attributes are replaced by expressions of an almost arbitrary logic. We prove that all FCA can be reconstructed on this basis. We show that from any logic that is used in place of sets of attributes can be derived a contextualized logic that takes into account the formal context and that is isomorphic to the concept lattice. We then justify the generalization of FCA compared with existing extensions and in the perspective of its application to information systems.",
}
-
E. Jahier,
M. Ducassé,
and O. Ridoux.
Specifying Prolog Trace Models with a Continuation Semantics.
In K.-K. Lau, editor,
Proc. of LOgic-based Program Synthesis and TRansformation,
London,
July 2000.
Note: Technical Report Report Series, Department of Computer Science, University of Manchester, ISSN 1361-6161. Report number UMCS-00-6-1.[WWW]
@InProceedings{jahier00,
Author = {E. Jahier and M. Ducassé and O. Ridoux},
Title = {Specifying {Prolog} Trace Models with a Continuation Semantics},
Editor = {K.-K. Lau},
Booktitle = {Proc. of {LO}gic-based Program Synthesis and TRansformation},
Year = {2000},
Address = {London},
Month = {July},
Note = {Technical Report Report Series, Department of Computer Science, University of Manchester, ISSN 1361-6161. Report number UMCS-00-6-1.},
url={http://www.cs.man.ac.uk/cstechrep/titles00.html}
}
-
E. Jahier,
M. Ducassé,
and O. Ridoux.
Spécification de modèles de traces de programmes Prolog à l'aide d'une sémantique par continuation.
In Touraivane, editor,
Actes des Journées francophones de Programmation Logique et par Contraintes,
Marseille,
2000.
Hermès.
@InProceedings{jahier00b,
author = {E. Jahier and M. Ducassé and O. Ridoux},
title = {Spécification de modèles de traces de programmes {Prolog} à l'aide d'une sémantique par continuation},
booktitle = {Actes des Journées francophones de Programmation Logique et par Contraintes},
editor = {Touraivane},
year = 2000,
publisher = {Hermès},
address = {Marseille}
}
-
D. Le Métayer,
V.-A. Nicolas,
and Olivier Ridoux.
Verification by testing for recursive program schemes.
In A. Bossi, editor,
LOgic-based Program Synthesis and TRansformation,
2000.
Springer-Verlag, Lecture Notes in Computer Science, 1817.
@InProceedings{LOPSTR99,
Author={D. Le~Métayer and V.-A. Nicolas and Olivier Ridoux},
Title={Verification by testing for recursive program schemes},
Page={255-272},
BookTitle={LOgic-based Program Synthesis and TRansformation},
Year={2000},
Editor={A. Bossi},
Publisher={Springer-Verlag, Lecture Notes in Computer Science, 1817}
}
-
J.-P. Pouzol and M. Ducassé.
Handling Generic Intrusion Signatures is not Trivial.
In H. Debar, editor,
RAID 2000 (Recent Advances on Intrusion Detection),
2000.
Note: Refereed extended abtract.
[WWW]
@inproceedings{pouzol2000,
author = {J.-P. Pouzol and M. Ducassé},
title = {Handling Generic Intrusion Signatures is not Trivial},
booktitle = {RAID 2000 (Recent Advances on Intrusion Detection)},
editor = {H. Debar},
note = {Refereed extended abtract},
year = {2000},
url = {http://www.raid-symposium.org/raid2000/program.html}
}