Sciweavers

24 search results - page 5 / 5
» Inferring Loop Invariants Using Postconditions
Sort
View
PSSE
2004
Springer
13 years 10 months ago
Developing and Reasoning About Probabilistic Programs in pGCL
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
Annabelle McIver, Carroll Morgan
BIRTHDAY
2003
Springer
13 years 10 months ago
Extreme Model Checking
One of the central axioms of extreme programming is the disciplined use of regression testing during stepwise software development. Due to recent progress in software model checkin...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
ESOP
2001
Springer
13 years 9 months ago
Typestate Checking of Machine Code
We check statically whether it is safe for untrusted foreign machine code to be loaded into a trusted host system. (Here “safety” means that the program abides by a memory-acc...
Zhichen Xu, Thomas W. Reps, Barton P. Miller
JAR
2006
236views more  JAR 2006»
13 years 5 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard