43 search results - page 4 / 9 » Quantum weakest preconditions |
SPIN
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The paper presents a novel technique to create implementations of the basic primitives used in symbolic program analysis: forward symbolic evaluation, weakest liberal pre...
CAV
2004
Springer
14 years 28 days ago
2004
Springer
—We introduce a new BDD-like data structure called Hybrid-Restriction Diagrams (HRDs) for the representation and manipulation of linear hybrid automata (LHA) state-spaces and pre...
CAV
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We describe a method for synthesizing reasonable underapproximations to weakest preconditions for termination--a long-standing open problem. The paper provides experiment...
ENTCS
2006
13 years 7 months ago
2006
Consistency checking in the CSP B approach verifies that an individual controller process, defined using a sequential non-divergent subset of CSP, never calls a B operation outsid...
ISSTA
2012
ACM
11 years 10 months ago
2012
ACM
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...