Clemens Ballarin

Orcid: 0000-0003-2222-9693

According to our database1, Clemens Ballarin authored at least 20 papers between 1995 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Exploring the Structure of an Algebra Text with Locales.
J. Autom. Reason., 2020

2019
A Case Study in Basic Algebra.
Arch. Formal Proofs, 2019

2014
Locales: A Module System for Mathematical Theories.
J. Autom. Reason., 2014

Two Generalisations of Roşu and Chen's Trace Slicing Algorithm A.
Proceedings of the Runtime Verification - 5th International Conference, 2014

2013
Reading an algebra textbook.
Proceedings of the Joint Proceedings of the MathUI, 2013

Towards monitoring temporal properties with JamaicaVM.
Proceedings of the 11th International Workshop on Java Technologies for Real-time and Embedded Systems, 2013

2010
Generating certified code from formal proofs: a case study in homological algebra.
Formal Aspects Comput., 2010

2008
Computer algebra and theorem proving
PhD thesis, 2008

A Mechanized Proof of the Basic Perturbation Lemma.
J. Autom. Reason., 2008

2006
Interpretation of Locales in Isabelle: Theories and Proof Contexts.
Proceedings of the Mathematical Knowledge Management, 5th International Conference, 2006

2005
A reconstruction and extension of Maple's assume facility via constraint contextual rewriting.
J. Symb. Comput., 2005

Fast Fourier Transform.
Arch. Formal Proofs, 2005

Extracting Computer Algebra Programs from Statements.
Proceedings of the Computer Aided Systems Theory, 2005

2004
Solving parametric linear systems: an experiment with constraint algebraic programming.
SIGSAM Bull., 2004

Four Approaches to Automated Reasoning with Differential Algebraic Structures.
Proceedings of the Artificial Intelligence and Symbolic Computation, 2004

2003
Locales and Locale Expressions in Isabelle/Isar.
Proceedings of the Types for Proofs and Programs, International Workshop, 2003

2001
Maple's evaluation process as constraint contextual rewriting.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

1999
A Pragmatic Approach to Extending Provers by Computer Algebra - with Applications to Coding Theory.
Fundam. Informaticae, 1999

1998
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra.
Proceedings of the Artificial Intelligence and Symbolic Computation, 1998

1995
Theorems and Algorithms: An Interface between Isabelle and Maple.
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995


  Loading...