Sciweavers

293 search results - page 19 / 59
» Reasoning About States of Probabilistic Sequential Programs
Sort
View
KR
1991
Springer
13 years 11 months ago
Meta-Reasoning in Executable Temporal Logic
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
Howard Barringer, Michael Fisher, Dov M. Gabbay, A...
HLPPP
1991
13 years 11 months ago
The Chemical Reaction Model
Gamma was originally proposed in 1986 as a formalism for the de nition of programs without arti cial sequentiality. The basic idea underlying the formalism is to describe computati...
Daniel Le Métayer
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
13 years 11 months ago
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
Sarita V. Adve, Mark D. Hill
QEST
2005
IEEE
14 years 1 months ago
iLTLChecker: A Probabilistic Model Checker for Multiple DTMCs
iLTL is a probabilistic temporal logic that can specify properties of multiple discrete time Markov chains (DTMCs). In this paper, we describe two related tools: MarkovEstimator a...
YoungMin Kwon, Gul A. Agha
FMCAD
2004
Springer
14 years 28 days ago
Proof Styles in Operational Semantics
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
Sandip Ray, J. Strother Moore