Sciweavers

238 search results - page 27 / 48
» The RoadRunner dynamic analysis framework for concurrent pro...
Sort
View
ICALP
2000
Springer
14 years 7 days 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
APLAS
2004
ACM
14 years 2 months ago
Protocol Specialization
Abstract. In component-based programming, the programmer assembles applications from prefabricated components. The assembly process has two main steps: adapting a component by twea...
Matthias Neubauer, Peter Thiemann
SCP
1998
138views more  SCP 1998»
13 years 8 months ago
A Hierarchy of Constraint Systems for Data-Flow Analysis of Constraint Logic-Based Languages
Many interesting analyses for constraint logic-based languages are aimed at the detection of monotonic properties, that is to say, properties that are preserved as the computation...
Roberto Bagnara
ECOOPW
1994
Springer
14 years 22 days ago
Abstracting Interactions Based on Message Sets
ing Interactions Based on Message Sets Svend Frr 1 and Gul Agha2. 1 Hewlett-Packard Laboratories, 1501 Page Mill Road, Palo Alto, CA 94303 2 University of Illinois, 1304 W. Springf...
Svend Frølund, Gul Agha
EMSOFT
2006
Springer
13 years 10 months ago
Reusable models for timing and liveness analysis of middleware for distributed real-time and embedded systems
Distributed real-time and embedded (DRE) systems have stringent constraints on timeliness and other properties whose assurance is crucial to correct system behavior. Formal tools ...
Venkita Subramonian, Christopher D. Gill, Cé...