Sciweavers

4340 search results - page 617 / 868
» Formal Methods and Cryptography
Sort
View
POPL
1998
ACM
15 years 10 months ago
A Functional Representation of Data Structures with a Hole
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
Yasuhiko Minamide
SIGSOFT
1998
ACM
15 years 10 months ago
Reengineering Class Hierarchies Using Concept Analysis
The design of a class hierarchy may be imperfect. For example, a class C may contain a member m not accessed in any C-instance, an indication that m could be eliminated, or moved ...
Gregor Snelting, Frank Tip
SACRYPT
1998
Springer
15 years 10 months ago
Computational Alternatives to Random Number Generators
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
David M'Raïhi, David Naccache, David Pointche...
SP
1997
IEEE
112views Security Privacy» more  SP 1997»
15 years 10 months ago
Analyzing Consistency of Security Policies
This paper discusses the development of a methodology for reasoning about properties of security policies. We view a security policy as a special case of regulation which specifi...
Laurence Cholvy, Frédéric Cuppens
ARTS
1997
Springer
15 years 10 months ago
PLC-Automata: A New Class of Implementable Real-Time Automata
We introduce PLC-Automata as a new class of automata which are tailored to deal with real-time properties of Programmable Logic Controllers (PLCs). These devices are often used in...
Henning Dierks