18

On the Structure of Inductive Reasoning: Circular and TreeShaped Proofs in the µCalculus
– Christoph Sprenger, Mads Dam
 2003

585

P.: An automatatheoretic approach to automatic program verification
– M Vardi, Wolper
 1986

57

1971: ‘Hauptsatz for the Intuitionistic Theory of Iterated Inductive Definitions
– Per MartinLöf

179

An Introduction to Inductive Definitions
– P Aczel
 1977

9

calculus with explicit points and approximations
– Mads Dam, Dilian Gurov

5

Finiteness is muineable
– David Park
 1976

2

Formal verication of processes
– Ulrich Schpp
 2001

19

A framework for reasoning about Erlang code
– L Fredlund
 2001

13

Local model checking in the modal calculus
– C Stirling, D Walker
 1991

260

Results on the propositional calculus
– D Kozen
 1983

2

and Dilian Gurov. µcalculus with explicit points and approximations
– Mads Dam
 2002

2

Formal Verification of Processes
– Ulrich Schöpp
 2001

3

Poítin: Distilling theorems from conjectures
– G Hamilton
 2005

8

A Note on Global Induction Mechanisms in a µCalculus with Explicit Approximations
– Christoph Sprenger, Mads Dam
 1999

12

A Calculus of Infinite constructions and its applications to the verification of communicating systems
– E Giménez
 1996

261

S.: ComputerAided Reasoning: An Approach
– M Kaufmann, P Manolios, J Moore
 2000

83

Infinite Objects in Type Theory
– Thierry Coquand

81

Automating the Meta Theory of Deductive Systems
– Carsten Schurmann, Dana Scott
 2000

43

C.Stirling. Local model checking for infinite state spaces
– J Bradfield
 1992
