Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
Abstract. Action-probabilistic logic programs (ap-programs), a class of probabilistic logic programs, have been applied during the last few years for modeling behaviors of entities...
Gerardo I. Simari, John P. Dickerson, V. S. Subrah...
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan,...
We describe an algorithm to build a graphical model—more precisely: a join tree representation of a Markov network—for a steady state analog electrical circuit. This model can ...
Reasoning about object-oriented programs is hard, due to , dynamic binding and the need for data abstraction and framing. Reasoning about concurrent object-oriented programs is eve...