219 search results - page 21 / 44 » Dynamic partial-order reduction for model checking software |
117
click to vote
KBSE
2007
IEEE
15 years 9 months ago
2007
IEEE
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. ...
121
click to vote
ICFEM
2009
Springer
15 years 9 months ago
2009
Springer
Fault-tolerant (FT) distributed protocols (such as group membership, consensus, etc.) represent fundamental building blocks for many practical systems, e.g., the Google File System...
128
click to vote
AOSD
2004
ACM
15 years 8 months ago
2004
ACM
A widespread implementation approach for the join point mechanism of aspect-oriented languages is to instrument areas in code that match the static part of pointcut designators, i...
117
click to vote
TASE
2008
IEEE
15 years 9 months ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
113
click to vote
ICTCS
2003
Springer
15 years 8 months ago
2003
Springer
We define a calculus for modeling dynamic linking independently of the details of a particular programming environment. The calculus distinguishes at the language level the notion...