Sciweavers

2206 search results - page 355 / 442
» Software Engineering and Modeling Education: Problems and So...
Sort
View
FOSSACS
2009
Springer
16 years 1 months ago
Realizability of Concurrent Recursive Programs
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habe...
FSTTCS
2004
Springer
15 years 11 months ago
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
Ahmed Bouajjani, Antoine Meyer
CHI
1995
ACM
15 years 10 months ago
A Generic Platform for Addressing the Multimodal Challenge
Multimodal interactive systems support multiple interaction techniques such as the synergistic use of speech and direct manipulation. The flexibility they offer results in an incr...
Laurence Nigay, Joëlle Coutaz
CAV
2010
Springer
197views Hardware» more  CAV 2010»
15 years 9 months ago
Abstract Analysis of Symbolic Executions
Analysis of Symbolic Executions Aws Albarghouthi1 , Arie Gurfinkel2 , Ou Wei1,3 , and Marsha Chechik1 1 Department of Computer Science, University of Toronto, Canada 2 Software Eng...
Aws Albarghouthi, Arie Gurfinkel, Ou Wei, Marsha C...
SIAMCOMP
2011
14 years 9 months ago
An Expansion Tester for Bounded Degree Graphs
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
Satyen Kale, C. Seshadhri