Selected papers of the Second Workshop on Concurrency and compositionality
The Vision of Autonomic Computing
Computer
Towards "Chemical" Desktop Grids
E-SCIENCE '07 Proceedings of the Third IEEE International Conference on e-Science and Grid Computing
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A Rewriting Calculus for Multigraphs with Ports
Electronic Notes in Theoretical Computer Science (ENTCS)
A Higher-Order Graph Calculus for Autonomic Computing
Graph Theory, Computational Intelligence and Thought
A Port Graph Calculus for Autonomic Computing and Invariant Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Monitoring of real-time properties
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Higher-Order chemical programming style
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
| Hi-index | 0.00 |
The biochemical paradigm is well-suited for modelling autonomous systems and new programming languages are emerging from this approach. However, in order to validate such programs, we need to define precisely their semantics and to provide verification techniques. In this paper, we consider a higher-order biochemical calculus that models the structure of system states and its dynamics thanks to rewriting abstractions, namely rules and strategies. We extend this calculus with a runtime verification technique in order to perform automatic discovery of property satisfaction failure. The property specification language is a subclass of LTL safety and liveness properties.