Complexity Information Flow in a Multi-threaded Imperative Language

DOI10.1007/978-3-319-06089-7_9zbMath1405.68145arXiv1203.6878OpenAlexW2950189755MaRDI QIDQ5410639

Romain Péchoux, Jean-Yves Marion

Publication date: 16 April 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.6878

zbMATH Keywords

type systemimplicit computational complexitynon-interferencePTimemulti-threaded imperative language

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ Unnamed Item

This page was built for publication: Complexity Information Flow in a Multi-threaded Imperative Language