Sciweavers

72 search results - page 8 / 15
» A Beginner's Course on Reasoning About Imperative Programs
Sort
View
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
14 years 9 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...
KBSE
2007
IEEE
15 years 3 months ago
Sequential circuits for program analysis
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: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
ICSE
2005
IEEE-ACM
15 years 9 months ago
Verifying safety policies with size properties and alias controls
Many software properties can be analysed through a relational size analysis on each function's inputs and outputs. Such relational analysis (through a form of dependent typin...
Wei-Ngan Chin, Siau-Cheng Khoo, Shengchao Qin, Cor...
PLPV
2011
ACM
14 years 9 days ago
Local actions for a curry-style operational semantics
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
Gordon Stewart, Andrew W. Appel
BIRTHDAY
2004
Springer
15 years 2 months ago
Retracing the Semantics of CSP
CSP was originally introduced as a parallel programming language in which sequential imperative processes execute concurrently and communicate by synchronized input and output. The...
Stephen D. Brookes