From: Jordan Rose
There is an existing implementation of this, but it's not complete and is disabled in the analyzer. - (Difficulty: Medium)
+ (Difficulty: Medium; current contact: Alex McCarthy)Currently exceptions are treated as "black holes", and exception-handling @@ -70,7 +70,7 @@ mailing list to notify other members of the community.
(operator new
), then initialize the result with a constructor
call. The problem is discussed at length in
PR12014.
- (Difficulty: Easy)
+ (Difficulty: Easy; current contact: Karthik Bhat)
delete
more precisely.
Similarly, the representation of delete
does not include
@@ -78,7 +78,14 @@ mailing list to notify other members of the community.
operator delete
). One particular issue
(noreturn destructors) is discussed in
PR15599
- (Difficulty: Easy)
+ (Difficulty: Easy; current contact: Karthik Bhat)
+
+ Constraints on the bits of an integer are not easily representable as + ranges. A bitwise constraint manager would model constraints such as "bit 32 + is known to be 1". This would help code that made use of bitmasks. + (Difficulty: Medium)
+The DynamicTypePropagation checker is in charge of inferring a region's @@ -107,14 +114,6 @@ mailing list to notify other members of the community.
display such paths in HTML output. (Difficulty: Medium)We need to come up with an API which will relate bug reports - to the checkers that produce them and refactor the existing code to use the - new API. This would allow us to identify the checker from the bug report, - which paves the way for selective control of certain checks. - (Difficulty: Easy-Medium)
-It would be great to have more code reuse between "Minimal" and "Extensive" PathDiagnostic generation algorithms. One idea is to create an @@ -182,7 +181,7 @@ mailing list to notify other members of the community.
Take a look at the CP-Miner paper for inspiration. - (Difficulty: Medium-Hard)
+ (Difficulty: Medium-Hard; current contacts: Per Viberg and Daniel Fahlgren)