Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Proof Rules"”.
-
A Constraint-Based Approach to Reactive Task and Motion Planning
… Theories (SMT) solvers using a new extension of proof rules for Temporal Property Verification. For efficient policy search, we apply domain-specific heuristics to generalize verification failures. Furthermore, the SMT solver enables quantitative specifications such as energy limits. We benchmark …
-
Symbolic timing diagrams: a visual formalism for model verification
… by a representative set of derivation proof rules. Second, the main formalism STD is defined. The connection between LSTD and STD is established by a theorem, which shows that a STD specification can be represented by an equivalent LSTD specification. While the presentation is focused …
-
Reasoning Tradeoffs in Implicit Invocation and Aspect Oriented Languages
… regarding these tradeoffs, and provides sound proof rules for verification of programs covered by all these scenarios. Guidance for program developers and language designers is also given, so that reasoning about these types of programs becomes more tractable.
-
Automatic inductive theorem proving and program construction methods using program transformation
… and to construct programs from the resulting proofs. These theorem proving and program construction techniques make use of the distillation algorithm to transform input conjectures into a normalised form which we call distilled form. The proof rules are applied to the resulting distilled …
-
Concurrent verification for sequential programs
… through side-conditions on rely-guarantee proof rules. This dissertation proposes instead to encode stability information into the syntactic form of the assertion. This approach, which we call explicit stabilisation, brings several benefits. First, we empower rely-guarantee with the ability …
-
Specification And Mechanical Verification Of Performance Profiles Of Software Components
… language. It contains a mechanizable and modular proof system to verify the performance bounds of reusable software components built reusing other components. The proof system forms the basis for a prototype verification condition (VC) generator. Experimentation with the VC generator illustrates …