## 26 Citations

### Reactive Valuations

- PhilosophyArXiv
- 2011

This Master of Logic thesis consists of a study of some of the properties of sequential propositional logic and shows ω-completeness for two classes of reactive valuations.

### Automatic Verification of Programs with Indirection

- Computer Science
- 2012

The correctness of an existing verification algorithm, namely counterexample-driven abstraction refinement, is proved and the efficiency of the algorithm is improved by exploiting determinism when present and it is proved that this algorithm terminates on incorrect deterministic programs.

### Side Effects in Steering Fragments

- PhilosophyArXiv
- 2011

This thesis will modify a system for modelling program instructions and program states to a system called DLAf (for Dynamic Logic with Assignments as Formulas), which in contrast to QDL allows assignments in formulas and makes use of short-circuit evaluation.

### Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition

- Computer ScienceIJCAR
- 2016

By adapting the elimination of Hintikka sets procedure, this work provides a decision procedure for the satisfiability problem of PPDL det that can be executed in deterministic exponential time and it is proved that this decision procedure is EXPTIME-complete.

### Short-circuit logic

- Computer ScienceArXiv
- 2010

This work uses sequential conjunction as a primitive connective because it immediately relates to short-circuit evaluation and provides sets of equations for FSCL and MSCL, and provides a completeness result for MSCL.

### A logic toolbox for modeling knowledge and information in multi-agent systems and social epistemology

- Philosophy
- 2011

This dissertation makes numerous contributions to the field of which the following three are the most important: • A detailed investigation of the combination of hybrid logic and public announcement logic, showing in particular that the proof theoretic advantages of hybrid Logic (such as automatic completeness with pure) are shown.

### Arrows for knowledge-based circuits

- Computer Science
- 2013

A scheme for compiling KBPs to executable automata in finite environments with a proof of correctness in Isabelle/HOL is presented and Arrows, a functional programming abstraction, is used to structure a prototype domain-specific synchronous language embedded in Haskell.

### Towards Making Safety Case Arguments Explicit, Precise, and Well Founded

- Philosophy
- 2020

The introduction of safety cases into the practice of safety assurance has revolutionized safety engineering. Via a ‘safety argument’, a safety case aims to explicate, and to provide some structure…

### Sequential Dynamic Logic

- Philosophy, Computer ScienceJ. Log. Lang. Inf.
- 2012

We introduce a substructural propositional calculus of Sequential Dynamic Logic that subsumes a propositional part of dynamic predicate logic, and is shown to be expressively equivalent to…

## References

SHOWING 1-10 OF 169 REFERENCES

### Variables as Stacks

- Computer ScienceJ. Log. Lang. Inf.
- 2000

This paper regard variables as names for stacks of values and make explicit several control actions as push and pop actions on stacks, both to static and dynamic languages and to finite variable hierarchies.

### Reasoning about update logic

- Computer ScienceJ. Philos. Log.
- 1995

This paper shows how information logics like update logic can fruitfully be studied by linking their dynamic principles to static ‘correctness descriptions’, and argues that interpreting the dynamic statements of informationlogics as dynamic modal operators has much wider applicability.

### SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC

- Computer Science, PhilosophyFOCS 1976
- 1976

An appropriate axiom system is given which is complete for loop-free programs and also puts conventional predicate calculus in a different light by lumping quantifiers with non-logical assignments rather than treating them as logical concepts.

### Structural Operational Semantics

- Computer ScienceHandbook of Process Algebra
- 2001

The importance of giving precise semantics to programming and specification languages was recognized since the sixties with the development of the first high-level programming languages and was already advocated by McCarthy in [147], and elaborated upon in references like [142, 143].

### Reducing Dynamic Epistemic Logic to PDL by Program Transformation

- Computer Science, Philosophy
- 2004

This work presents a direct reduction of dynamic epistemic logic in the spirit of Baltag, Moss and Solecki to propositional dynamic logic (PDL) by program transformation, and shows how the detour through automata can be avoided.

### Dynamic epistemic logic

- Philosophy, Computer Science
- 1998

A semantics and a deduction system for a multi-agent modal language extended with a repertoire of programs that describe information change, designed in such a way that everything that is expressible in the object language can be known or learned by each of the agents.

### Typed Logics With States

- Computer ScienceLog. J. IGPL
- 1997

The paper presents a simple format for typed logics with states by adding a function for register update to standard typed lambda calculus, and it is illustrated how the resulting format allows for very simple and intuitive representations of dynamic semantics for natural language and denotational semantics for imperative programming.

### Logics of public communications

- Philosophy, Computer ScienceSynthese
- 2007

Extensions of the logic S5 which can deal with public communications are defined and some completeness, decidability and interpretability results are proved and a general method is formulated that solves certain kind of problems involving public communications.

### Contexts in Dynamic Predicate Logic

- Philosophy, MathematicsJ. Log. Lang. Inf.
- 1998

This paper uses a notion of context for Groenendijk & Stokhof's Dynamic Predicate Logic DPL to give a characterization of the relations on assignments that can be generated by composition from tests and random resettings in the case that the authors are working over an infinite domain.