1894 search results - page 122 / 379 » A TLA Proof System |
224
click to vote
ECOOP
2009
Springer
16 years 1 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...
ATAL
2009
Springer
15 years 5 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...
CMA
2010
14 years 10 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...
120
click to vote
SP
2009
IEEE
15 years 8 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 ...
106
click to vote
FM
2003
Springer
15 years 6 months ago
2003
Springer
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...