Sciweavers

4940 search results - page 713 / 988
» On the Complexity of Universal Programs
Sort
View
ICFEM
2010
Springer
15 years 5 months ago
Loop Invariant Synthesis in a Combined Domain
Abstract. Automated verification of memory safety and functional correctness for heap-manipulating programs has been a challenging task, especially when dealing with complex data ...
Shengchao Qin, Guanhua He, Chenguang Luo, Wei-Ngan...
SCHEDULING
2010
116views more  SCHEDULING 2010»
15 years 5 months ago
On supporting Lean methodologies using constraint-based scheduling
Lean Manufacturing often simply referred to as Lean is a process management philosophy that aims to improve the way in which products are manufactured. It does this through ide...
Roman van der Krogt, John Geraghty, Mustafa Ramzi ...
TSD
2010
Springer
15 years 5 months ago
Diagnostics for Debugging Speech Recognition Systems
Modern speech recognition applications are becoming very complex program packages. To understand the error behaviour of the ASR systems, a special diagnosis - a procedure or a tool...
Milos Cernak
SIGSOFT
2010
ACM
15 years 4 months ago
Building scalable software systems in the multicore era
Software systems must face two challenges today: growing complexity and increasing parallelism in the underlying computational models. The problem of increased complexity is often...
Hridesh Rajan
ICOODB
2009
163views Database» more  ICOODB 2009»
15 years 4 months ago
Mapping XSD to OO Schemas
This paper presents algorithms that make it possible to process XML data that conforms to XML Schema (XSD) in a mainstream object-oriented programming language. These algorithms a...
Suad Alagic, Philip A. Bernstein