Skip to Main content Skip to Navigation
Conference papers

Objects in Polynomial Time

Emmanuel Hainry 1 Romain Péchoux 1
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : A type system based on non-interference and data ramification principles is introduced in order to capture the set of functions computable in polynomial time on OO programs. The studied language is general enough to capture most OO constructs and our characterization is quite expressive as it allows the analysis of a combination of imperative loops and of data ramification scheme based on Bellantoni and Cook's safe recursion using function algebra.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download
Contributor : Emmanuel Hainry <>
Submitted on : Monday, September 28, 2015 - 3:00:15 PM
Last modification on : Tuesday, December 8, 2020 - 9:38:01 AM
Long-term archiving on: : Tuesday, December 29, 2015 - 10:33:05 AM


Files produced by the author(s)




Emmanuel Hainry, Romain Péchoux. Objects in Polynomial Time. APLAS 2015, Nov 2015, Pohang, South Korea. pp.387--404, ⟨10.1007/978-3-319-26529-2_21⟩. ⟨hal-01206161⟩



Record views


Files downloads