Sciweavers

1054 search results - page 10 / 211
» Guarded Expressions in Practice
Sort
View
VL
2002
IEEE
107views Visual Languages» more  VL 2002»
14 years 1 months ago
Reasoning about Many-to-Many Requirement Relationships in Spreadsheets
To help improve the reliability of spreadsheets created by end users, we are working to allow users to communicate the purpose and other underlying information about their spreads...
Laura Beckwith, Margaret M. Burnett, Curtis R. Coo...
JLP
2011
155views more  JLP 2011»
13 years 3 months ago
QoS negotiation in service composition
Service composition in Service Oriented Computing concerns not only integration of heterogeneous distributed applications but also dynamic selection of services. Quality of Servic...
Maria Grazia Buscemi, Ugo Montanari
CONEXT
2007
ACM
14 years 15 days ago
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Michela Becchi, Patrick Crowley
LICS
2009
IEEE
14 years 3 months ago
An Algebra for Kripke Polynomial Coalgebras
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexan...
TRIER
2002
13 years 8 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl