Sciweavers

6554 search results - page 822 / 1311
» Constraint Logic Programming
Sort
View
CORR
2011
Springer
173views Education» more  CORR 2011»
15 years 1 months ago
Exploiting symmetries in SDP-relaxations for polynomial optimization
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
Cordian Riener, Thorsten Theobald, Lina Jansson An...
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 7 months ago
Polymorphic Fractional Capabilities
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
Hirotoshi Yasuoka, Tachio Terauchi
ESOP
2010
Springer
16 years 4 months ago
Separating Shape Graphs
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...
Vincent Laviron, Bor-Yuh Evan Chang and Xavier Riv...
PADL
2010
Springer
16 years 3 months ago
Prospective Storytelling Agents
Abstract. Prospective Logic Programming is a declarative framework supporting the specification of autonomous agents capable of anticipating and reasoning about hypothetical futur...
Gonçalo Lopes, Luís Moniz Pereira
IFL
2007
Springer
162views Formal Methods» more  IFL 2007»
16 years 1 months ago
Testing Erlang Refactorings with QuickCheck
Abstract. Refactoring is a technique for improving the design of existing programs without changing their behaviour. Wrangler is a tool built at the University of Kent to support E...
Huiqing Li, Simon Thompson