233 search results - page 33 / 47 » Specifying, Programming and Verifying with Equational Logic |
204
click to vote
POPL
2009
ACM
15 years 11 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
89
Voted
POPL
2010
ACM
15 years 8 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
102
click to vote
BIRTHDAY
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
SCP
2010
14 years 9 months ago
2010
The design and implementation of a software system is often governed by a variety of coding conventions, design patterns, architectural guidelines, design rules, and other so-call...
LPNMR
1990
Springer
15 years 3 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...