Download PDFOpen PDF in browser

Automated Reasoning in the Simulation of Evolvable Systems

11 pagesPublished: May 16, 2012


We present a novel application of automated theorem proving for the simulation of computational systems. The computational systems we consider are evolvable, i.e. may reconfigure their structure and programs at run-time. In [1], a logical framework for describing such systems is introduced. The underlying logic of this framework allows us to build a simulation engine for executing system specifications. This engine makes intensive use of automated theorem proving – when running a simulation, almost all computational steps are those of a theorem prover. In this paper, we present this novel combination of a logical setting involving meta-level logics and large sets of formulae for system description, together with theorem proving requirements which involve often slowly changing specifications with the need for rapid assessment of deducibility and consistency. We will evaluate the suitability of several theorem provers for this application.

Keyphrases: automated reasoning, component systems, Evolvable systems

In: Renate A. Schmidt, Stephan Schulz and Boris Konev (editors). PAAR-2010: Proceedings of the 2nd Workshop on Practical Aspects of Automated Reasoning, vol 9, pages 11--21

Download PDFOpen PDF in browser