@InProceedings{BJK:08:CiE,
  author =       "Amir M. Ben-Amram and Neil D. Jones and Lars Kristiansen",
  year =         "2008",
  title =        "Linear, Polynomial or Exponential? Complexity Inference
                 in Polynomial Time",
  booktitle =    "Logic and Theory of Algorithms, Fourth Conference on
  Computability in Europe, CiE 2008",
  editor =       "Arnold Beckmann, and Costas Dimitracopoulos, and
                 Benedikt L\"owe",
  publisher =    "Springer",
  series =       "LNCS",
  volume =       "5028",
  pages =        "67--76",
  keywords =     "subrecursive langauges, complexity classes,
		  program analysis, run-time analysis",
  summary =      "A very natural question about a program is what the
  growth-rate of its time complexity is, e.g., is it polynomial.
  Improving on some previous algorithms to answer such questions
  automatically, our work is the first one to completely solve the
  problem for a well-defined core language including non-deterministic
  branching and bounded loops, as well as restricted arithmetics over
  integers.",
  puf =          "Artikel i proceedings (med censur)",
}