Sciweavers

2632 search results - page 269 / 527
» Alternating Timed Automata
Sort
View
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
15 years 9 months ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke
KR
1991
Springer
15 years 7 months ago
Meta-Reasoning in Executable Temporal Logic
Temporal logic can be used as a programming language. If temporal formulae are represented in the form of an implication where the antecedent refers to the past, and the consequen...
Howard Barringer, Michael Fisher, Dov M. Gabbay, A...
WWW
2009
ACM
16 years 4 months ago
Automated construction of web accessibility models from transaction click-streams
Screen readers, the dominant assistive technology used by visually impaired people to access the Web, function by speaking out the content of the screen serially. Using screen rea...
Jalal Mahmud, Yevgen Borodin, I. V. Ramakrishnan, ...
FOSSACS
2009
Springer
15 years 10 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
ISSTA
2009
ACM
15 years 10 months ago
AVA: automated interpretation of dynamically detected anomalies
Dynamic analysis techniques have been extensively adopted to discover causes of observed failures. In particular, anomaly detection techniques can infer behavioral models from obs...
Anton Babenko, Leonardo Mariani, Fabrizio Pastore