Sciweavers

1187 search results - page 42 / 238
» Graph-Based Procedural Abstraction
Sort
View
CAV
2000
Springer
89views Hardware» more  CAV 2000»
15 years 2 months ago
Tuning SAT Checkers for Bounded Model Checking
Abstract. Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search fo...
Ofer Strichman
APN
1997
Springer
15 years 1 months ago
Verification of Workflow Nets
Abstract. Workflow management systems will change the architecture of future information systems dramatically. The explicit representation of business procedures is one of the main...
Wil M. P. van der Aalst
CONCUR
2010
Springer
14 years 8 months ago
On the Use of Non-deterministic Automata for Presburger Arithmetic
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
Antoine Durand-Gasselin, Peter Habermehl
FSTTCS
2001
Springer
15 years 2 months ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari
FASE
2009
Springer
15 years 4 months ago
Logical Testing
Abstract. Software is often tested with unit tests, in which each procedure is executed in isolation, and its result compared with an expected value. Individual tests correspond to...
Kathryn E. Gray, Alan Mycroft