F. Ghenassia, Transaction-Level Modeling with SystemC. TLM Concepts and Applications for Embedded Systems, 2005.

F. Herrera and E. Villar, Extension of the SystemC kernel for simulation coverage improvement of system-level concurrent specifications. In: FDL'06: Forum on Specification & Design Languages, 2006.

C. Flanagan and P. Godefroid, Dynamic partial-order reduction for model checking software, POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp.110-121, 2005.

C. Helmstetter, F. Maraninchi, L. Maillet-contoz, and M. Moy, Automatic Generation of Schedulings for Improving the Test Coverage of Systems-on-a-Chip, 2006 Formal Methods in Computer Aided Design, pp.171-178, 2006.
DOI : 10.1109/FMCAD.2006.10

URL : https://hal.archives-ouvertes.fr/hal-00311006

C. Helmstetter, F. Maraninchi, and L. Maillet-contoz, Test Coverage for Loose Timing Annotations, 11th International Workshop on Formal Methods for Industrial Critical Systems, 2006.
DOI : 10.1007/978-3-540-70952-7_7

URL : https://hal.archives-ouvertes.fr/inria-00350936

C. Helmstetter, Validation de modèles de systèmes sur puce en présence d'ordonnancements indéterministes et de temps imprécis, 2007.

. Arvind and X. Shen, Using term rewriting systems to design and verify processors, IEEE Micro, vol.19, issue.3, pp.36-46, 1999.
DOI : 10.1109/40.768501

L. A. Kunzle, R. Valette, and B. P. , Temporal reasoning in fuzzy time Petri nets, LAAS Toulouse, 1998.

P. Merlin and D. Farber, Recoverability of Communication Protocols--Implications of a Theoretical Study, IEEE Transactions on Communications, vol.24, issue.9, pp.1988-2012, 1976.
DOI : 10.1109/TCOM.1976.1093424

A. Mazurkiewicz, Trace theory Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency, pp.279-324, 1987.

L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, pp.558-565, 1978.
DOI : 10.1145/359545.359563

S. Katz and D. Peled, Defining conditional independence using collapses, Theoretical Computer Science, vol.101, issue.2, pp.337-359, 1992.
DOI : 10.1016/0304-3975(92)90054-J

URL : http://dx.doi.org/10.1016/0304-3975(92)90054-j

P. Godefroid, Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem, Volume, vol.1032, 1996.
DOI : 10.1007/3-540-60761-7

R. Clarisó and J. Cortadella, The Octahedron Abstract Domain, Static Analysis, 11th International Symposium, pp.312-327, 2004.
DOI : 10.1007/978-3-540-27864-1_23

A. Miné, The octagon abstract domain, In: WCRE, p.310, 2001.

M. Moy, F. Maraninchi, and L. Maillet-contoz, Pinapa, Proceedings of the 5th ACM international conference on Embedded software , EMSOFT '05, 2005.
DOI : 10.1145/1086228.1086286

URL : https://hal.archives-ouvertes.fr/hal-00198669

C. Traulsen, J. Cornet, M. Moy, and F. Maraninchi, A SystemC/TLM Semantics in Promela and Its Possible Applications, 14th Workshop on Model Checking Software SPIN, 2007.
DOI : 10.1007/978-3-540-73370-6_14

URL : https://hal.archives-ouvertes.fr/hal-00294143

C. Helmstetter and O. Ponsini, A Comparison of Two SystemC/TLM Semantics for Formal Verification, 2008 6th ACM/IEEE International Conference on Formal Methods and Models for Co-Design, 2008.
DOI : 10.1109/MEMCOD.2008.4547687

URL : https://hal.archives-ouvertes.fr/inria-00275456

M. Y. Vardi, Formal techniques for SystemC verification, Proceedings of the 44th annual conference on Design automation, DAC '07, 2007.
DOI : 10.1145/1278480.1278527

B. Niemann and C. Haubelt, Formalizing TLM with Communicating State Machines, pp.285-292, 2006.
DOI : 10.1007/978-1-4020-6149-3_14

D. Karlsson, P. Eles, and Z. Peng, Formal Verification of SystemC Designs Using a Petri-Net Based Representation, Proceedings of the Design Automation & Test in Europe Conference, pp.1228-1233, 2006.
DOI : 10.1109/DATE.2006.244076

D. Kroening and N. Sharygina, Formal verification of SystemC by automatic hardware/software partitioning, Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2005. MEMOCODE '05., pp.101-110, 2005.
DOI : 10.1109/MEMCOD.2005.1487900

M. Moy, F. Maraninchi, and L. Maillet-contoz, LusSy: an open tool for the analysis of systems-on-a-chip at the transaction level. Design Automation for Embedded Systems, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00310999

P. Godefroid, Software Model Checking: The VeriSoft Approach, Formal Methods in System Design, vol.3, issue.2, pp.77-101, 2005.
DOI : 10.1007/s10703-005-1489-x

S. Kundu, M. Ganai, and R. Gupta, Partial order reduction for scalable testing of systemC TLM designs, Proceedings of the 45th annual conference on Design automation, DAC '08, pp.936-941, 2008.
DOI : 10.1145/1391469.1391706

N. Blanc and D. Kroening, Race analysis for SystemC using model checking, Proceedings of ICCAD 2008, pp.356-363, 2008.
DOI : 10.1109/iccad.2008.4681598

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.564.3993

T. Yoneda, T. Kitai, and C. J. Myers, Automatic Derivation of Timing Constraints by Failure Analysis, CAV '02: Proceedings of the 14th International Conference on Computer Aided Verification, pp.195-208, 2002.
DOI : 10.1007/3-540-45657-0_15

P. Godefroid, N. Klarlund, and K. Sen, Dart: directed automated random testing, PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation, pp.213-223, 2005.

P. Godefroid, Compositional dynamic test generation, POPL '07: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp.47-54, 2007.
DOI : 10.1145/1190216.1190226

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.655

X. Yi, J. Wang, and X. Yang, Stateful Dynamic Partial-Order Reduction, In: ICFEM. Lecture Notes in Computer Science, vol.4260, pp.149-167, 2006.
DOI : 10.1007/11901433_9

Y. Yang, X. Chen, G. Gopalakrishnan, and R. M. Kirby, Distributed Dynamic Partial Order Reduction Based Verification of Threaded Software, In: SPIN. Lecture Notes in Computer Science, vol.4595, pp.58-75, 2007.
DOI : 10.1007/978-3-540-73370-6_6

K. L. Mcmillan, Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits, CAV '92: Proceedings of the Fourth International Workshop on Computer Aided Verification, pp.164-177, 1992.
DOI : 10.1007/3-540-56496-9_14

J. Esparza and S. Römer, An Unfolding Algorithm for Synchronous Products of Transition Systems, Proc. of CONCUR'99. Number 1664 in Lecture Notes in Computer Science, pp.2-20, 1999.
DOI : 10.1007/3-540-48320-9_2

B. Chopard, P. Combes, and J. Zory, A Conservative Approach to SystemC Parallelization, International Conference on Computational Science, pp.653-660, 2006.
DOI : 10.1007/11758549_89