Sciweavers

756 search results - page 105 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
ENTCS
2008
140views more  ENTCS 2008»
14 years 12 months ago
Higher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
Carsten Varming, Lars Birkedal
LOPSTR
2007
Springer
15 years 6 months ago
A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
Mario Méndez-Lojo, Jorge Navas, Manuel V. H...
POPL
2006
ACM
16 years 4 days ago
Frame rules from answer types for code pointers
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
Hayo Thielecke
POPL
2006
ACM
16 years 4 days ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
PLDI
2004
ACM
15 years 5 months ago
KISS: keep it simple and sequential
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
Shaz Qadeer, Dinghao Wu