Thread algebra and risk assessment services

Threads as contained in a thread algebra emerge from the behavioral abstraction from programs in an appropriate program algebra. Threads may makeion from programs in an appropriate program algebra. Threads may make use of services such as stacks, and a thread using a single stack is called a pushdown thread. Equivalence of pushdown threads is decidable. Using this decidability result, an alternative to Cohen’s impossibility result on virus detection is discussed and some results on risk assessment services are proved. §

[1]  Géraud Sénizergues,et al.  L(A) = L(B)? Decidability Results from Complete Formal Systems , 2002, ICALP.

[2]  C. Stirling.  Decidability of Bisimulation Equivalence for Pushdown Processes , 2000 .

[3]  Jan A. Bergstra,et al.  Decision problems for pushdown threads , 2007, Acta Informatica.

[4]  Sheila A. Greibach,et al.  Theory of Program Structures: Schemes, Semantics, Verification , 1976, Lecture Notes in Computer Science.

[5]  Jan A. Bergstra,et al.  A Thread Algebra with Multi-level Strategic Interleaving , 2005, CiE.

[6]  Faron Moller,et al.  Simulation Problems for One-Counter Machines , 1999, SOFSEM.

[7]  Jan A. Bergstra,et al.  Program algebra for sequential code , 2002, J. Log. Algebraic Methods Program..

[8]  Jan A. Bergstra,et al.  Polarized Process Algebra and Program Equivalence , 2003, ICALP.

[9]  Fred Cohen,et al.  Computer viruses—theory and experiments , 1990 .

[10]  Jan A. Bergstra,et al.  Combining programs and state machines , 2002, J. Log. Algebraic Methods Program..

[11]  J. W. de Bakker,et al.  Processes and the Denotational Semantics of Concurrency , 1982, Inf. Control..

[12]  Bernhard Steffen,et al.  Pushdown Processes: Parallel Composition and Model Checking , 1994, CONCUR.

[13]  Colin Stirling,et al.  Decidability of bisimulation equivalence for normed pushdown processes , 1998, SIGA.

[14]  Colin Stirling,et al.  Decidability of DPDA equivalence , 2001, Theor. Comput. Sci..

[15]  Géraud Sénizergues,et al.  L(a) = L(b)? , 1997, INFINITY.

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

[17]  Jan A. Bergstra,et al.  Execution architectures for program algebra , 2004, J. Appl. Log..

[18]  Zohar Manna,et al.  Mathematical Theory of Computation , 2003 .