Exploiting Cofactoring for Efficient FSM Symbolic Traversal Based on the Transition Relation - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Gianpiero Cabodi, Paolo Camurati. Exploiting Cofactoring for Efficient FSM Symbolic Traversal Based on the Transition Relation. In ICCD. pages 299-303, 1993.

The following publications are possibly variants of this publication:

Advancements in Symbolic Traversal TechniqueGianpiero Cabodi, Paolo Camurati. charme 1993: 155-166

Symbolic FSM traversals based on the transition relationGianpiero Cabodi, Paolo Camurati. tcad, 16(5):448-457, 1997. [doi]

The General Product Machine: a New Model for Symbolic FSM TraversalGianpiero Cabodi, Paolo Camurati, Fulvio Corno, Paolo Prinetto, Matteo Sonza Reorda. fmsd, 12(3):267-289, 1998.

Efficient State Space Pruning in Symbolic Backward TraversalGianpiero Cabodi, Paolo Camurati, Stefano Quer. iccd 1994: 230-235

Exploiting Symbolic Traversal Techniques for Efficient Process Algebra ManipulationPaolo Camurati, Fulvio Corno, Paolo Prinetto. chdl 1993: 31-44

Enhancing FSM Traversal by Temporary Re-EncodingGianpiero Cabodi, Luciano Lavagno, Enrico Macii, Massimo Poncino, Stefano Quer, Paolo Camurati, Ellen Sentovich. iccd 1996: 6-11 [doi]

runs on WebDSL