Towards Formal Verification of ToolBusScripts

ToolBus allows one to connect tools via a software bus. Programming is done using the scripting language Tscript , which is based on the process algebra ACP. Tscript was originally designed to enable formal verification, but this option has so far not been explored in any detail. We present a method for analyzing a Tscript by translating it to the process algebraic language mCRL2, and then applying model checking to verify behavioral properties.

[1]  Jianjun Zhao,et al.  Pipa: A Behavioral Interface Specification Language for AspectJ , 2003, FASE.

[2]  Bob Diertens.  Simulation and Animation of Process Algebra Specifications , 1997 .

[3]  Jan A. Bergstra,et al.  The TOOLBUS Coordination Architecture , 1996, COORDINATION.

[4]  Jan A. Bergstra,et al.  Module algebra , 1990, JACM.

[5]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[6]  Wan Fokkink,et al.  Refinement and Verification Applied to an In-Flight Data Acquisition Unit , 2002, CONCUR.

[7]  P. Klint,et al.  Efficient annotated terms , 2000 .

[8]  Arie van Deursen,et al.  The Asf+Sdf Meta-Environment: a Component-Based Language Development Environment , 2001, LDTA@ETAPS.

[9]  Rajeev Alur,et al.  Timed Automata , 1999, CAV.

[10]  Wolfgang Polak,et al.  Formal Verification of Ada Programs , 1990, IEEE Trans. Software Eng..

[11]  Arie van Deursen,et al.  The ASF+SDF Meta-environment: A Component-Based Language Development Environment , 2001 .

[12]  Jaco van de Pol,et al.  An Abstract Interpretation Toolkit for muCRL , 2005, Electron. Notes Theor. Comput. Sci..

[13]  Jørgen Lindskov Knudsen.  ECOOP 2001 — Object-Oriented Programming , 2001, Lecture Notes in Computer Science.

[14]  Paul Klint.  A Meta-Environment for Generating Programming Environments , 1989, Algebraic Methods.

[15]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[16]  Chris Hankin,et al.  Coordinatio Languages and Models , 2002, Lecture Notes in Computer Science.

[17]  Natalia Sidorova,et al.  Timed Verification with µCRL , 2003, Ershov Memorial Conference.

[18]  Perdita Stevens,et al.  Modelling Recursive Calls with UML State Diagrams , 2003, FASE.

[19]  Manfred Broy,et al.  Perspectives of System Informatics , 2001, Lecture Notes in Computer Science.

[20]  Anton Wijs.  Achieving Discrete Relative Timing with Untimed Process Algebra , 2007, 12th IEEE International Conference on Engineering Complex Computer Systems (ICECCS 2007).

[21]  Jaco van de Pol,et al.  An abstract interpretation toolkit for μCRL , 2005, Formal Methods Syst. Des..

[22]  Jan Friso Groote,et al.  Time abstraction in timed /spl mu/CRL a la regions , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[23]  Jan Friso Groote,et al.  The Formal Specification Language mCRL2 , 2006, MMOSS.

[24]  Jeannette M. Wing.  Writing Larch interface language specifications , 1987, TOPL.

[25]  Radu Mateescu,et al.  CADP 2006: A Toolbox for the Construction and Analysis of Distributed Processes , 2007, CAV.

[26]  Jan Friso Groote,et al.  Time abstraction in timed µCRL à la regions , 2006 .

[27]  Daniel Larsson,et al.  Formal Verification of Fault Tolerance Aspects , 2005 .

[28]  William G. Griswold,et al.  An Overview of AspectJ , 2001, ECOOP.

[29]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[30]  Jan A. Bergstra,et al.  The Discrete Time TOOLBUS - A Software Coordination Architecture , 1998, Science of Computer Programming.

[31]  Bob Diertens.  Software (Re-)Engineering with PSF III: an IDE for PSF , 2007, ArXiv.