Implementation of RA-learning without parameters.#191
Implementation of RA-learning without parameters.#191
Conversation
|
I think I'm running into a possible permissions issue. I get the following when trying to run the scandic configuration. |
|
I suggest you update file Now, regarding the issue you experiencing when running the above command, I also get the same error ( |
|
Update on the above. The issue you are experiencing is most likely due to not having set up the Scandium 2.6.2 SUT. ./setup_sut.sh scandium-2.6.2After that, you can issue the command you want to test and you will most likely experience another error from Java, not a In any case, the errors have nothing to do with (permissions on) the machine you are using. |
ParameterizedSymbol to TlsInput
TlsInputTransformer
build a timeout symbol
…pletion using RA test runner.
properties for output directories
|
@kostis @pfg666 Is this error related to some other xml file, or are we doing some preprocessing of the xml before we are parsing the alphabet? I've attached the log I get when running, but I might need to adjust logging levels because it I could not see anything obviously wrong happening. |
|
@00oskpet I checked (belatedly). The short story is that I think you should omit the tinydtls configurations you mention from the experiments. The problem you mention also affects DTLS-Fuzzer master, when learning plain Mealy machines. This will require investigation to see whether it is the configuration file that's the problem, or something else. Support for raw keys in the past was a bit sketchy in TLS-Attacker. Hence, my suggestion is to ignore this problem. Once you feel the tool is ready for review, notify me in private (e.g., on Slack) and I will check (I am absolutely flooded with GitHub notifications, so might miss messages here). Well done on the extensive work! |
pfg666
left a comment
There was a problem hiding this comment.
I checked, it all looks good. The concern I have is that there are SUT-specific alphabets. I would like if, wherever possible, the alphabets are SUT-agnostic, even if it means that they will contain output symbols that some SUTs never generate. This better aligns with the theory, according to which alphabets are decoupled from SUTs. I hence suggest that alphabets in the ra directory are merged, such that you have an alphabet for each configuration (e.g., dhe_cert.xml), and only have SUT-specific alphabets (named, e.g., piondtls_ecdhe_cert.xml) for cases where this is needed (similar to the Mealy alphabets). You will also need to update the argument files accordingly!
I understand why you made SUT-specific alphabets for RA learning: RALib algorithms currently require that you supply the entire output alphabet before learning. So it was natural to just have for each SUT alphabets containing all the output symbols the SUT generates. However, to be in line with the theory, I think it is better to have SUT-agnostic alphabets wherever possible.
Let me know what you think! Perhaps @kostis can also chip in.
Other than that, as RA support in PSF is developed (e.g., completing RATestRunner), the code will need to be updated, but for now it should be good!
Best, Paul.
Initial draft without parameters, currently cannot learn a complete handshake.