Sciweavers

1445 search results - page 160 / 289
» Abstract Interpretation of Logic Programs
Sort
View
CSUR
1999
137views more  CSUR 1999»
14 years 9 months ago
Algebraic Methods for Specification and Formal Development of Programs
with functions over those sets. This level of abstraction is commensurate with the view that the correctness of the input/output behaviour of a program takes precedence over all it...
Donald Sannella, Andrzej Tarlecki
PLILP
1993
Springer
15 years 2 months ago
Higher-Order Chaotic Iteration Sequences
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...
Mads Rosendahl
AAAI
2007
15 years 12 days ago
A Modal Logic for Beliefs and Pro Attitudes
Agents’ pro attitudes such as goals, intentions, desires, wishes, and judgements of satisfactoriness play an important role in how agents act rationally. To provide a natural an...
Kaile Su, Abdul Sattar, Han Lin, Mark Reynolds
NJC
2006
86views more  NJC 2006»
14 years 10 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...
CTCS
1989
Springer
15 years 2 months ago
Temporal Structures
We combine the principles of the Floyd-Warshall-Kleene algorithm, enriched categories, and Birkhoff arithmetic, to yield a useful class of algebras of transitive vertex-labeled s...
Ross Casley, Roger F. Crew, José Meseguer, ...