Sciweavers

613 search results - page 114 / 123
» An analysis framework for network-code programs
Sort
View
PLILP
1993
Springer
15 years 1 months ago
Higher-Order Chaotic Iteration Sequences
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
Mads Rosendahl
HIPEAC
2009
Springer
15 years 1 months ago
Deriving Efficient Data Movement from Decoupled Access/Execute Specifications
Abstract. On multi-core architectures with software-managed memories, effectively orchestrating data movement is essential to performance, but is tedious and error-prone. In this p...
Lee W. Howes, Anton Lokhmotov, Alastair F. Donalds...
COOPIS
2004
IEEE
15 years 1 months ago
Implementing QoS Aware Component-Based Applications
By QoS (Quality of Service), we often refer to a set of quality requirements on the collective behavior of one or more objects. These requirements enable the provision of better se...
Avraam Chimaris, George A. Papadopoulos
PEPM
2000
ACM
15 years 1 months ago
Calculating Sized Types
Many program optimisations and analyses, such as arraybound checking, termination analysis, etc, dependon knowing the size of a function's input and output. However, size inf...
Wei-Ngan Chin, Siau-Cheng Khoo
BPM
2008
Springer
125views Business» more  BPM 2008»
14 years 11 months ago
Checking Compliance of Execution Traces to Business Rules
Complex and flexible business processes are critical not only because they are difficult to handle, but also because they often tend to loose their intelligibility. Verifying compl...
Federico Chesani, Paola Mello, Marco Montali, Fabr...