50 search results - page 4 / 10 » Temporal Logic with Predicate lambda-Abstraction |
SIGSOFT
2005
ACM
15 years 10 months ago
2005
ACM
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
63
Voted
ECSQARU
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...
90
Voted
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
86
Voted
SIGSOFT
2003
ACM
15 years 2 months ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
77
Voted
FORMATS
2008
Springer
14 years 11 months ago
2008
Springer
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...