Sciweavers

503 search results - page 11 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
FSTTCS
2005
Springer
15 years 3 months ago
Quantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
Ugo Dal Lago, Martin Hofmann
81
Voted
AAAI
1990
14 years 10 months ago
Obtaining Quantitative Predictions from Monotone Relationships
: Tasks such as forecasting, diagnosis, and planning frequently require quantitative predictions . Typically, quantitative predictions are obtained by characterizing a system in te...
Joseph L. Hellerstein
ETFA
2008
IEEE
14 years 11 months ago
Hardware acceleration for verifiable, adaptive real-time communication
Distributed real-time applications implement distributed applications with timeliness requirements. Such systems require a deterministic communication medium with bounded communic...
Sebastian Fischmeister, Insup Lee, Robert Trausmut...
ECOWS
2006
Springer
15 years 1 months ago
Verifying Correctness of Web Services Choreography
This paper is about Web services used in distributed, inter-organizational business cooperation (choreography). In this application scenario, we have a multipart functional conven...
Tarek Melliti, Céline Boutrous-Saab, Sylvai...
FORMATS
2006
Springer
15 years 1 months ago
Temporal Logic Verification Using Simulation
In this paper, we consider a novel approach to the temporal logic verification problem of continuous dynamical systems. Our methodology has the distinctive feature that enables the...
Georgios E. Fainekos, Antoine Girard, George J. Pa...