Sciweavers

247 search results - page 11 / 50
» A Computational Structure for the Propositional Calculus
Sort
View
MFCS
1998
Springer
13 years 11 months ago
Flow Logic for Imperative Objects
We develop a control flow analysis for the Imperative Object Calculus. We prove the correctness with respect to two Structural Operational Semantics that differ in minor technical ...
Flemming Nielson, Hanne Riis Nielson
FSTTCS
2005
Springer
14 years 28 days ago
Fixpoint Logics on Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
AAAI
1990
13 years 8 months ago
Computing Stable Models by Using the ATMS
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
Kave Eshghi
FORTE
2008
13 years 8 months ago
Checking Correctness of Transactional Behaviors
Abstract. The Signal Calculus is an asynchronous process calculus featuring multicast communication. It relies on explicit modeling of the communication structure of the network (c...
Vincenzo Ciancia, Gian Luigi Ferrari, Roberto Guan...
ENTCS
2007
104views more  ENTCS 2007»
13 years 7 months ago
Exogenous Probabilistic Computation Tree Logic
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,...