Covering sharing trees: a compact data structure for parameterized verification

Author： Delzanno Giorgio   Raskin Jean-François   Van Begin Laurent  

Publisher： Springer Publishing Company

ISSN： 1433-2779

Source： International Journal on Software Tools for Technology Transfer, Vol.5, Iss.2-3, 2004-03, pp. : 268-297

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

Related content

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

An Approach to the Verification of Symmetric Parameterized Distributed Systems

By Konnov I.   Zakharov V.  

Programming and Computer Software, Vol. 31, Iss. 5, 2005-09 ,pp. : 225-236

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Verification as a parameterized testing (experiments with the SCP4 supercompiler)

By Lisitsa A.   Nemytykh A.  

Programming and Computer Software, Vol. 33, Iss. 1, 2007-02 ,pp. : 14-23

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Optimal Direct and Indirect Covering Trees

By Williams J.C.  

Annals of Operations Research, Vol. 123, Iss. 1-4, 2003-10 ,pp. : 265-284

Springer Publishing Company

Access to resources Recommend Favorite

Approximated parameterized verification of infinite-state processes with global conditions

By Abdulla Parosh   Delzanno Giorgio   Rezine Ahmed  

Formal Methods in System Design, Vol. 34, Iss. 2, 2009-04 ,pp. : 126-156

Springer Publishing Company

Access to resources Recommend Favorite