Concept
Grammaire formelle
Publications associées (67)
Automating Grammar Comparison
Viktor Kuncak, Mikaël Mayer, Ravichandhran Kandhadai Madhavan
We consider from a practical perspective the problem of checking equivalence of context-free grammars. We present techniques for proving equivalence, as well as techniques for finding counter-examples that establish non-equivalence. Among the key building ...
Assoc Computing Machinery2015Towards Automating Grammar Equivalence Checking
Viktor Kuncak, Mikaël Mayer, Ravichandhran Kandhadai Madhavan
We consider from practical perspective the (generally undecidable) problem of checking equivalence of context-free grammars. We present both techniques for proving equivalence, as well as techniques for finding counter-examples that establish non-equivalen ...
2015Pre-simulation symbolic analysis of synchronization issues between discrete event and timed data flow models of computation
The SystemC AMS extensions support heterogeneous modeling and make use of several Models of Computation (MoCs) that operate on different time scales in the Discrete Event (DE), Discrete Time (DT), and Continuous Time (CT) domains. The simulation of such he ...
IEEE Conference Publications2015Optimal Proximity Proofs Revisited
Serge Vaudenay, Handan Kilinç Alper
Distance bounding protocols become important since wireless technologies become more and more common. Therefore, the security of the distance bounding protocol should be carefully analyzed. However, most of the protocols are not secure or their security is ...
Springer Verlag2015