Timeline for Automatic Realtime Cycle Detection of function calls
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 25, 2017 at 21:39 | vote | accept | Hangman4358 | ||
| Apr 20, 2017 at 12:52 | answer | added | user82096 | timeline score: 1 | |
| Jan 26, 2017 at 11:02 | history | tweeted | twitter.com/StackSoftEng/status/824573285077811200 | ||
| Jan 26, 2017 at 5:52 | comment | added | Frank Hileman | This type of cycle detection or avoidance should be built into the rules environment. It has all the information needed to detect cycles internally. | |
| Jan 26, 2017 at 5:48 | comment | added | Claude | Do you know which input combinations cause infinite loops? If yes you could block processing at all. | |
| Jan 26, 2017 at 5:45 | comment | added | Claude | What about an own timer thread which cancels the rule thread after it is reasonable? | |
| Jan 24, 2017 at 22:45 | comment | added | Hangman4358 | @Doval do you mean the actual Java stack or the number of calls to rules? When a loop occurs, it usually occurs with some set of rules firing repeatedly without ever hitting a Java stack limit, in those cases we will just time out. But we want to be able to detect the loops before we time out since timing out can take a long time. | |
| Jan 24, 2017 at 21:35 | comment | added | Doval | Is there a reason you can't keep track of the stack depth and abort after it goes deep enough? | |
| Jan 24, 2017 at 20:34 | history | edited | Robert Harvey | CC BY-SA 3.0 |
deleted 6 characters in body
|
| Jan 24, 2017 at 20:25 | history | edited | Hangman4358 | CC BY-SA 3.0 |
added 500 characters in body
|
| Jan 24, 2017 at 20:18 | comment | added | Hangman4358 | Language is Java, the logic is in Drools. We have event listeners that capture all rules that fire and these have access to the facts that were associated with the rules firing | |
| Jan 24, 2017 at 18:50 | comment | added | user22815 | What language? Also keep in mind that some cycles might be valid recursive calls. The key is determining if there is an end condition that eventually prevents future recursion, i.e. stopping an infinite cycle. | |
| Jan 24, 2017 at 18:49 | history | edited | user22815 | CC BY-SA 3.0 |
deleted 1 character in body
|
| Jan 24, 2017 at 18:24 | review | First posts | |||
| Jan 25, 2017 at 9:14 | |||||
| Jan 24, 2017 at 18:23 | history | asked | Hangman4358 | CC BY-SA 3.0 |