Sciweavers

94 search results - page 3 / 19
» Weakest-precondition of unstructured programs
Sort
View
TCS
2010
13 years 5 months ago
Alternating states for dual nondeterminism in imperative programming
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
Wim H. Hesselink
ISSTA
2012
ACM
11 years 10 months ago
Detecting inconsistencies via universal reachability analysis
Recent research has suggested that a large class of software bugs fall into the category of inconsistencies, or cases where two pieces of program code make incompatible assumption...
Aaron Tomb, Cormac Flanagan
SIGSOFT
2010
ACM
13 years 5 months ago
Golden implementation driven software debugging
The presence of a functionally correct golden implementation has a significant advantage in the software development life cycle. Such a golden implementation is exploited for soft...
Ansuman Banerjee, Abhik Roychoudhury, Johannes A. ...
MPC
1992
Springer
135views Mathematics» more  MPC 1992»
13 years 11 months ago
A Calculus for Predicative Programming
A calculus for developing programs from specifications written as predicates that describe the relationship between the initial and final state is proposed. Such specifications are...
Emil Sekerinski
FAC
2010
259views more  FAC 2010»
13 years 6 months ago
An algebraic approach to the design of compilers for object-oriented languages
Here we describe an algebraic approach to constructing a provably correct compiler for an object-oriented language called ROOL. We tackle the problem of compiler correctness by red...
Adolfo Duran, Ana Cavalcanti, Augusto Sampaio