Sciweavers

4880 search results - page 320 / 976
» Manuals as Structured Programs
Sort
View
ICFEM
2010
Springer
15 years 3 months ago
Verifying Heap-Manipulating Programs with Unknown Procedure Calls
Abstract. Verification of programs with invocations to unknown procedures is a practical problem, because in many scenarios not all codes of programs to be verified are available...
Shengchao Qin, Chenguang Luo, Guanhua He, Florin C...
139
Voted
MP
2010
156views more  MP 2010»
15 years 3 months ago
Representing the space of linear programs as the Grassmann manifold
: Each linear program (LP) has an optimal basis. The space of linear programs can be partitioned according to these bases, so called the basis partition. Discovering the structures...
Gongyun Zhao
SCP
2010
154views more  SCP 2010»
15 years 3 months ago
An algebraic foundation for automatic feature-based program synthesis
Feature-Oriented Software Development provides a multitude of formalisms, methods, languages, and tools for building variable, customizable, and extensible software. Along differe...
Sven Apel, Christian Lengauer, Bernhard Mölle...
CORR
2011
Springer
187views Education» more  CORR 2011»
14 years 8 months ago
Backdoors to Tractable Answer-Set Programming
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...
Johannes Klaus Fichte, Stefan Szeider
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
14 years 15 days ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko