Anton Setzer

Orcid: 0000-0001-5322-6060

According to our database1, Anton Setzer authored at least 41 papers between 1996 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A model of Solidity-style smart contracts in the theorem prover Agda.
Proceedings of the IEEE International Conference on Artificial Intelligence, 2023

2022
Verification of Bitcoin's Smart Contracts in Agda using Weakest Preconditions for Access Control.
CoRR, 2022

2021
Verification of Bitcoin Script in Agda Using Weakest Preconditions for Access Control.
Proceedings of the 27th International Conference on Types for Proofs and Programs, 2021

2018
Modelling Bitcoin in Agda.
CoRR, 2018

Martin Hofmann's Case for Non-Strictly Positive Data Types.
Proceedings of the 24th International Conference on Types for Proofs and Programs, 2018

Developing GUI Applications in a Verified Setting.
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2018

Declarative GUIs: Simple, Consistent, and Verified.
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

Formal Verification for Feature-Based Composition of Workflows.
Proceedings of the 14th European Dependable Computing Conference, 2018

Undecidability of Equality for Codata Types.
Proceedings of the Coalgebraic Methods in Computer Science, 2018

2017
Interactive programming in Agda - Objects and graphical user interfaces.
J. Funct. Program., 2017

2016
A light-weight integration of automated and interactive theorem proving.
Math. Struct. Comput. Sci., 2016

Trace and Stable Failures Semantics for CSP-Agda.
Proceedings of the First Workshop on Coalgebra, Horn Clause Logic Programming and Types, 2016

Defining Trace Semantics for CSP-Agda.
Proceedings of the 22nd International Conference on Types for Proofs and Programs, 2016

Programming with monadic CSP-style processes in dependent type theory.
Proceedings of the 1st International Workshop on Type-Driven Development, 2016

2014
Unnesting of Copatterns.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2013
Verification of Solid State Interlocking Programs.
Proceedings of the Software Engineering and Formal Methods, 2013

Copatterns: programming infinite structures by observations.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

Fibred Data Types.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012
Coalgebras as Types Determined by Their Elimination Rules.
Proceedings of the Epistemology versus Ontology, 2012

2011
A Categorical Semantics for Inductive-Inductive Definitions.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011

2010
Inductive-Inductive Definitions.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2008
A Provably Correct Translation of the <i>lambda</i> -Calculus into a Mathematical Model of C++.
Theory Comput. Syst., 2008

Automated Verification of Signalling Principles in Railway Interlocking Systems.
Proceedings of the Eighth International Workshop on Automated Verification of Critical Systems, 2008

2006
Indexed induction-recursion.
J. Log. Algebraic Methods Program., 2006

Object-oriented programming in dependent type theory.
Proceedings of the Revised Selected Papers from the Seventh Symposium on Trends in Functional Programming, 2006

Functional concepts in C++.
Proceedings of the Revised Selected Papers from the Seventh Symposium on Trends in Functional Programming, 2006

Weak Bisimulation Approximants.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Partial Recursive Functions in Martin-Löf Type Theory.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2005
Interactive Programs and Weakly Final Coalgebras in Dependent Type Theory.
Proceedings of the From sets and types to topology and analysis, 2005

2004
State Dependent IO-Monads in Type Theory.
Proceedings of the 10th Conference on Category Theory in Computer Science, 2004

Interactive Programs and Weakly Final Coalgebras in Dependent Type Theory (Extended Version).
Proceedings of the Dependently Typed Programming, 12.09. - 17.09.2004, 2004

2003
Induction-recursion and initial algebras.
Ann. Pure Appl. Log., 2003

2002
Java as a Functional Programming Language.
Proceedings of the Types for Proofs and Programs, Second International Workshop, 2002

2000
Extending Martin-Löf Type Theory by one Mahlo-universe.
Arch. Math. Log., 2000

Interactive Programs in Dependent Type Theory.
Proceedings of the Computer Science Logic, 2000

1999
The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories.
J. Symb. Log., 1999

A Finite Axiomatization of Inductive-Recursive Definitions.
Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999

1998
Well-Ordering, Proofs for Martin-Löf Type Theory.
Ann. Pure Appl. Log., 1998

1997
Translating Set Theoretical Proofs into Type Theoretical Programs.
Proceedings of the Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, 1997

1996
On <i>PHP st</i>-connectivity, and odd charged graphs.
Proceedings of the Proof Complexity and Feasible Arithmetics, 1996

Inductive Definitions with Decidable Atomic Formulas.
Proceedings of the Computer Science Logic, 10th International Workshop, 1996


  Loading...