Sciweavers

4940 search results - page 528 / 988
» On the Complexity of Universal Programs
Sort
View
ICSE
2003
IEEE-ACM
16 years 7 months ago
Modular Verification of Software Components in C
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
Sagar Chaki, Edmund M. Clarke, Alex Groce, Somesh ...
CC
2010
Springer
243views System Software» more  CC 2010»
16 years 1 months ago
Optimizing Matlab through Just-In-Time Specialization
Abstract. Scientists are increasingly using dynamic programming languages like Matlab for prototyping and implementation. Effectively compiling Matlab raises many challenges due t...
Maxime Chevalier-Boisvert, Laurie J. Hendren, Clar...
WEA
2010
Springer
241views Algorithms» more  WEA 2010»
16 years 1 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...
ACG
2009
Springer
16 years 1 months ago
Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K
Retrograde analysis is a tool for reconstructing a game tree starting from its leaves; with these techniques one can solve specific subsets of a complex game, achieving optimal pl...
Paolo Ciancarini, Gian Piero Favini
CPAIOR
2009
Springer
16 years 1 months ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...