History for Dynamic Analysis Roadmap
changed: -specification happens as part of the program. Hence execution effeciency suddenly becomes specification happens as part of the program. Hence execution efficiency suddenly becomes changed: -invariants, and more temporal logics such as future and past time temporal logics, invariants, to more temporal logics such as future and past time temporal logics, changed: -Different logics have advantages and disadvantages wrt. expressivety and monitoring efficency, and the goal is to find the choices that optimize both. For example, a propositional temporal logic (without data) is more efficient to monitor than a -quantified temporal logics that can refer to data values, but the latter is much more Different logics have advantages and disadvantages wrt. expressiveness and monitoring efficiency, and the goal is to find the choices that optimize both. For example, a propositional temporal logic (without data) is more efficient to monitor than a quantified temporal logic that can refer to data values, but the latter is much more changed: -to be instrumented, either manually or autmatically. Several automated program instrumentation systems have seen the light of day over the last 5 years, some working to be instrumented, either manually or automatically. Several automated program instrumentation systems have seen the light of day over the last 5-10 years, some working changed: -and each property refers to a set of predicates, the specification must also state how these predicates relate to the code. A recent development in this direction is seen within -the aspect oriented programming community, where poincut lannguages are being extended with trace predicates, in the form of for example temporal logic, regular expressions, grammars or state machines. and each property refers to a set of predicates, the specification must also state how these predicates relate to the code. A recent development in this direction is seen within the aspect oriented programming community, where pointcut languages are being extended with trace predicates, in the form of for example temporal logic, regular expressions, grammars or state machines. changed: -can be generalized to more sopihisticated forms of fault protection, where a can be generalized to more sophisticated forms of fault protection, where a changed: -absence or precence. absence or precence. Such algroithms usually do not require the user to provide a specification. changed: -can then provide a respresentation of behavior observed<b>"so far"</b>. can then provide a respresentation of behavior observed<i>"so far"</i>. changed: -goal is the same: to use static analysis reason about the relationship between goal is the same: to use static analysis to reason about the relationship between changed: -We intend to create an initial group of scientists interested in this subject. This group will discuss the details of the future plan and will collaborate to create a system over the next 5 yeaars. The group will initially consist of around 10 people but is open to all that are interested. See contact information below and contact us in case you are interested. We intend to create an initial group of scientists interested in this subject. This group will discuss the details of the future plan and will collaborate to create a system over the next 5 years. By trying to build a system over the next 5 years, it will be possible to correct and improve the rersults in the following 10 years (out of a 15 year total time horizon). The group will initially consist of around 10 people but is open to all that are interested. See contact information below and contact us in case you are interested. changed: -In order to make collacoration possible, we plan to focus on runtime verification techniques for the Java programming language. However, this decision might appear to be too limiting. We plan to to set up infra structure for instrumenting code. This infra structure can then be used for extracting execution traces from program runs. The infra structure can be used to support a competition between various runtime verification technologies. It is intended to collaborate with the aspect oriented programming community that has started such an effort withing the AOP community. In order to make collacoration possible, we plan to focus on runtime verification techniques for the Java programming language. However, this decision might appear to be too limiting. We plan to to set up infra structure for instrumenting code. This infra structure can then be used for extracting execution traces from program runs. The infra structure can be used to support a competition between various runtime verification technologies. It is intended to collaborate with the aspect oriented programming community. changed: -<br><br> -The RV website : http://www.runtime-verification.org - The Runtime Verification website : http://www.runtime-verification.org