Elucidating concurrent algorithms via layers of abstraction and reification

ISSN： 0934-5043

Source： Formal Aspects of Computing, Vol.23, Iss.3, 2011-05, pp. : 289-306

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

A Taxonomy Built on Layers of Abstraction for Time and State Vulnerabilities

International Journal of Secure Software Engineering (IJSSE), Vol. 4, Iss. 2, 2013-04 ,pp. : 40-66

IGI Global_journal

Access to resources Recommend Favorite

Asymptotic Complexity of Algorithms via the Nonsymmetric Hausdorff Distance

By Rodríguez-López Jesús Romaguera Salvador Valero Oscar

Computing Letters, Vol. 2, Iss. 3, 2006-09 ,pp. : 155-161

VSP

Access to resources Recommend Favorite

Improved Algorithms via Approximations of Probability Distributions

By Chari S. Rohatgi P. Srinivasan A.

Journal of Computer and System Sciences, Vol. 61, Iss. 1, 2000-08 ,pp. : 81-107

Academic Press

Access to resources Recommend Favorite

On the reification of global constraints

By Beldiceanu Nicolas

Constraints, Vol. 18, Iss. 1, 2013-01 ,pp. : 1-6

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for low power hardware synthesis from Concurrent Action Oriented Specifications (CAOS)

By Singh Gaurav Shukla Sandeep K.

International Journal of Embedded Systems, Vol. 3, Iss. 1-2, 2007-12 ,pp. : 83-92

Inderscience Publishers

Access to resources Recommend Favorite