12774 search results - page 277 / 2555 » A Framework for Proof Systems |
191
click to vote
AMAST
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. When designing an open system, there might be no implementation available for certain components at verification time. For such systems, verification has to be based on a...
319
click to vote
ECOOP
2009
Springer
16 years 7 months ago
2009
Springer
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in encoding programs in Horn formulas which are inter...
166
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
121
click to vote
CMA
2010
15 years 4 months ago
2010
It is shown that the Clar number can be arbitrarily larger than the cardinality of a maximal alternating set. In particular, a maximal alternating set of a hexagonal system need n...
177
click to vote
SP
2009
IEEE
16 years 1 months ago
2009
IEEE
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...