33 search results - page 6 / 7 » A Complete Axiomatic Semantics for the CSP Stable-Failures M... |
FPCA
1989
13 years 9 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
CHARME
2003
Springer
13 years 11 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
JACM
2007
13 years 5 months ago
2007
onal Numbers as an Abstract Data Type1 J A Bergstra2 University of Amsterdam, Informatics Institute, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands J V Tucker3 Department of Com...
EUROMICRO
1999
IEEE
13 years 10 months ago
1999
IEEE
Software synthesis for system level design languages becomes feasible because the current technology, pricing and application trends will most likely alleviate the industrial empha...
LICS
2008
IEEE
14 years 5 days ago
2008
IEEE
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...