Filtrer vos résultats
- 29
- 2
- 13
- 12
- 4
- 2
- 2
- 31
- 2
- 2
- 3
- 2
- 1
- 3
- 4
- 1
- 2
- 1
- 2
- 1
- 3
- 1
- 1
- 2
- 31
- 23
- 18
- 8
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 31
- 9
- 6
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
31 résultats
|
|
triés par
|
|
Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.90-103, ⟨10.1007/978-3-662-44602-7_8⟩
Communication dans un congrès
hal-01402031v1
|
||
|
Reasoning About Sequences of Memory StatesProceedings of the Symposium on Logical Foundations of Computer Science (LFCS07), Sergei Artemov; Anil Nerode, Jul 2007, New York, United States. pp.100-114, ⟨10.1007/978-3-540-72734-7_8⟩
Communication dans un congrès
hal-03201337v1
|
||
|
On the Expressiveness of the Ambient Logic2005
Pré-publication, Document de travail
hal-00009279v1
|
||
|
On the Almighty WandInformation and Computation, 2012, ⟨10.1016/j.ic.2011.12.003⟩
Article dans une revue
hal-01905158v1
|
||
|
Weakly synchronous systems with three machines are Turing powerfulInria. 2023
Rapport
hal-04182953v1
|
||
|
On the k-synchronizability of Systems23rd International Conference on Foundations of Software Science and Computer Systems (FOSSACS 2020), Apr 2020, Dublin, Ireland. pp.157-176, ⟨10.1007/978-3-030-45231-5_9⟩
Communication dans un congrès
hal-02883586v1
|
||
|
Synchronizability of Communicating Finite State Machines is not Decidable44th International Colloquium on Automata, Languages, and Programming ICALP 2017, 2017, Varsaw, Poland. ⟨10.4230/LIPIcs.ICALP.2017.122⟩
Communication dans un congrès
hal-01920609v1
|
||
|
A Complete Axiomatisation for Quantifier-Free Separation LogicLogical Methods in Computer Science, 2021, 17 (3), pp.17:1--17:64. ⟨10.46298/lmcs-17(3:17)2021⟩
Article dans une revue
hal-03005864v1
|
||
|
SEPARABILITY IN THE AMBIENT LOGICLogical Methods in Computer Science, 2008, 4, pp.1 - 44. ⟨10.2168/LMCS-4⟩
Article dans une revue
hal-01905180v1
|
||
|
Reasoning about sequences of memory statesAnnals of Pure and Applied Logic, 2009, ⟨10.1016/j.apal.2009.07.004⟩
Article dans une revue
hal-01905172v1
|
||
|
ON THE EXPRESSIVENESS OF THE AMBIENT LOGICLogical Methods in Computer Science, 2006, 2, pp.1 - 35. ⟨10.2168/LMCS-2⟩
Article dans une revue
hal-01905191v1
|
||
|
On Symbolic Heaps Modulo Permission Theories37th IARCS Foundation on Software Technology and Theoretical Computer Science, Dec 2017, Kanpur, India. ⟨10.4230/LIPIcs.FSTTCS.2017.25⟩
Communication dans un congrès
hal-01788798v1
|
||
|
The Effects of Adding Reachability Predicates in Quantifier-Free Separation LogicACM Transactions on Computational Logic, 2021, 22 (2), pp.14:1--14:56. ⟨10.1145/3448269⟩
Article dans une revue
hal-03215795v1
|
||
|
On the k-synchronizability of systems[Research Report] Laboratoire I3S. 2019
Rapport
hal-02272347v2
|
||
|
Shared contract-obedient channelsScience of Computer Programming, 2015, 100, pp.28 - 60. ⟨10.1016/j.scico.2014.09.008⟩
Article dans une revue
hal-01905136v1
|
||
|
Weakly Synchronous Systems with Three Machines Are Turing PowerfulRP 2023 - 17th International Conference on Reachability Problems, 2023, Nice, France. pp.28-41, ⟨10.1007/978-3-031-45286-4_3⟩
Communication dans un congrès
hal-04273451v1
|
||
|
Elimination of spatial connectives in static spatial logicsTheoretical Computer Science, 2005
Article dans une revue
hal-01905204v1
|
||
|
Model-checking process equivalencesTheoretical Computer Science, 2014, 560, pp.326 - 347. ⟨10.1016/j.tcs.2014.08.020⟩
Article dans une revue
hal-01905142v1
|
||
|
Multi-buffer simulations: Decidability and complexityInformation and Computation, 2018, 262, pp.280 - 310. ⟨10.1016/j.ic.2018.09.008⟩
Article dans une revue
hal-01920584v1
|
||
|
On the Almighty WandComputer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Sep 2008, Bertinoro, Italy. pp.323-338, ⟨10.1007/978-3-540-87531-4_24⟩
Communication dans un congrès
istex
hal-03201440v1
|
||
|
The Effects of Adding Reachability Predicates in Propositional Separation Logic22nd International Conference on Foundations of Software Science and Computation Structures FOSSACS, 2018, Thessaloniki, Greece
Communication dans un congrès
hal-01920563v1
|
||
|
Synchronizability of Communicating Finite State Machines is not Decidable2018
Pré-publication, Document de travail
hal-01474722v5
|
||
|
On the relationship between higher-order recursion schemes and higher-order fixpoint logicthe 44th ACM SIGPLAN Symposium, Jan 2017, Paris, France. ⟨10.1145/3009837⟩
Communication dans un congrès
hal-01920615v1
|
||
|
Reliable Contracts for Unreliable Half-Duplex CommunicationsWeb Services and Formal Methods (WS-FM), 2011, Clermont-Ferrand, France
Communication dans un congrès
hal-03252111v1
|
||
A Spatial Equational Logic for the Applied pi-calculus[Research Report] 2008
Rapport
inria-00524786v1
|
|||
|
Guessing the Buffer Bound for k-SynchronizabilityInternational Journal of Foundations of Computer Science, 2022, 34 (8), pp.1051-1076. ⟨10.1142/S0129054122430018⟩
Article dans une revue
hal-03890605v1
|
||
|
The Complexity of Model-Checking the Tail-Recursive Fragment of Higher-Order Modal Fixpoint LogicFundamenta Informaticae, 2021, ⟨10.3233/FI-2016-0000⟩
Article dans une revue
hal-03180788v1
|
||
|
A partial order view of message-passing communication models[Research Report] Université Nice Côte d’Azur, CNRS, I3S, France. 2022
Rapport
hal-03823473v3
|
||
Space-Efficient Fragments of Higher-Order Fixpoint LogicRP, 2017, London, United Kingdom
Communication dans un congrès
hal-01920599v1
|
|||
|
Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-CalculusTheory of Security and Applications (TOSCA, joint workshop affiliated to ETAPS), Mar 2011, Saarbrücken, Germany. pp.166-185, ⟨10.1007/978-3-642-27375-9⟩
Communication dans un congrès
inria-00578896v1
|
- 1
- 2