Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Stark:1988:PEB,
author = "E. W. Stark",
title = "Proving entailment between conceptual state
specifications",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "1",
pages = "135--154",
month = jan,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., State Univ. of New York, Stony
Brook, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "completeness; conceptual state specifications;
entailment proving; expressive power; program
verification; programming theory; simulation between
machines; specification language; specification
languages; temporal logic",
pubcountry = "Netherlands A05",
treatment = "T Theoretical or Mathematical",
}