Sciweavers

3931 search results - page 30 / 787
» Separation logic and abstraction
Sort
View
ANOR
2002
67views more  ANOR 2002»
14 years 9 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Daniel Riera, Neil Yorke-Smith
CORR
2011
Springer
156views Education» more  CORR 2011»
14 years 4 months ago
Extensional Collapse Situations I: non-termination and unrecoverable errors
Abstract. We consider a simple model of higher order, functional computations over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable e...
Antonio Bucciarelli
TASE
2009
IEEE
15 years 4 months ago
The Logical Approach to Low-Level Stack Reasoning
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...
Xinyu Jiang, Yu Guo, Yiyun Chen
POPL
2007
ACM
15 years 10 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
JUCS
2006
135views more  JUCS 2006»
14 years 9 months ago
Operational/Interpretive Unfolding of Multi-adjoint Logic Programs
Abstract: Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of...
Pascual Julián, Ginés Moreno, Jaime ...