Sciweavers

518 search results - page 76 / 104
» Time Window Temporal Logic
Sort
View
CADE
2002
Springer
15 years 12 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
ICCAD
2006
IEEE
130views Hardware» more  ICCAD 2006»
15 years 8 months ago
On bounding the delay of a critical path
Process variations cause different behavior of timingdependent effects across different chips. In this work, we analyze one example of timing-dependent effects, crosscoupling ...
Leonard Lee, Li-C. Wang
CONCUR
2004
Springer
15 years 5 months ago
Characterizing EF and EX Tree Logics
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
Mikolaj Bojanczyk, Igor Walukiewicz
ENTCS
2007
134views more  ENTCS 2007»
14 years 11 months ago
A Compact Linear Translation for Bounded Model Checking
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
Paul B. Jackson, Daniel Sheridan
EMSOFT
2008
Springer
15 years 1 months ago
RTComposer: a framework for real-time components with scheduling interfaces
We present a framework for component-based design and scheduling of real-time embedded software. Each component has a clearly specified interface that includes the methods used fo...
Rajeev Alur, Gera Weiss