Sciweavers

2702 search results - page 377 / 541
» Practically Applicable Formal Methods
Sort
View
97
Voted
ICWS
2008
IEEE
15 years 3 months ago
A Faceted Classification Based Approach to Search and Rank Web APIs
Web application hybrids, popularly known as mashups, are created by integrating services on the Web using their APIs. Support for finding an API is currently provided by generic s...
Karthik Gomadam, Ajith Ranabahu, Meenakshi Nagaraj...
112
Voted
IJFCS
2006
111views more  IJFCS 2006»
15 years 2 months ago
Completeness and realizability: conditions for automatic generation of workflows
In recent years, workflow technology has greatly facilitated business process modeling and reengineering in information systems. On one hand, the separation of an application'...
Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis
CODES
2010
IEEE
15 years 10 days ago
Worst-case performance analysis of synchronous dataflow scenarios
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
Marc Geilen, Sander Stuijk
112
Voted
CAV
2009
Springer
134views Hardware» more  CAV 2009»
16 years 2 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...
IFL
2007
Springer
141views Formal Methods» more  IFL 2007»
15 years 8 months ago
Partial Parsing: Combining Choice with Commitment
Abstract. Parser combinators, often monadic, are a venerable and widelyused solution to read data from some external format. However, the capability to return a partial parse has, ...
Malcolm Wallace