Sciweavers

4595 search results - page 322 / 919
» Reasoning about Plans
Sort
View
ICFP
1998
ACM
15 years 11 months ago
Fold and Unfold for Program Semantics
In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion...
Graham Hutton
PLDI
1997
ACM
15 years 11 months ago
Data-centric Multi-level Blocking
We present a simple and novel framework for generating blocked codes for high-performance machines with a memory hierarchy. Unlike traditional compiler techniques like tiling, whi...
Induprakas Kodukula, Nawaaz Ahmed, Keshav Pingali
239
Voted
MFCS
1994
Springer
15 years 11 months ago
A Proof System for Asynchronously Communicating Deterministic Processes
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...
Frank S. de Boer, M. van Hulst
ATVA
2006
Springer
140views Hardware» more  ATVA 2006»
15 years 11 months ago
On the Construction of Fine Automata for Safety Properties
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Each safety property can be associated with...
Orna Kupferman, Robby Lampert
AUSAI
2003
Springer
15 years 11 months ago
Decidability of Propositionally Quantified Logics of Knowledge
Abstract. Logics of knowledge have important applications for reasoning about security protocols and multi-agent systems. We extend the semantics for the logic of necessity with lo...
Tim French