On finding primitive roots in finite fields

By Shparlinski I.  

Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. : 273-275

Elsevier

Access to resources Recommend Favorite

Exploiting transition locality in automatic verification of finite-state concurrent systems

By Della Penna Giuseppe   Intrigila Benedetto   Melatti Igor   Tronci Enrico   Venturini Zilli Marisa  

International Journal on Software Tools for Technology Transfer, Vol. 6, Iss. 4, 2004-08 ,pp. : 320-341

Springer Publishing Company

Access to resources Recommend Favorite

Model checking-based safety verification for railway signal safety protocol-I

By Meng Mei   Zhongwei Xu   Xi Wang   Yongbing Wan  

International Journal of Computer Applications in Technology, Vol. 46, Iss. 3, 2013-03 ,pp. : 195-202

Inderscience Publishers

Access to resources Recommend Favorite

Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order

By Trahtman A.N.  

Theoretical Computer Science, Vol. 235, Iss. 1, 2000-03 ,pp. : 183-204

Elsevier

Access to resources Recommend Favorite

Constraint-Based Verification of Parameterized Cache Coherence Protocols

By Delzanno Giorgio  

Formal Methods in System Design, Vol. 23, Iss. 3, 2003-11 ,pp. : 257-301

Springer Publishing Company

Access to resources Recommend Favorite