Sciweavers

715 search results - page 8 / 143
» Automatic Programming for Sequence Control
Sort
View
HYBRID
2010
Springer
15 years 4 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan
164
Voted
MICRO
2012
IEEE
285views Hardware» more  MICRO 2012»
12 years 12 months ago
Automatic Extraction of Coarse-Grained Data-Flow Threads from Imperative Programs
This article presents a general algorithm for transforming sequential imperative programs into parallel data-flow programs. Our algorithm operates on a program dependence graph i...
Feng Li, Antoniu Pop, Albert Cohen
79
Voted
APLAS
2009
ACM
15 years 4 months ago
A Short Cut to Optimal Sequences
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
Akimasa Morihata
170
Voted
ICSE
2012
IEEE-ACM
12 years 12 months ago
Axis: Automatically fixing atomicity violations through solving control constraints
Abstract—Atomicity, a general correctness criterion in concurrency programs, is often violated in real-world applications. The violations are difficult for developers to fix, m...
Peng Liu, Charles Zhang
BMCBI
2006
115views more  BMCBI 2006»
14 years 9 months ago
The accuracy of several multiple sequence alignment programs for proteins
Background: There have been many algorithms and software programs implemented for the inference of multiple sequence alignments of protein and DNA sequences. The "true" ...
Paulo A. S. Nuin, Zhouzhi Wang, Elisabeth R. M. Ti...