126 search results - page 6 / 26 » An Extension to Pointer Logic for Verification |
132
click to vote
AMAST
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
102
Voted
SPIN
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In the classic approach to logic model checking, software verification requires a manually constructed artifact (the model) to be written in the language that is accepted...
JSW
2006
14 years 11 months ago
2006
Abstract-- This paper describes a technique combining higher order functions, algebraic datatypes, and monads to incrementally implement syntax driven logics. Extensions can be com...
68
Voted
SIGSOFT
2002
ACM
16 years 11 days ago
2002
ACM
This paper explores the idea that redundant operations, like type errors, commonly flag correctness errors. We experimentally test this idea by writing and applying four redundanc...
120
click to vote
CAV
2009
Springer
16 years 5 days ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...