239 search results - page 39 / 48 » Duality for Logics of Transition Systems |
POPL
2011
ACM
12 years 10 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
SAGA
2005
Springer
14 years 29 days ago
2005
Springer
We consider temporal aspects of self-replication and evolvability – in particular, the massively asynchronous parallel and distributed nature of living systems. Formal views of s...
JELIA
1994
Springer
13 years 11 months ago
1994
Springer
: In this paper we describe a general way of formalizing reasoning behaviour. Such a behaviour may be described by all the patterns which are valid for the behaviour. A pattern can...
IEEEHPCS
2010
13 years 6 months ago
2010
Model checking is a formal verification method widely accepted in the web service world because of its capability to reason about service behaviors, at their process-level. It ha...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...