Sciweavers

1461 search results - page 114 / 293
» Analysis of Constraint Logic Programs
Sort
View
FCA
2005
Springer
207views Formal Methods» more  FCA 2005»
15 years 3 months ago
From Formal Concept Analysis to Contextual Logic
Abstract. A main goal of Formal Concept Analysis from its very beginning has been the support of rational communication. The source of this goal lies in our understanding of mathem...
Frithjof Dau, Julia Klinger
CAV
2006
Springer
143views Hardware» more  CAV 2006»
15 years 1 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....
TACAS
2007
Springer
125views Algorithms» more  TACAS 2007»
15 years 4 months ago
Type-Dependence Analysis and Program Transformation for Symbolic Execution
Symbolic execution can be problematic when applied to real applications. This paper addresses two of these problems: (1) the constraints generated during symbolic execution may be ...
Saswat Anand, Alessandro Orso, Mary Jean Harrold
PRICAI
2004
Springer
15 years 3 months ago
Model Theory for PRS-Like Agents: Modelling Belief Update and Action Attempts
In this paper, we extend our earlier work on modelling the mental states of PRS-like agents by considering the dynamics of belief and modelling of action attempts. The major constr...
Wayne Wobcke
APLAS
2005
ACM
15 years 3 months ago
Symbolic Execution with Separation Logic
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn