Sciweavers

578 search results - page 102 / 116
» Analysis of Programs with Exception-Handling Constructs
Sort
View
ISSTA
2004
ACM
14 years 28 days ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
WOSP
2004
ACM
14 years 28 days ago
Performance modeling from software components
When software products are assembled from pre-defined components, performance prediction should be based on the components also. This supports rapid model-building, using previous...
Xiuping Wu, C. Murray Woodside
COMPSAC
1999
IEEE
13 years 11 months ago
Dynamic Software Architecture Slicing
As the complexity of software systems increases, so need for a good mechanism of abstraction. architecture design is an abstraction, hiding an immense amount of details about the ...
Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T....
COLT
1999
Springer
13 years 11 months ago
On a Generalized Notion of Mistake Bounds
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
Sanjay Jain, Arun Sharma
IDA
1999
Springer
13 years 11 months ago
Reasoning about Input-Output Modeling of Dynamical Systems
The goal of input-output modeling is to apply a test input to a system, analyze the results, and learn something useful from the causeeffect pair. Any automated modeling tool that...
Matthew Easley, Elizabeth Bradley