Sciweavers

54 search results - page 8 / 11
» Non-termination Inference for Constraint Logic Programs
Sort
View
SCP
2010
155views more  SCP 2010»
13 years 6 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
LISP
2008
154views more  LISP 2008»
13 years 8 months ago
Types and trace effects for object orientation
Trace effects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type a...
Christian Skalka
CAV
2009
Springer
169views Hardware» more  CAV 2009»
14 years 8 months ago
Automatic Verification of Integer Array Programs
We provide a verification technique for a class of programs working on integer arrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to spe...
Filip Konecný, Marius Bozga, Peter Habermeh...
KBSE
2010
IEEE
13 years 6 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
ICFP
2006
ACM
14 years 8 months ago
Static analysis for syntax objects
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
David Fisher, Olin Shivers