Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
We present an embedding of the stable failures model of CSP in the PVS theorem prover. Our work, extending a previous embedding of the traces model of CSP in [6], provides a platfo...
Encryption of data using multiple, independent encryption schemes (“multiple encryption”) has been suggested in a variety of contexts, and can be used, for example, to protect ...
FCA has been successfully applied to software engineering tasks such as source code analysis and class hierarchy re-organization. Most notably, FCA hematics behind the mechanism of...
Michel Dao, Marianne Huchard, Mohamed Rouane Hacen...
Recent evolution in computer networks clearly demonstrates a trend towards complex and dynamic networks. To fully exploit the potential of such heterogeneous and rapidly evolving ...
Nico Janssens, Lieven Desmet, Sam Michiels, Pierre...