Sciweavers

308 search results - page 29 / 62
» Making Abstract Domains Condensing
Sort
View
95
Voted
CG
2002
Springer
15 years 2 months ago
Tackling Post's Correspondence Problem
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
Ling Zhao
158
Voted
CASCON
2010
166views Education» more  CASCON 2010»
15 years 16 days ago
Event Exposure for Web Services: A Grey-Box Approach to Compose and Evolve Web Services
Abstract. The service-oriented architecture (SOA) is an emerging software engineering paradigm for developing distributed enterprise applications. In this paradigm, Web services ar...
Chunyang Ye, Hans-Arno Jacobsen
130
Voted
LPAR
2010
Springer
15 years 13 days ago
Speed-Up Techniques for Negation in Grounding
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...
Amir Aavani, Shahab Tasharrofi, Gulay Ünel, E...
130
Voted
EUROSYS
2006
ACM
15 years 11 months ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...
134
Voted
CP
2009
Springer
15 years 9 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...