Sciweavers

SIGSOFT
2002
ACM
15 years 1 months ago
Isolating cause-effect chains from computer programs
Consider the execution of a failing program as a sequence of program states. Each state induces the following state, up to the failure. Which variables and values of a program sta...
Andreas Zeller
SIGSOFT
2002
ACM
15 years 1 months ago
Using redundancies to find errors
This paper explores the idea that redundant operations, like type errors, commonly flag correctness errors. We experimentally test this idea by writing and applying four redundanc...
Yichen Xie, Dawson R. Engler
SIGSOFT
2002
ACM
15 years 1 months ago
Secure systems development based on the common criteria: the PalME project
Security is a very important issue in information processing, especially in open network environments like the Internet. The Common Criteria (CC) is the standard requirements cata...
Monika Vetterling, Guido Wimmel, Alexander K. Wi&s...
SIGSOFT
2002
ACM
15 years 1 months ago
Negative scenarios for implied scenario elicitation
Scenario-based specifications such as Message Sequence Charts (MSCs) are popular for requirement elicitation and specification. MSCs describe two distinct aspects of a system: on ...
Sebastián Uchitel, Jeff Kramer, Jeff Magee
SIGSOFT
2002
ACM
15 years 1 months ago
Triggered message sequence charts
Bikram Sengupta, Rance Cleaveland
SIGSOFT
2002
ACM
15 years 1 months ago
Composable semantics for model-based notations
We propose a unifying framework for model-based specification notations. Our framework captures the execution semantics that are common among model-based notations, and leaves the...
Jianwei Niu, Joanne M. Atlee, Nancy A. Day
SIGSOFT
2002
ACM
15 years 1 months ago
Invariant inference for static checking
Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effec...
Jeremy W. Nimmer, Michael D. Ernst
SIGSOFT
2002
ACM
15 years 1 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...