The MEB and CEB Static Analysis for CSP Specifications

Leuschel, Michaël; Llorens, Marisa; Oliver, Javier; Silva, Josep; Tamarit, Salvador

doi:10.1007/978-3-642-00515-2_8

Cited by 7 publications

(7 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1. The CSCFG was proposed in [7,9] as a data structure able to finitely represent all possible (often infinite) computations of a CSP specification. This data structure is particularly useful to simplify a CSP specification before its static analysis.…”

Section: The Syntax and Semantics Of Cspmentioning

confidence: 99%

“…In this graph we have that Con(4) = {0, 3}, i.e., b is being executed after having called processes MAIN and P. Note that focussing on a process call node we can use the context to identify loops; i.e., we have a loop whenever n ∈ Con(m) with l(n) = l(m) ∈ N ames. Note also that the CSCFG is unique for a given CSP specification [9].…”

Section: Definitionmentioning

confidence: 99%

“…This data structure is a graph that allows us to finitely represent possibly infinite computations, and it is particularly interesting because it takes into account the context of process calls, and thus it allows us to produce analyses that are very precise. In particular, some analyses (see, e.g., [8,9]) use the CSCFG to simplify a specification with respect to some term by discarding those parts of the specification that cannot be executed before the term and thus they cannot influence it. This simplification is automatic and thus it is very useful as a preprocessing stage of other analyses.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Graph Generation to Statically Represent CSP Processes

Llorens

Oliver

Silva

et al. 2011

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

Abstract. The CSP language allows the specification and verification of complex concurrent systems. Many analyses for CSP exist that have been successfully applied in different industrial projects. However, the cost of the analyses performed is usually very high, and sometimes prohibitive, due to the complexity imposed by the non-deterministic execution order of processes and to the restrictions imposed on this order by synchronizations. In this work, we define a data structure that allows us to statically simplify a specification before the analyses. This simplification can drastically reduce the time needed by many CSP analyses. We also introduce an algorithm able to automatically generate this data structure from a CSP specification. The algorithm has been proved correct and its implementation for the CSP's animator ProB is publicly available.

show abstract

Section: The Syntax and Semantics Of Cspmentioning

confidence: 99%

Section: Definitionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Graph Generation to Statically Represent CSP Processes

Llorens

Oliver

Silva

et al. 2011

Logic-Based Program Synthesis and Transformation

Self Cite

View full text Add to dashboard Cite

show abstract

“…Leuschel et al [19] apply slicing to CSP models and Brückner and Wehrheim [20] investigate models written in CSP-OZ-DC, a language that combines Communicating Sequential Processes, Object-Z and Duration Calculus. Each of these approaches caters for the intricacies of the given modelling language.…”

Section: Introductionmentioning

confidence: 99%

Slicing Behavior Tree Models for Verification

Yatapanage

Winter

Zafar

2010

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Abstract. Program slicing is a reduction technique that removes irrelevant parts of a program automatically, based on dependencies. It is used in the context of documentation to improve the user's understanding as well as for reducing the size of a program when analysing. In this paper we describe an approach for slicing not program code but models of software or systems written in the graphical Behavior Tree language. Our focus is to utilise this reduction technique when model checking Behavior Tree models. Model checking as a fully automated analysis technique is restricted in the size of the model and slicing provides one means to improve on the inherent limitations. We present a Health Information System as a case study. The full model of the system could not be verified due to memory limits. However, our slicing algorithm renders the model to a size for which the model checker terminates. The results nicely demonstrate and quantify the benefits of our approach.

show abstract

“…Other publications of the author related with this thesis are [54,55,62,61], but those works are somehow subsumed by the papers considered here. Additionally, the author have other important publications not included in this thesis because they were not related to the main topic of the thesis.…”

Section: Future Workmentioning

confidence: 99%

Analysis Techniques for Concurrent Programming Languages

Muñoz¹

View full text Add to dashboard Cite

A mi abuelito Salvador, tus primeras sumas fueron el inicio de mi camino. iii iv AbstractConcurrent languages are increasingly present in our society, both in new technologies and in the systems used on a daily basis. Moreover, given the current systems distribution and their internal architecture, one can expect that this remains so in the coming years. In this context, the development of tools to support the implementation of concurrent programs becomes essential. Futhermore, the behavior of concurrent systems is particularly difficult to analyse, so that any tool that helps in this task, even if in a limited way, will be very useful. For example, one can find tools for debugging, analysis, testing, optimisation, or simplification of programs, which are widely used by programmers nowadays.The purpose of this thesis is to introduce, through various concurrent programming languages, some analysis techniques that can help to improve the experience of the software development and release for concurrent models. This thesis introduces both static (approximating all possible executions) and dynamic (considering a specific execution) analysis. The topics considered here differ enough from each other to be fully independent. Nevertheless, they have a common link: they can be used to analyse properties of a concurrent programming language. All the analyses presented here have been formally defined and their correctness have been proved, ensuring that the results will have the reliability degree which is needed for some systems (for instance, for critical systems). It also includes a description of the software tools that implement the different ideas proposed. This gives the work a usefulness well beyond the theoretical aspect, allowing us to put it in practice and to test the different analyses with real-world examples. v All the ideas here presented are, by themselves, approaches that can be applied in many current contexts and problems. Moreover, individually they serve as a starting point for other derived analysis, as well as for the adaptation to other languages of the same family. This gives an added value to this work, a fact confirmed by some later works that are already benefiting from the results obtained in this thesis. vi ResumenLos lenguajes concurrentes están cada día más presentes en nuestra sociedad, tanto en las nuevas tecnologías como en los sistemas utilizados de manera cotidiana. Más aún, dada la actual distribución de los sistemas y su arquitectura interna, cabe esperar que este hecho siga siendo una realidad en los próximos años. En este contexto, el desarrollo de herramientas de apoyo a la implementación de programas concurrentes se vuelve esencial. Además, el comportamiento de los sistemas concurrentes es especialmente difícil de analizar, por lo que cualquier herramienta que ayude en esta tarea, aún cuando sea limitada, será de gran utilidad. Por ejemplo, podemos encontrar herramientas para la depuración, análisis, comprobación, optimización, o simplificación de programas. Muchas de ellas son a...

show abstract

The MEB and CEB Static Analysis for CSP Specifications

Cited by 7 publications

References 22 publications

Graph Generation to Statically Represent CSP Processes

Graph Generation to Statically Represent CSP Processes

Slicing Behavior Tree Models for Verification

Analysis Techniques for Concurrent Programming Languages

Contact Info

Product

Resources

About