Sciweavers

1176 search results - page 58 / 236
» Implicit Abstraction Heuristics
Sort
View
SPIN
2000
Springer
15 years 4 months ago
Symmetric Spin
Abstract. We give a detailed description of SymmSpin, a symmetryreduction package for Spin. It o ers four strategies for state-space reduction, based on the heuristic that we prese...
Dragan Bosnacki, Dennis Dams, Leszek Holenderski
WAE
2000
103views Algorithms» more  WAE 2000»
15 years 1 months ago
Lattice Basis Reduction with Dynamic Approximation
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
Werner Backes, Susanne Wetzel
81
Voted
RTA
2000
Springer
15 years 4 months ago
Linear Higher-Order Matching Is NP-Complete
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
Philippe de Groote
FORMATS
2004
Springer
15 years 5 months ago
Lazy Approximation for Dense Real-Time Systems
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
Maria Sorea
CAV
1998
Springer
138views Hardware» more  CAV 1998»
15 years 4 months ago
Model Checking for a First-Order Temporal Logic Using Multiway Decision Graphs
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...
Ying Xu, Eduard Cerny, Xiaoyu Song, Francisco Core...