Sciweavers

37 search results - page 1 / 8
» A machine-checked model of safe composition
Sort
View
FMICS
2007
Springer
13 years 11 months ago
Machine Checked Formal Proof of a Scheduling Protocol for Smartcard Personalization
Using PVS (Prototype Verification System), we prove that an industry designed scheduler for a smartcard personalization machine is safe and optimal. This scheduler has previously ...
Leonard Lensink, Sjaak Smetsers, Marko C. J. D. va...
IEEESCC
2006
IEEE
13 years 11 months ago
Control the Flow: How to Safely Compose Streaming Services into Business Processes
Although workflow languages are widely used for composing discrete services, these are not suitable for stream based interactions. In this paper we address the problem of how to ...
Biörn Biörnstad, Cesare Pautasso, Gustav...
SIGSOFT
2009
ACM
14 years 5 months ago
Fitting the pieces together: a machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement a unit of program functionality. In most product lines, only some combination of featu...
Benjamin Delaware, William R. Cook, Don S. Batory
FOAL
2009
ACM
13 years 11 months ago
A machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement some unit of program functionality. In most product lines, only some combination of fe...
Benjamin Delaware, William R. Cook, Don S. Batory
PLDI
2011
ACM
12 years 7 months ago
Safe optimisations for shared-memory concurrent programs
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
Jaroslav Sevcík