A PROGRAM FOR SIGNAL FLOW GRAPHS: (an alternative to Mason's theorem)

ISSN： 0332-1649

Source： COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol.4, Iss.3, 1993-12, pp. : 155-165

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Flow-sensitive, context-sensitive, and object-sensitive information flow control based on program dependence graphs

By Hammer Christian

International Journal of Information Security (IJIS), Vol. 8, Iss. 6, 2009-12 ,pp. : 399-422

Springer Publishing Company

Access to resources Recommend Favorite

An Optimal Alternative Theorem and Applications to Mathematical Programming

By Flores-Bazán Fabián Hadjisavvas Nicolas Vera Cristián

Journal of Global Optimization, Vol. 37, Iss. 2, 2007-02 ,pp. : 229-243

Springer Publishing Company

Access to resources Recommend Favorite

Alternative Proof of Standard Completeness Theorem for MTL

By Horčík Rostislav

Soft Computing, Vol. 11, Iss. 2, 2007-01 ,pp. : 123-129

Springer Publishing Company

Access to resources Recommend Favorite

Model checking security properties of control flow graphs

By Besson F.

Journal of Computer Security, Vol. 9, Iss. 3, 2001-01 ,pp. : 217-250

Ios Press

Access to resources Recommend Favorite

Maximum Flow in Directed Planar Graphs with Vertex Capacities

By Kaplan Haim Nussbaum Yahav

Algorithmica, Vol. 61, Iss. 1, 2011-09 ,pp. : 174-189

Springer Publishing Company

Access to resources Recommend Favorite