Andrei Paskevich

According to our database1, Andrei Paskevich authored at least 25 papers between 2002 and 2020.

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

2020
Deductive verification with ghost monitors.
Proc. ACM Program. Lang., 2020

Abstraction and Genericity in Why3.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles, 2020

Verification of Programs with Pointers in SPARK.
Proceedings of the Formal Methods and Software Engineering, 2020

2018
Borrowing Safe Pointers from Rust in SPARK.
CoRR, 2018

2016
Adding Decision Procedures to SMT Solvers Using Axioms with Triggers.
J. Autom. Reason., 2016

The spirit of ghost code.
Formal Methods Syst. Des., 2016

Evidential Paradigm as Formal Knowledge Presentation and Processing.
Proceedings of the 12th International Conference on ICT in Education, 2016

2015
Let's verify this with Why3.
Int. J. Softw. Tools Technol. Transf., 2015

How to Avoid Proving the Absence of Integer Overflows.
Proceedings of the Verified Software: Theories, Tools, and Experiments, 2015

2014
Formalizing Semantics with an Automatic Program Verifier.
Proceedings of the Verified Software: Theories, Tools and Experiments, 2014

Verified programs with binders.
Proceedings of the 2014 ACM SIGPLAN Workshop on Programming Languages meets Program Verification, 2014

2013
Preserving User Proofs across Specification Changes.
Proceedings of the Verified Software: Theories, Tools, Experiments, 2013

Why3 - Where Programs Meet Provers.
Proceedings of the Programming Languages and Systems, 2013

TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism.
Proceedings of the Automated Deduction - CADE-24, 2013

2012
The 2nd Verified Software Competition: Experience Report.
Proceedings of the 1st International Workshop on Comparative Empirical Evaluation of Reasoning Systems, 2012

Reasoning with Triggers.
Proceedings of the 10th International Workshop on Satisfiability Modulo Theories, 2012

2011
Expressing Polymorphic Types in a Many-Sorted Language.
Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

2010
A3PAT, an approach for certified automated termination proofs.
Proceedings of the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2010

2008
Connection Tableaux with Lazy Paramodulation.
J. Autom. Reason., 2008

On Correctness of Mathematical Texts from a Logical and Practical Point of View.
Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

2007
System for Automated Deduction (SAD): A Tool for Proof Verification.
Proceedings of the Automated Deduction, 2007

2006
SAD as a mathematical assistant - how should we go from here to there?
J. Appl. Log., 2006

2004
Theorem Proving and Proof Verification in the System SAD.
Proceedings of the Mathematical Knowledge Management, Third International Conference, 2004

Evidential Paradigm and Intelligent Mathematical Text Processing.
Proceedings of the Information Systems Technology and its Applications, 2004

2002
System for Automated Deduction (SAD): Linguistic and Deductive Peculiarities.
Proceedings of the Intelligent Information Systems 2002, 2002


  Loading...