Sciweavers

49 search results - page 3 / 10
» From the Past to the Future: Executing Temporal Logic Progra...
Sort
View
OPODIS
2003
13 years 7 months ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg
ENTCS
2002
143views more  ENTCS 2002»
13 years 6 months ago
Collecting Statistics over Runtime Executions
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
Bernd Finkbeiner, Sriram Sankaranarayanan, Henny S...
DYNAMO
2000
87views more  DYNAMO 2000»
13 years 7 months ago
Overcoming the Challenges to Feedback-Directed Optimization
Feedback-directed optimization (FDO) is a general term used to describe any technique that alters a program's execution based on tendencies observed in its present or past ru...
Michael D. Smith
FM
2003
Springer
174views Formal Methods» more  FM 2003»
13 years 11 months ago
Model-Checking TRIO Specifications in SPIN
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
Angelo Morzenti, Matteo Pradella, Pierluigi San Pi...
CONCUR
2010
Springer
13 years 7 months ago
Reasoning about Optimistic Concurrency Using a Program Logic for History
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, Yu Zhang