Sciweavers

3653 search results - page 48 / 731
» On Recognizable Timed Languages
Sort
View
GPCE
2009
Springer
14 years 7 months ago
Generating safe template languages
Template languages are widely used within generative programming, because they provide intuitive means to generate software artefacts expressed in a specific object language. Howe...
Florian Heidenreich, Jendrik Johannes, Mirko Seife...
SPAA
2010
ACM
15 years 2 months ago
Brief announcement: serial-parallel reciprocity in dynamic multithreaded languages
In dynamically multithreaded platforms that employ work stealing, there appears to be a fundamental tradeoff between providing provably good time and space bounds and supporting S...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha
ICALP
1997
Springer
15 years 1 months ago
Constructive Linear Time Algorithms for Branchwidth
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
Hans L. Bodlaender, Dimitrios M. Thilikos
FTRTFT
1992
Springer
15 years 1 months ago
Specification and Verification of Real-Time Behaviour Using Z and RTL
Real-Time Logic is a formal notation for reasoning about temporal behaviour. Z is a general purpose specification language, but lacks explicit features for expressing real-time co...
Colin J. Fidge
COCO
2010
Springer
215views Algorithms» more  COCO 2010»
15 years 1 months ago
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata
—We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symm...
Eric Allender, Klaus-Jörn Lange