Sciweavers

55 search results - page 4 / 11
» Temporal Logic for Proof-Carrying Code
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 8 months ago
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
Stéphane Demri, Alexander Rabinovich
POPL
2002
ACM
14 years 8 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
LPAR
2007
Springer
14 years 2 months ago
The Complexity of Temporal Logic with Until and Since over Ordinals
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
Stéphane Demri, Alexander Rabinovich
FORMATS
2008
Springer
13 years 10 months ago
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
The common metric temporal logics for continuous time were shown to be insufficient, when it was proved in [7, 12] that they cannot express a modality suggested by Pnueli. Moreover...
Alexander Rabinovich
PTS
1998
81views Hardware» more  PTS 1998»
13 years 9 months ago
Testing Temporal Logic Properties in Distributed Systems
Based on the notion of event-based behavioral abstraction EBBA we specify properties of object-oriented distributed systems in linear time temporal logic. These properties are the...
Falk Dietrich, Xavier Logean, Shawn Koppenhoefer, ...