Sciweavers

315 search results - page 45 / 63
» Reasoning about Assignments in Recursive Data Structures
Sort
View
POPL
2010
ACM
16 years 1 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
JOT
2008
136views more  JOT 2008»
15 years 3 months ago
The Stock Statistics Parser
This paper describes how use the HTMLEditorKit to perform web data mining on stock statistics for listed firms. Our focus is on making use of the web to get information about comp...
Douglas Lyon
SCP
2010
155views more  SCP 2010»
15 years 2 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
TPHOL
2009
IEEE
15 years 10 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
EMSOFT
2003
Springer
15 years 9 months ago
Space Reductions for Model Checking Quasi-Cyclic Systems
Despite significant research on state-space reductions, the poor scalability of model checking for reasoning about behavioral models of large, complex systems remains the chief ob...
Matthew B. Dwyer, Robby, Xianghua Deng, John Hatcl...