Filtrer vos résultats
- 27
- 8
- 17
- 7
- 4
- 4
- 2
- 1
- 4
- 1
- 34
- 1
- 1
- 1
- 3
- 2
- 2
- 1
- 1
- 1
- 2
- 1
- 4
- 4
- 3
- 4
- 2
- 2
- 1
- 34
- 1
- 24
- 8
- 8
- 6
- 4
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 35
- 5
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
35 résultats
|
|
|
triés par
|
|
|
An algorithm for automatically obtaining distributed and fault-tolerant static schedulesJun 2003, pp.165-190
Communication dans un congrès
hal-00110453v1
|
||
|
|
Validation of the Link Layer Protocol of the IEEE-1394 Serial Bus («FireWire»): an Experiment with E-LOTOS[Research Report] RR-3172, INRIA. 1997
Rapport
inria-00073516v1
|
||
|
|
Compositional Invariant Checking for Overlaid and Nested Linked Lists[Research Report] 2012, pp.27
Rapport
hal-00768389v1
|
||
|
|
Compositional Entailment Checking for a Fragment of Separation LogicFormal Methods in System Design, 2017, 51 (3), pp.575-607. ⟨10.1007/s10703-017-0289-4⟩
Article dans une revue
hal-01937818v1
|
||
|
|
Fault-Tolerant Static Scheduling for Real-Time Distributed Embedded Systems[Research Report] RR-4006, INRIA. 2000
Rapport
inria-00072638v1
|
||
|
|
A Value-based Memory Model for Deductive VerificationLes vingt-neuvièmes Journées Francophones des Langages Applicatifs (The 29th Francophone Days of Application Languages - JFLA 2018), Jan 2018, Banyuls-sur-mer, France
Communication dans un congrès
cea-01809497v1
|
||
|
|
Guidelines for Verification of Population Protocols2010
Rapport
hal-00565090v1
|
||
|
|
Efficient On-the-Fly Model-Checking for Regular Alternation-Free Mu-CalculusScience of Computer Programming, 2003, 46(3), pp.255-281. ⟨10.1016/s0167-6423(02)00094-1⟩
Article dans une revue
hal-00109620v1
|
||
|
|
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes2006
Pré-publication, Document de travail
hal-00129018v1
|
||
|
|
Reasoning about Dynamic Networks of Infinite-State Processes with Global Synchronization2006
Pré-publication, Document de travail
hal-00129025v1
|
||
Rewriting Systems with DataInternational Symposium on Fundamentals of Computation Theory, Aug 2007, Budapest, Hungary. pp.1-22
Communication dans un congrès
hal-00157782v1
|
|||
|
|
Simple Algorithm for Simple Timed Games2008
Pré-publication, Document de travail
hal-00374700v2
|
||
|
|
Introduction à E-LOTOSAna Cavalli. Ingenierie des protocoles et qualite de service, Hermes Lavoisier, pp.213-252, 2001, serie IC2
Chapitre d'ouvrage
hal-00109629v1
|
||
|
|
SPEN: A Solver for Separation Logic9th NASA Formal Methods Symposium (NFM 2017), May 2017, Moffett Field, United States
Communication dans un congrès
hal-01936210v1
|
||
|
|
Specification of UNIX Utilities[Technical Report] ANR. 2019
Rapport
hal-02321691v1
|
||
|
|
Analysing installation scenarios of Debian packagesTACAS 2020 - 26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Apr 2020, The conference took place on-line, because it couldn't be held in Dublin, Ireland. pp.235-253, ⟨10.1007/978-3-030-45237-7_14⟩
Communication dans un congrès
hal-02355602v2
|
||
|
|
Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered ParallelismInfinity, 2006, Bonn, Germany
Communication dans un congrès
hal-00110134v1
|
||
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State ProcessesMar 2007, pp.690-705
Communication dans un congrès
hal-00129014v1
|
|||
|
|
6 (E-)LOTOS: (Enhanced) Language Of Temporal Ordering SpecificationH. Habrias and M. Frappier. Software Specification Methods -- An Overview Using a Case Study, ISTE Hermes & Lavoisier, pp.233-258, 2006
Chapitre d'ouvrage
hal-00160467v1
|
||
|
|
On Automated Lemma Generation for Separation Logic with Inductive Definitions2015
Pré-publication, Document de travail
hal-01175732v1
|
||
|
|
Synthesis and verification of constraints in the PGM protocol12th International Formal Methods Europe Symposium, FM'03, Sep 2003, Pisa, Italy. pp.264-281
Communication dans un congrès
hal-00110252v1
|
||
|
|
Invariant Synthesis for Programs Manipulating Lists with Unbounded Data2010
Autre publication scientifique
hal-00473754v1
|
||
TReX: A Tool for Reachability Analysis of Complex SystemsJul 2001, pp.368-372
Communication dans un congrès
hal-00110460v1
|
|||
|
|
Mode d'emploi pour la vérification des protocoles de population13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France
Communication dans un congrès
inria-00584684v1
|
||
|
|
Planning Robust Temporal Plans A Comparison Between CBTP and TGA ApproachesInternational Conference on Automated Planning and Scheduling, Sep 2007, Providence, Rhode Island, United States. pp.2-9
Communication dans un congrès
hal-00157935v1
|
||
|
|
SL-COMP: Competition of Solvers for Separation LogicTools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Apr 2019, Prague, Czech Republic. pp.116-132, ⟨10.1007/978-3-030-17502-3_8⟩
Communication dans un congrès
hal-02388022v1
|
||
|
|
Efficient On-the-Fly Model-Checking for Regular Alternation-Free Mu-Calculus[Research Report] RR-3899, INRIA. 2000
Rapport
inria-00072755v1
|
||
|
|
A Verified Implementation of the Bounded List ContainerTACAS, Apr 2018, Thessaloniki, Greece. pp.172-189, ⟨10.1007/978-3-319-89960-2_10⟩
Communication dans un congrès
hal-04425550v1
|
||
|
|
SPADE: Verification of Multithreaded Dynamic and Recursive Programs19th International Conference in Computer Aided Verification, Jul 2007, Berlin, Germany. pp.254-257
Communication dans un congrès
hal-00160449v1
|
||
|
|
The CoLiS Platform for the Analysis of Maintainer Scripts in Debian Software PackagesInternational Journal on Software Tools for Technology Transfer, 2022
Article dans une revue
hal-03737886v1
|
- 1
- 2