Information-flow control mechanisms are difficult to design and labor intensive to prove correct. To reduce the time wasted on proof attempts doomed to fail due to broken definitions, we advocate modern random testing techniques for finding counterexamples during the design process. We show how to use QuickCheck, a property-based random-testing tool, to guide the design of a simple information-flow abstract machine. We find that both sophisticated strategies for generating well-distributed random programs and readily falsifiable formulations of noninterference properties are critically important. We propose several approaches and evaluate their effectiveness on a collection of injected bugs of varying subtlety. We also present an effective ...
Type systems for secure information flow aim to prevent a program from leaking information from H (h...
Property-based random testing can facilitate formal verification, exposing errors early on in the pr...
In the case of coverage biased random testing of programs, random generation is used to first draw a...
Information-flow control mechanisms are difficult to design and labor intensive to prove correct. To...
Information-flow control mechanisms are difficult both to design and to prove correct. To reduce the...
In today’s interconnected digital world, protecting sensitive data is critical. However, the design ...
Random testing is increasingly popular and successful, but tends to spend most time rediscovering th...
Information flow control (IFC) is a category of techniques for enforcing information flow properties...
International audienceNoninterference, which is an information flow property, is typically used as a...
We study the randomness complexity of interactive proofs and zero-knowledge proofs. In particular, w...
In secure information flow analysis, the classic Denning restrictions allow a program’s termination ...
International audienceIntegrating property-based testing with a proof assistant creates an interesti...
In secure information flow analysis, the classic Denning restrictions allow a program’s termination ...
Tracking information flow in dynamic languages remains an open challenge. It might seem natural to a...
Property-based random testing can facilitate formal verification, exposing errors early on in the pr...
Type systems for secure information flow aim to prevent a program from leaking information from H (h...
Property-based random testing can facilitate formal verification, exposing errors early on in the pr...
In the case of coverage biased random testing of programs, random generation is used to first draw a...
Information-flow control mechanisms are difficult to design and labor intensive to prove correct. To...
Information-flow control mechanisms are difficult both to design and to prove correct. To reduce the...
In today’s interconnected digital world, protecting sensitive data is critical. However, the design ...
Random testing is increasingly popular and successful, but tends to spend most time rediscovering th...
Information flow control (IFC) is a category of techniques for enforcing information flow properties...
International audienceNoninterference, which is an information flow property, is typically used as a...
We study the randomness complexity of interactive proofs and zero-knowledge proofs. In particular, w...
In secure information flow analysis, the classic Denning restrictions allow a program’s termination ...
International audienceIntegrating property-based testing with a proof assistant creates an interesti...
In secure information flow analysis, the classic Denning restrictions allow a program’s termination ...
Tracking information flow in dynamic languages remains an open challenge. It might seem natural to a...
Property-based random testing can facilitate formal verification, exposing errors early on in the pr...
Type systems for secure information flow aim to prevent a program from leaking information from H (h...
Property-based random testing can facilitate formal verification, exposing errors early on in the pr...
In the case of coverage biased random testing of programs, random generation is used to first draw a...