Sciweavers

5084 search results - page 412 / 1017
» Proving Possibility Properties
Sort
View
LOPSTR
1994
Springer
15 years 11 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
15 years 10 months ago
How to Get More Mileage from Randomness Extractors
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
Ronen Shaltiel
FDL
2004
IEEE
15 years 10 months ago
Error Estimation in Model-Driven Development for Real-Time Software
Model-driven approaches proved themselves not suited yet to support real-time software development. Even if they have the ability of capturing adequately both functional and non-f...
Oana Florescu, Jeroen Voeten, Jinfeng Huang, Henk ...
EMSOFT
2006
Springer
15 years 10 months ago
Real-time interfaces for composing real-time systems
Recently, a number of frameworks were proposed to extend interface theory to the domains of single-processor and distributed real-time systems. This paper unifies some of these ap...
Lothar Thiele, Ernesto Wandeler, Nikolay Stoimenov
FSTTCS
2006
Springer
15 years 10 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su