Results 1  10
of
48
Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus
"... Abstract. Safety verification of hybrid systems is a key technique in developing embedded systems that have a strong coupling with the physical environment. We propose an automated logical analytic method for verifying a class of hybrid automata. The problems are more general than those solved by th ..."
Abstract
 Add to MetaCart
by the existing model checkers: our method can verify models with symbolic parameters and nonlinear equations as well. First, we encode the execution trace of a hybrid automaton as an imperative program. Its safety property is then translated into proof obligations by strongest postcondition calculus. Finally
Strongest Postcondition of Unstructured Programs
, 2009
"... To avoid exponential explosion, program verifiers turn the program into a passive form before generating verification conditions. A little known fact is that the passive form makes it easy to use a strongest postcondition calculus to derive the verification condition. In the first part of this paper ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
To avoid exponential explosion, program verifiers turn the program into a passive form before generating verification conditions. A little known fact is that the passive form makes it easy to use a strongest postcondition calculus to derive the verification condition. In the first part
Reasoning about The Past with TwoWay Automata
 In 25th International Colloqium on Automata, Languages and Programming, ICALP ’98
, 1998
"... Abstract. The pcalculus can be viewed as essentially the "ultimate" program logic, as it expressively subsumes all propositional program logics, including dynamic logics, process logics, and temporal logics. It is known that the satisfiability problem for the pcalculus is EXPTIMEcomplete ..."
Abstract

Cited by 160 (14 self)
 Add to MetaCart
Abstract. The pcalculus can be viewed as essentially the "ultimate" program logic, as it expressively subsumes all propositional program logics, including dynamic logics, process logics, and temporal logics. It is known that the satisfiability problem for the pcalculus
Using the Refinement Calculus for Dataflow Processes
 IN PROC. SECOND AUSTRALASIAN REFINEMENT WORKSHOP
, 1994
"... The refinement calculus, based on predicate transformer semantics, is proving useful in the construction of sequential programs. It is argued that the refinement calculus provides a suitable development formalism for (possibly realtime) dataflowlike processes. Conventional precondition and pos ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
The refinement calculus, based on predicate transformer semantics, is proving useful in the construction of sequential programs. It is argued that the refinement calculus provides a suitable development formalism for (possibly realtime) dataflowlike processes. Conventional precondition
A Program Calculus
, 2008
"... This document describes a theory of imperative programs, i.e. programs that operate on a system state which is modified by their execution. For this purpose, we define the syntax and formal semantcs of a small imperative programming language, introduce judgements for reasoning about programs written ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
command and discloses its “semantic essence”. The calculus supports reasoning about a program’s wellformedness, partial correctness, and termination, as well as the automated construction of preconditions, postconditions, and assertions. CONTENTS 3
A Calculus for Hybrid CSP?
"... Abstract. Hybrid Communicating Sequential Processes (HCSP) is an extension of CSP allowing continuous dynamics. We are interested in applying HCSP to model and verify hybrid systems. This paper is to present a calculus for a subset of HCSP as a part of our efforts in modelling and verifying hybrid ..."
Abstract
 Add to MetaCart
algebraic systems. The other part of the calculus is a logic to reason about HCSP process, which involves communication, parallelism, realtime as well as continuous dynamics. This logic is named as Hybrid Hoare Logic. Its assertions consist of traditional pre and postconditions, and also Duration Calculus
A Hoare calculus for graph programs
 In Proc. International Conference on Graph Transformation (ICGT 2010), Lecture
"... Abstract. We present Hoarestyle axiom schemata and inference rules for verifying the partial correctness of programs in the graph programming language GP. The pre and postconditions of this calculus are the nested conditions of Habel, Pennemann and Rensink, extended with expressions for labels in ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Abstract. We present Hoarestyle axiom schemata and inference rules for verifying the partial correctness of programs in the graph programming language GP. The pre and postconditions of this calculus are the nested conditions of Habel, Pennemann and Rensink, extended with expressions for labels
Reverse Hoare Logic?
"... Abstract. We present a novel Hoarestyle logic, called Reverse Hoare Logic, which can be used to reason about state reachability of imperative programs. This enables us to give natural specifications to randomized (deterministic or nondeterministic) algorithms. We give a proof system for the logic a ..."
Abstract
 Add to MetaCart
and use this to give simple formal proofs for a number of illustrative examples. We define a weakest postcondition calculus and use this to show that the proof system is sound and complete. 1
The implicit calculus of constructions as a programming language with dependent types
 In Amadio [6
"... Abstract. In this paper, we show how Miquel’s Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has an undecidable typechecking, we introduce a more verbose variant, called ICC ∗ which fixes this issue. Datatypes and program ..."
Abstract

Cited by 44 (1 self)
 Add to MetaCart
specifications are enriched with logical assertions (such as preconditions, postconditions, invariants) and programs are decorated with proofs of those assertions. The point of using ICC ∗ rather than the Calculus of Constructions (the core formalism of the Coq proof assistant) is that all of the static
Possibility and Infinitary Nondeterminism in the Situation Calculus
, 1997
"... This paper presents a version of the Situation Calculus with improved capabilities in formalizing and reasoning about nondeterministic actions. Instead of describing the effects of such actions by posting constraints on their possible outcomes, as is typically done in the common Situation Calculu ..."
Abstract
 Add to MetaCart
Calculus, we provide means of describing actions by the set of their possible total effects. An important advantage of this approach is its allowing for reasoning about the possible (as opposed to the necessary) postconditions of actions. Furthermore, our method does not require enumerating
Results 1  10
of
48