Sciweavers

329 search results - page 23 / 66
» Automatic Proofs for Scalecharts
Sort
View
FMOODS
2008
13 years 10 months ago
Semantic Foundations and Inference of Non-null Annotations
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
Laurent Hubert, Thomas P. Jensen, David Pichardie
IANDC
2008
131views more  IANDC 2008»
13 years 8 months ago
Termination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
Salvador Lucas, José Meseguer
DMTCS
2007
73views Mathematics» more  DMTCS 2007»
13 years 8 months ago
"Trivializing" Generalizations of some Izergin-Korepin-type Determinants
We generalize (and hence trivialize and routinize) numerous explicit evaluations of determinants and pfaffians due to Kuperberg, as well as a determinant of Tsuchiya. The level of ...
Tewodros Amdeberhan, Doron Zeilberger
TAP
2008
Springer
153views Hardware» more  TAP 2008»
13 years 8 months ago
Bounded Relational Analysis of Free Data Types
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
APLAS
2005
ACM
14 years 2 months ago
Symbolic Execution with Separation Logic
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn