Skip to Main content Skip to Navigation

hal-00953273v1  Conference papers
Taha TrikiYves LedruLydie Du BousquetFrédéric DadeauJulien Botella. Nouveaux mécanismes de filtrage de tests basés sur le modèle
Actes des Quatrièmes journées nationales du Groupement De Recherche CNRS du Génie de la Programmation et du Logiciel, 2012, Rennes, France. pp.179-180
inria-00369395v1  Reports
Véronique CortierGraham Steel. Synthesising Secure APIs
[Research Report] RR-6882, INRIA. 2009, pp.24
hal-00468802v1  Directions of work or proceedings
Siva AnantharamanGaétan HainsMichaël RusinowitchPaul GastinJohn Mullins. Journal of Automata, Languages and Combinatorics, Vol. 11(1)
Otto-von-Guericke-Universität, D-39016 Magdeburg, pp.142, 2006
inria-00525775v1  Journal articles
Hubert Comon-LundhVéronique CortierEugen Zalinescu. Deciding security properties for cryptographic protocols. Application to key cycles.
ACM Transactions on Computational Logic, Association for Computing Machinery, 2010, 11 (2), pp.Article 9. ⟨10.1145/1656242.1656244⟩
inria-00426621v1  Conference papers
Véronique CortierGraham Steel. A Generic Security API for Symmetric Key Management on Cryptographic Devices
14th European Symposium On Research In Computer Security - ESORICS'09, Sep 2009, St Malo, France. pp.605-620, ⟨10.1007/978-3-642-04444-1_37⟩
hal-00561373v1  Journal articles
Yohan BoichutRoméo CourbisPierre-Cyrille HeamOlga Kouchnarenko. Handling Non Left-Linear Rules When Completing Tree Automata
International Journal of Foundations of Computer Science, World Scientific Publishing, 2009, 20 (5), pp.837--849. ⟨10.1142/S0129054109006917⟩
inria-00429356v1  Conference papers
Yohan BoichutPierre-Cyrille HeamOlga Kouchnarenko. Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives
9th International Workshop on Verification of Infinite-State Systems - INFINITY'07, 2007, Lisbonnes, Portugal. pp.57-72
inria-00578884v1  Conference papers
Ryma AbassiFlorent JacquemardMichaël RusinowitchSihem Guemara El Fatmi. XML Access Control: from XACML to Annotated Schemas
Second International Conference on Communications and Networking (ComNet), Nov 2010, Tozeur, Tunisia. pp.1-8, ⟨10.1109/COMNET.2010.5699810⟩
inria-00525779v1  Conference papers
Mathilde ArnaudVéronique CortierStéphanie Delaune. Modeling and Verifying Ad Hoc Routing Protocols.
23rd IEEE Computer Security Foundations Symposium - CSF'10, 2010, Edinburgh, United Kingdom
inria-00428998v1  Conference papers
Yohan BoichutPierre-Cyrille HeamOlga Kouchnarenko. How to Tackle Integer Weighted Automata Positivity
3rd InternationalWorkshop on Reachability Problems - RP 2009, Sep 2009, Palaiseau, France. pp.79-92, ⟨10.1007/978-3-642-04420-5_9⟩
hal-01101475v1  Conference papers
Olivier AumageJacques M. BahiSylvain Contassot-VivierRaphael CouturierAlexandre Denis et al.  ALTA: Asynchronous Loss Tolerant Algorithms for Grid Computing
3rd International workshop on Parallel Matrix Algorithms and Applications (PMAA'04), Oct 2004, Marseille, France
inria-00329803v1  Conference papers
Florent JacquemardMichaël Rusinowitch. Closure of Hedge-Automata Languages by Hedge Rewriting
19th International Conference on Rewriting Techniques and Applications - RTA 2008, 2008, Hagenberg, Austria. pp.157-171, ⟨10.1007/978-3-540-70590-1_11⟩
hal-00732909v1  Conference papers
Hubert Comon-LundhVéronique CortierGuillaume Scerri. Security proof with dishonest keys
1st International Conference on Principles of Security and Trust (POST'12), Mar 2012, Tallinn, Estonia. pp.149--168, ⟨10.1007/978-3-642-28641-4_9⟩
inria-00579011v1  Conference papers
Florent JacquemardMichaël RusinowitchLaurent Vigneron. Tree automata with equality constraints modulo equational theories
3d International Joint Conference on Automated Reasoning (IJCAR), Aug 2006, Seattle, United States. pp.557-571, ⟨10.1007/11814771_45⟩
hal-00881068v1  Conference papers
Hubert Comon-LundhVéronique CortierGuillaume Scerri. Tractable inference systems: an extension with a deducibility predicate
CADE'24 - 24th International Conference on Automated Deduction - 2013, Jun 2013, Lake Placid, United States. pp.91-108, ⟨10.1007/978-3-642-38574-2_6⟩
inria-00104145v1  Journal articles
François LaroussiniePhilippe SchnoebelenMathieu Turuani. On the expressivity and complexity of quantitative branching-time temporal logics.
Theoretical Computer Science, Elsevier, 2003, Theoretical Computer Science, 1-3 (297), pp.297-315. ⟨10.1016/S0304-3975(02)00644-8⟩