55 search results - page 7 / 11 » Reasoning About Imperative Quantum Programs |
POPL
2010
ACM
14 years 6 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
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...
TLDI
2010
ACM
13 years 9 months ago
2010
ACM
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
KBSE
2007
IEEE
14 years 3 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: ...
ICSE
2005
IEEE-ACM
14 years 8 months ago
2005
IEEE-ACM
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...