475 search results - page 72 / 95 » Temporal Logic Model Checking (Abstract) |
154
click to vote
POPL
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
208
click to vote
FAABS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The design of reactive systems must comply with logical correctness (the system does what it is supposed to do) and timeliness (the system has to satisfy a set of tempora...
170
Voted
KBSE
2005
IEEE
15 years 10 months ago
2005
IEEE
In test generation based on model-checking, white-box test criteria are represented as trap conditions written in a temporal logic. A model checker is used to refute trap conditio...
155
Voted
BIRTHDAY
2010
Springer
15 years 10 months ago
2010
Springer
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
147
click to vote
FSTTCS
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...