2488 search results - page 299 / 498 » An improvement in formal verification |
116
click to vote
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
123
click to vote
DASFAA
2008
IEEE
15 years 3 months ago
2008
IEEE
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
104
Voted
ECSA
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Architectural description languages are a useful tool for modmplex software systems at a high level of abstraction and, if based on formal methods, for enabling the early...
149
click to vote
EMSOFT
2008
Springer
15 years 3 months ago
2008
Springer
Runtime property checking (as implemented in tools like Purify or Valgrind) checks whether a program execution satisfies a property. Active property checking extends runtime check...
100
click to vote
FASE
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. The notion of feature is heavily used in Software Engineering, especially for software product lines. However, this notion appears to be confusing, mixing various aspects...