Topics
The automaticBand
JavaSoftware
The automatic detection of non-termination bugs in programs is an important research topic, especially with regard to safety-critical real-time systems (e.g. software in cars or planes), where non-terminating behaviour may lead to severe consequences. Moreover, in case of the existence of such a bug, for debugging purposes one is interested in the program input that causes it. An approach to this problem (for Java programs) has been developed by the LuFGI2 group.
Developing concurrent software is error prone. Others have cataloged common bug patterns in concurre...
It is important to prove that supposedly terminating programs actually terminate, particularly if th...
Program analysis has a long history in computer science. Even when only considering the important as...
AbstractNon-termination analysis proves that programs, or parts of a program, do not terminate. This...
Non-termination analysis proves that programs, or parts of a program, do not terminate. This is impo...
While termination checking tailored to real-world library code or frameworks has received ever-incre...
While termination checking tailored to real-world library code or frameworks has received ever-incre...
It is important to prove that supposedly terminating programs actuallyterminate, particularly if tho...
Analysing if programs and processes terminate is one of the central topics of theoretical computer s...
AbstractThis paper presents an approach for the automated debugging of reactive and concurrent Java ...
The search for proof and the search for counterexamples (bugs) are complementary activities that nee...
Introduction: The state of the art in termination analysis includes advanced techniques developed fo...
Abstract. Termination analysis has received considerable attention, tra-ditionally in the context of...
Background. Static analyzers can be useful to software developers in detecting and locating code iss...
Contains fulltext : 29857.pdf (publisher's version ) (Open Access)Programs contain...
Developing concurrent software is error prone. Others have cataloged common bug patterns in concurre...
It is important to prove that supposedly terminating programs actually terminate, particularly if th...
Program analysis has a long history in computer science. Even when only considering the important as...
AbstractNon-termination analysis proves that programs, or parts of a program, do not terminate. This...
Non-termination analysis proves that programs, or parts of a program, do not terminate. This is impo...
While termination checking tailored to real-world library code or frameworks has received ever-incre...
While termination checking tailored to real-world library code or frameworks has received ever-incre...
It is important to prove that supposedly terminating programs actuallyterminate, particularly if tho...
Analysing if programs and processes terminate is one of the central topics of theoretical computer s...
AbstractThis paper presents an approach for the automated debugging of reactive and concurrent Java ...
The search for proof and the search for counterexamples (bugs) are complementary activities that nee...
Introduction: The state of the art in termination analysis includes advanced techniques developed fo...
Abstract. Termination analysis has received considerable attention, tra-ditionally in the context of...
Background. Static analyzers can be useful to software developers in detecting and locating code iss...
Contains fulltext : 29857.pdf (publisher's version ) (Open Access)Programs contain...
Developing concurrent software is error prone. Others have cataloged common bug patterns in concurre...
It is important to prove that supposedly terminating programs actually terminate, particularly if th...
Program analysis has a long history in computer science. Even when only considering the important as...
Add to ORKG