198 search results - page 9 / 40 » Lightweight reasoning about program correctness |
IPL
2008
13 years 8 months ago
2008
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
KR
2010
Springer
13 years 10 months ago
2010
Springer
Existing action calculi provide rich, declarative formalisms for reasoning about actions. BDI-based programming languages like AgentSpeak, on the other hand, are procedural and ge...
PEPM
2010
ACM
14 years 5 months ago
2010
ACM
We present two tools which together allow reasoning about (a substantial subset of) Haskell programs. One is the code generator of the proof assistant Isabelle, which turns speciï...
FROCOS
2005
Springer
14 years 2 months ago
2005
Springer
Reasoning about the correctness of program transformations requires a notion of program equivalence. We present an observational semantics for the concurrent lambda calculus with f...
SCP
2008
13 years 8 months ago
2008
This paper shows that program algebra (PGA) [8] offers a mathematical and systematic framework for reasoning about correctness and equivalence of algorithms and transformation rul...