Sciweavers

1291 search results - page 141 / 259
» Arithmetic program paths
Sort
View
ESORICS
2012
Springer
12 years 12 days ago
Boosting the Permissiveness of Dynamic Information-Flow Tracking by Testing
Tracking information flow in dynamic languages remains an open challenge. It might seem natural to address the challenge by runtime monitoring. However, there are well-known funda...
Arnar Birgisson, Daniel Hedin, Andrei Sabelfeld
INTERSENSE
2006
ACM
14 years 4 months ago
Programming wireless sensor networks with logical neighborhoods
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
Luca Mottola, Gian Pietro Picco
KBSE
2007
IEEE
14 years 4 months ago
Test suite reduction and prioritization with call trees
This paper presents a tool that (i) constructs tree-based models of a program’s behavior during testing and (ii) employs these trees while reordering and reducing a test suite. ...
Adam M. Smith, Joshua Geiger, Gregory M. Kapfhamme...
ISSTA
2006
ACM
14 years 4 months ago
Path-oriented random testing
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
Arnaud Gotlieb, Matthieu Petit
ISBRA
2009
Springer
14 years 4 months ago
Querying Protein-Protein Interaction Networks
Recent techniques increase the amount of our knowledge of interactions between proteins. To filter, interpret and organize this data, many authors have provided tools for querying...
Guillaume Blin, Florian Sikora, Stéphane Vi...