Entry Borger:1996:CCO from compj.bib

Last update: Sun Nov 30 02:31:30 MST 2003                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Borger:1996:CCO,
  author =       "Egon. B{\"o}rger and Igor {\Dbar}ur{\dbar}anovic",
  title =        "Correctness of compiling {Occam} to {Transputer}
                 code",
  journal =      j-COMP-J,
  volume =       "39",
  number =       "1",
  pages =        "52--92",
  month =        "????",
  year =         "1996",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620",
  bibdate =      "Wed Jul 21 09:54:42 MDT 1999",
  bibsource =    "http://www3.oup.co.uk/computer_journal/Volume_39/Issue_01/Vol39_01.index.html",
  URL =          "http://www.oup.co.uk/jnls/list/comjnl/hdb/Volume_39/Issue_01/390052.sgm.abs.html;
                 http://www3.oup.co.uk/computer_journal/Volume_39/Issue_01/Vol39_01.body.html#AbstractEgon",
  acknowledgement = ack-nhfb,
  author-2-adr = "University Paderborn, Fachbereich 17--Informatic,
                 Warburgerstrasse 100, 33098 Paderborn, Germany",
  classcodes =   "C6150C (Compilers, interpreters and other processors);
                 C6110P (Parallel programming); C4240P (Parallel
                 programming and algorithm theory)",
  corpsource =   "Dipartimento di Inf., Pisa Univ., Italy",
  email-1 =      "boerger@di.unipi.it",
  keywords =     "abstract; abstraction level; atomic Occam
                 instructions; case study; completeness proof;
                 correctness proof; formal; framework; general
                 compilation schema; high-priority queue; imperative
                 programming language; instruction sets; low-priority
                 queue; nondeterminism; Occam; Occam compilation;
                 parallelising compilers; parallelism; processor;
                 program; proof; provably correct compilation
                 techniques; refinement steps; rigorous mathematical;
                 semantics; theorem provers; theorem proving; Transputer
                 code; Transputer instruction set architecture;
                 transputers; verification",
  treatment =    "P Practical; T Theoretical or Mathematical",
}

Related entries