googletesting: Quantum Quality

Quantum Quality

Wednesday, April 1, 2015

UPDATE: Hey, this was an April fool's joke but in fact we wished we couldhave realized this idea and we are looking forward to the day this hasbeen worked out and becomes a reality.
by Kevin Graney Quantum AI LabSchrodinger's cat

Figure 1 Some qubits inside a Google quantum device. nVon Neuman architecturenO(n)

Figure 2 The application state graph for a demonstrative 3-bit application. If the start state is 001 then 000, 110, 111, and 011 are all unreachable states. States 010 and 100 both result in deadlock. Once we have the state transition graph for the application under test, testing it becomes almost trivial. Given the initial startup state of the application, i.e. the executable bits of the application stored on disk, we can find from the application's state transition graph all reachable states. Assertions that ensure proper behavior are then written against the reachable subset of the transition graph. This paradigm of test writing allows both Google's security engineers and software engineers to work more productively. A security engineer can write a test, for example, that asserts "no executable memory regions become mutated in any reachable state". This one test effectively eliminates the potential for security flaws that result from memory safety violations. A test engineer can write higher level assertions using graph traversal methods that ensure data integrity is maintained across a subset of application state transitions. Tests of this nature can detect data corruption bugs.

1 comment :

KeithApril 1, 2015 at 1:54 PM
WOW!! You should use this tech to model every possible April Fools prank and find the funniest one! :)
ReplyDelete
Replies

Add comment

Testing Blog

Quantum Quality

1 comment :

Labels

Archive

Feed

Company-wide

Products

Developers