Sciweavers

3359 search results - page 420 / 672
» A Simplified Idea Algorithm
Sort
View
SIGSOFT
2003
ACM
16 years 1 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...
WWW
2008
ACM
16 years 1 months ago
Wishful search: interactive composition of data mashups
With the emergence of Yahoo Pipes and several similar services, data mashup tools have started to gain interest of business users. Making these tools simple and accessible to user...
Anton Riabov, Eric Bouillet, Mark Feblowitz, Zhen ...
103
Voted
WWW
2007
ACM
16 years 1 months ago
Semi-automated adaptation of service interactions
In today's Web, many functionality-wise similar Web services are offered through heterogeneous interfaces (operation definitions) and business protocols (ordering constraints...
Hamid R. Motahari Nezhad, Boualem Benatallah, Axel...
PLDI
2009
ACM
16 years 1 months ago
Semantics-aware trace analysis
As computer systems continue to become more powerful and comdo programs. High-level abstractions introduced to deal with complexity in large programs, while simplifying human reas...
Kevin J. Hoffman, Patrick Eugster, Suresh Jagannat...
POPL
2004
ACM
16 years 26 days ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford