Sciweavers

107 search results - page 16 / 22
» Separation Logic: A Logic for Shared Mutable Data Structures
Sort
View
ICFP
2009
ACM
14 years 8 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
CBMS
2006
IEEE
14 years 1 months ago
Incoporating Data Mining Applications into Clinical Guildelines
Computer based clinical guidelines have been developed to help caregivers in practicing medicine. GLIF3 (Guideline Interchange Format 3) is one of several standards that specify t...
Reza Sherafat Kazemzadeh, Kamran Sartipi
SAS
2007
Springer
103views Formal Methods» more  SAS 2007»
14 years 1 months ago
Footprint Analysis: A Shape Analysis That Discovers Preconditions
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
WIA
2000
Springer
13 years 11 months ago
MONA Implementation Secrets
The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in prac...
Nils Klarlund, Anders Møller, Michael I. Sc...
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 11 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi