Sciweavers

523 search results - page 49 / 105
» A General Model for Reachability Testing of Concurrent Progr...
Sort
View
124
Voted
COR
2008
133views more  COR 2008»
15 years 2 months ago
A new constraint programming approach for the orthogonal packing problem
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method ...
François Clautiaux, Antoine Jouglet, Jacque...
128
Voted
EDO
2005
Springer
15 years 8 months ago
A middleware-independent model and language for component distribution
A distribution model for the new generation of component languages, which allows to plug required into provided interfaces, is presented together with the distributed component la...
Hans Albrecht Schmid, Marco Pfeifer, Thorsten Schn...
ERSHOV
2009
Springer
15 years 9 months ago
Symbolic Bounded Conformance Checking of Model Programs
Abstract. Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of ...
Margus Veanes, Nikolaj Bjørner
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
15 years 4 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
141
Voted
ASP
2003
Springer
15 years 7 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...