32 search results - page 5 / 7 » Automated Assume-Guarantee Reasoning by Abstraction Refineme... |
PRICAI
1998
Springer
13 years 11 months ago
1998
Springer
We present a new methodology to automate decision making over time and uncertainty. We adopt a knowledge-based model construction approach to support automated and interactive form...
FLOPS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
Abstract. We present the first terminating tableau calculus for basic hybrid logic with the difference modality and converse modalities. The language under consideration is basic m...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
We present Low-Level Liquid Types, a refinement type system for C based on Liquid Types. Low-Level Liquid Types combine refinement types with three key elements to automate verifi...