Sciweavers

367 search results - page 26 / 74
» Relating Full Abstraction Results for Different Programming ...
Sort
View
ICALP
2000
Springer
15 years 1 months ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée
ASPLOS
2004
ACM
15 years 3 months ago
HOIST: a system for automatically deriving static analyzers for embedded systems
Embedded software must meet conflicting requirements such as being highly reliable, running on resource-constrained platforms, and being developed rapidly. Static program analysi...
John Regehr, Alastair Reid
JMLC
2000
Springer
15 years 1 months ago
Composable Message Semantics in Oberon
Most object-oriented languages offer a limited number of invocation semantics. At best, they define a default mode of synchronous invocation, plus some keywords to express addition...
Markus Hof
SIGSOFT
2009
ACM
15 years 10 months ago
Supporting automatic model inconsistency fixing
Modern development environments often involve models with complex consistency relations. Some of the relations can be automatically established through "fixing procedures&quo...
Yingfei Xiong, Zhenjiang Hu, Haiyan Zhao, Hui Song...
LCTRTS
2010
Springer
15 years 4 months ago
Contracts for modular discrete controller synthesis
We describe the extension of a reactive programming language with a behavioral contract construct. It is dedicated to the programming of reactive control of applications in embedd...
Gwenaël Delaval, Hervé Marchand, &Eacu...