Sciweavers

2786 search results - page 308 / 558
» A Practical Technique for Process Abstraction
Sort
View
PEPM
1993
ACM
15 years 10 months ago
Tutorial on Specialisation of Logic Programs
In this tutorial the specialisation of declarative logic programs is presented. The main correctness results are given, and the outline of a basic algorithm for partial evaluation...
John P. Gallagher
CAV
2007
Springer
164views Hardware» more  CAV 2007»
15 years 10 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
CP
2007
Springer
15 years 10 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
AMAST
2006
Springer
15 years 10 months ago
State Space Reduction of Rewrite Theories Using Invisible Transitions
Abstract. State space explosion is the hardest challenge to the effective application of model checking methods. We present a new technique for achieving drastic state space reduct...
Azadeh Farzan, José Meseguer
ASWC
2006
Springer
15 years 10 months ago
Partition-Based Block Matching of Large Class Hierarchies
Abstract. Ontology matching is a crucial task of enabling interoperation between Web applications using different but related ontologies. Due to the size and the monolithic nature,...
Wei Hu, Yuanyuan Zhao, Yuzhong Qu