Sciweavers

971 search results - page 41 / 195
» Approximate Satisfiability and Equivalence
Sort
View
OA
1989
237views Algorithms» more  OA 1989»
14 years 1 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
SIGSOFT
2009
ACM
14 years 10 months ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang
TCS
2010
13 years 8 months ago
Contract-based discovery of Web services modulo simple orchestrators
Web services are distributed processes with a public description of their behavior, or contract. The availability of repositories of Web service descriptions enables interesting f...
Luca Padovani
AAAI
1992
13 years 11 months ago
Causal Approximations
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
P. Pandurang Nayak
CORR
2011
Springer
195views Education» more  CORR 2011»
13 years 4 months ago
Abstract Processes of Place/Transition Systems
Processes of Place/Transition Systems6 Rob van Glabbeeka,b , Ursula Goltzc , Jens-Wolfhard Schickec aNICTA, Sydney, Australia bSchool of Computer Science and Engineering, Universit...
Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard S...