126 search results - page 3 / 26 » Pattern-Based Verification for Trees |
FUIN
2010
13 years 1 months ago
2010
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
CONCUR
1998
Springer
13 years 8 months ago
1998
Springer
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...
APLAS
2010
ACM
13 years 4 months ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
EUROPKI
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. A substantial number of micropayment schemes in the literature are based on distributing the cost of a digital signature over several successive micropayments (e.g. Paywo...