Computable fixpoints in well-structured symbolic model checking - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Formal Methods in System Design Year : 2013

Computable fixpoints in well-structured symbolic model checking

Domains

Computer Science and Game Theory [cs.GT] Logic in Computer Science [cs.LO]

Nathalie Bertrand  : Connect in order to contact the contributor

https://inria.hal.science/hal-00906826

Submitted on : Wednesday, November 20, 2013-1:33:59 PM

Last modification on : Friday, March 24, 2023-2:52:57 PM

Consult the full text

Dates and versions

hal-00906826 , version 1 (20-11-2013)

Identifiers

Cite

Nathalie Bertrand, Philippe Schnoebelen. Computable fixpoints in well-structured symbolic model checking. Formal Methods in System Design, 2013, 43 (2), pp.233-267. ⟨10.1007/s10703-012-0168-y⟩. ⟨hal-00906826⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

INSTITUT-TELECOM EC-PARIS UNIV-RENNES1 CNRS INRIA ENS-CACHAN INSA-RENNES IRISA IRISA-D4 INRIA2 UR1-MATH-STIC UR1-UFR-ISTIC UNIV-RENNES UR1-MATH-NUM ENS-PARIS-SACLAY
263 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More