198 search results - page 17 / 40 » Lightweight reasoning about program correctness |
KBSE
2007
IEEE
14 years 2 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
TOPLAS
2010
13 years 7 months ago
2010
Pict project. We define two levels of abstraction as calculi with precise semantics: a low-level Nomadic π calculus with migration and location-dependent communication, and a hig...
ENTCS
2008
13 years 8 months ago
2008
As an extension to Floyd-Hoare logic, separation logic has been used to facilitate reasoning about imperative programs manipulating shared mutable data structures. Recently, it ha...
EMSOFT
2008
Springer
13 years 10 months ago
2008
Springer
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
ECMDAFA
2008
Springer
13 years 10 months ago
2008
Springer
Model transformations support a model-driven design by providing an c translation of abstract models into more concrete ones, and eventually program code. Crucial to a successful a...