66 search results - page 3 / 14 » Reachability Analysis of Process Rewrite Systems |
RTA
2007
Springer
14 years 10 days ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
ENTCS
2007
13 years 6 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
SPIN
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
CMSB
2009
Springer
14 years 24 days ago
2009
Springer
Abstract. In this paper we describe reachability computation for continuous and hybrid systems and its potential contribution to the process of building and debugging biological mo...
FSTTCS
2005
Springer
13 years 11 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...