2878 search results - page 26 / 576 » Model Checking FTA |
FOSSACS
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper, we reduce pushdown system (PDS) model checking to a graphtheoretic problem, and apply a fast graph algorithm to improve the running time for model checking...
FSTTCS
2000
Springer
13 years 11 months ago
2000
Springer
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound an...
JOT
2008
13 years 7 months ago
2008
We present, in this paper, a framework supporting a formal verification of concurrent UML models using the Maude language. We consider both static and dynamic features of concurre...