Sciweavers

290 search results - page 29 / 58
» A Denotational Semantics for Handel-C
Sort
View
KBSE
1997
IEEE
15 years 10 months ago
A Formal Automated Approach for Reverse Engineering Programs with Pointers
Given a program S and a precondition Q, the strongest postcondition, denoted sp(S Q), is defined as the strongest condition that holds after the execution of S, given that S term...
Gerald C. Gannod, Betty H. C. Cheng
LICS
1993
IEEE
15 years 10 months ago
Full Abstraction for a Shared Variable Parallel Language
traction for a Shared Variable Parallel Language Stephen Brookes∗ School of Computer Science Carnegie Mellon University Pittsburgh, Pa 15213 We give a new denotational semantics...
Stephen D. Brookes
IWFM
1998
134views Formal Methods» more  IWFM 1998»
15 years 7 months ago
Facilitating Modular Property-Preserving Extensions of Programming Languages
We will explore an approach to modular programming language descriptions and extensions in a denotational style. Based on a language core, language features are added stepwise on ...
Claus Pahl
ENTCS
2008
90views more  ENTCS 2008»
15 years 6 months ago
Quantum Data and Control Made Easier
In this paper we define nQML, a functional quantum programming language that follows the "quantum data and control" paradigm. In comparison to Altenkirch and Grattage�...
Michael Lampis, Kyriakos G. Ginis, Michalis A. Pap...
ENTCS
2007
89views more  ENTCS 2007»
15 years 6 months ago
Quantum Programs With Classical Output Streams: (Extended Abstract)
d abstract) Dominique Unruh 1 Institut f¨ur Algorithmen und Kognitive Systeme, Universit¨at Karlsruhe Am Fasanengarten 5, 76131 Karlsruhe, Germany We show how to model the seman...
Dominique Unruh