Filtrer vos résultats
- 33
- 23
- 38
- 14
- 2
- 1
- 1
- 1
- 55
- 1
- 1
- 3
- 6
- 4
- 2
- 3
- 1
- 4
- 8
- 5
- 5
- 4
- 7
- 3
- 56
- 43
- 37
- 9
- 7
- 7
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 56
- 13
- 9
- 8
- 7
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 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
56 résultats
|
|
|
triés par
|
|
|
Parameterized Communicating Automata: Complementation and Model Checking34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), Dec 2014, New Delhi, India
Communication dans un congrès
hal-01030765v1
|
||
|
|
Automata and Logics for Concurrent Systems: Realizability and VerificationFormal Languages and Automata Theory [cs.FL]. ENS Cachan, 2015
HDR
tel-01242861v1
|
||
|
|
Bounded Reachability Problems are Decidable in FIFO Machines31st International Conference on Concurrency Theory (CONCUR 2020), Sep 2020, Vienna, Austria
Communication dans un congrès
hal-02900813v1
|
||
Learning Communicating Automata from~MSCsIEEE Transactions on Software Engineering, 2010, 36 (3), pp.390-408. ⟨10.1109/TSE.2009.89⟩
Article dans une revue
hal-00779922v1
|
|||
Distributed Timed Automata with Independently Evolving ClocksFundamenta Informaticae, 2014, 130 (4), pp.377-407
Article dans une revue
hal-01089524v1
|
|||
Towards Formal Verification of Distributed Algorithms22nd International Symposium on Temporal Representation and Reasoning, 2015, Kassel, Germany
Communication dans un congrès
hal-01242959v1
|
|||
|
|
Frequency Linear-time Temporal LogicProceedings of the 6th International Symposium on Theoretical Aspects of Software Engineering (TASE'12), 2012, Beijing, China. pp.85-92, ⟨10.1109/TASE.2012.43⟩
Communication dans un congrès
hal-00776769v1
|
||
|
|
Property-Directed Verification of Recurrent Neural Networks2020
Pré-publication, Document de travail
hal-03134999v1
|
||
An Automata-Theoretic Approach to the Verification of Distributed Algorithms26th International Conference on Concurrency Theory (CONCUR'15), 2015, Madrid, Spain. pp.340-353
Communication dans un congrès
hal-01241122v1
|
|||
|
|
The Complexity of Model Checking Multi-Stack Systems28th Annual IEEE Symposium on Logic in Computer Science (LICS'13), 2013, United States. pp.163-170, ⟨10.1109/LICS.2013.22⟩
Communication dans un congrès
hal-00926182v1
|
||
|
|
Pebble Weighted Automata and Weighted LogicsACM Transactions on Computational Logic, 2014, 15 (2), pp.15. ⟨10.1145/2579819⟩
Article dans une revue
hal-00964994v2
|
||
|
|
Realizability of Dynamic MSC LanguagesInternational Computer Science Symposium in Russia, Jun 2010, Kazan, Russia
Communication dans un congrès
inria-00589714v1
|
||
|
|
Synthesis in Presence of Dynamic LinksGandALF'20 - 11th International Symposium on Games, Automata, Logics, and Formal Verification, Sep 2020, Brussels (online), Belgium
Communication dans un congrès
hal-02917542v1
|
||
|
|
Synthesis in presence of dynamic linksInformation and Computation, 2022, 289 (Part B), pp.104856. ⟨10.1016/j.ic.2021.104856⟩
Article dans une revue
hal-03518879v1
|
||
|
|
Weighted Specifications over Nested WordsFoundations of Software Science and Computation Structures (FoSSaCS'13), Mar 2013, Rome, Italy. pp.385-400, ⟨10.1007/978-3-642-37075-5_25⟩
Communication dans un congrès
hal-00909035v1
|
||
|
|
Logical Characterization of Weighted Pebble Walking AutomataCSL-LICS '14, Jul 2014, Vienna, Austria. ⟨10.1145/2603088.2603118⟩
Communication dans un congrès
hal-01006125v1
|
||
Weighted Expressions and DFS Tree Automata[Research Report] LSV-11-08, 2011
Rapport
hal-00779951v1
|
|||
|
|
Weighted versus Probabilistic LogicsProceedings of the 13th International Conference on Developments in Language Theory (DLT'09), 2009, Stuttgart, Germany, Germany. pp.18-38, ⟨10.1007/978-3-642-02737-6_2⟩
Communication dans un congrès
hal-00772679v1
|
||
|
|
The Complexity of Flat Freeze LTLLogical Methods in Computer Science, 2019, 15 (3), ⟨10.23638/LMCS-15(3:33)2019⟩
Article dans une revue
hal-02398193v1
|
||
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before29th International Conference on Concurrency Theory (CONCUR 2018), Sep 2018, Beijing, China. pp.7:1-7:17, ⟨10.4230/LIPIcs.CONCUR.2018.7⟩
Communication dans un congrès
hal-02398194v1
|
|||
|
|
Identifiers in Registers22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'19), Apr 2019, Prague, Czech Republic. pp.115-132, ⟨10.1007/978-3-030-17127-8_7⟩
Communication dans un congrès
hal-02268084v1
|
||
|
|
Realizability of concurrent recursive programsFormal Methods in System Design, 2018, 53 (3), pp.339-362. ⟨10.1007/s10703-017-0282-y⟩
Article dans une revue
hal-02398192v1
|
||
|
|
Analysis of recurrent neural networks via property-directed verification of surrogate modelsInternational Journal on Software Tools for Technology Transfer, 2023, 25 (3), pp.341-354. ⟨10.1007/S10009-022-00684-W⟩
Article dans une revue
hal-04286080v1
|
||
Property-Directed Verification and Robustness Certification of Recurrent Neural Networks19th International Symposium on Automated Technology for Verification and Analysis (ATVA 2021), Oct 2021, Gold Coast (Online), Australia. pp.364-380, ⟨10.1007/978-3-030-88885-5_24⟩
Communication dans un congrès
hal-03285418v1
|
|||
|
|
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model CheckingJournal of Applied Logic, 2014, 12 (4), pp.395-416. ⟨10.1016/j.jal.2014.05.001⟩
Article dans une revue
hal-01005353v1
|
||
|
|
Pebble weighted automata and transitive closure logicsProceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) - Part II, Jul 2010, Bordeaux, France. pp.587-598, ⟨10.1007/978-3-642-14162-1_49⟩
Communication dans un congrès
hal-00608179v1
|
||
|
|
Parameterized Verification of Communicating Automata under Context Bounds8th Workshop on Reachability Problems in Computational Models (RP'14), 2014, Oxford, United Kingdom. pp.45-57
Communication dans un congrès
hal-00984421v1
|
||
|
|
Realizability of Concurrent Recursive ProgramsProceedings of the 12th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'09), 2009, York, UK, United Kingdom. pp.410-424, ⟨10.1007/978-3-642-00596-1_29⟩
Communication dans un congrès
hal-00772771v1
|
||
|
|
Parameterized Synthesis for Fragments of First-Order Logic over Data Words23rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'20), Apr 2020, Dublin, Ireland. pp.97-118, ⟨10.1007/978-3-030-45231-5_6⟩
Communication dans un congrès
hal-02490599v1
|
||
|
|
Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* SearchICGI 2021 - 15th International Conference on Grammatical Inference, Aug 2021, New York City / Virtual, United States. pp.113-129
Communication dans un congrès
hal-03285433v1
|
- 1
- 2