210 search results - page 7 / 42 » Partial model checking via abstract interpretation |
100
Voted
SLP
1993
15 years 1 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
105
Voted
FM
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. The paper introduces the construct of temporal testers as a compositional basis for the construction of automata corresponding to temporal formulas in the PSL logic. Temp...
TACAS
2007
Springer
15 years 6 months ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
TACAS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present the FocusCheck model-checking tool for the verification and easy debugging of assertion violations in sequential C programs. The main functionalities of the t...
101
Voted
APLAS
2010
ACM
15 years 17 days ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...