Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Chihani, Zakaria
Miller, Dale
and
Renaud, Fabien
2013.
Automated Deduction – CADE-24.
Vol. 7898,
Issue. ,
p.
162.
Miller, Dale
and
Tiu, Alwen
2013.
Certified Programs and Proofs.
Vol. 8307,
Issue. ,
p.
194.
KWON, Keehang
2014.
Expressing Algorithms as Concise as Possible via Computability Logic.
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,
Vol. E97.A,
Issue. 6,
p.
1385.
Chihani, Zakaria
Libal, Tomer
and
Reis, Giselle
2015.
Automated Reasoning with Analytic Tableaux and Related Methods.
Vol. 9323,
Issue. ,
p.
201.
Tarau, Paul
2015.
Practical Aspects of Declarative Languages.
Vol. 9131,
Issue. ,
p.
115.
Felty, Amy P.
Momigliano, Alberto
and
Pientka, Brigitte
2015.
The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations.
Journal of Automated Reasoning,
Vol. 55,
Issue. 4,
p.
307.
Miller, Dale
2015.
Logic-Based Program Synthesis and Transformation.
Vol. 9527,
Issue. ,
p.
3.
Miller, Dale
and
Volpe, Marco
2015.
Logic for Programming, Artificial Intelligence, and Reasoning.
Vol. 9450,
Issue. ,
p.
266.
Blanco, Roberto
and
Miller, Dale
2015.
Proof Outlines as Proof Certificates: A System Description.
Electronic Proceedings in Theoretical Computer Science,
Vol. 197,
Issue. ,
p.
7.
Heath, Quentin
and
Miller, Dale
2015.
A framework for proof certificates in finite state exploration.
Electronic Proceedings in Theoretical Computer Science,
Vol. 186,
Issue. ,
p.
11.
Dunchev, Cvetan
Guidi, Ferruccio
Sacerdoti Coen, Claudio
and
Tassi, Enrico
2015.
Logic for Programming, Artificial Intelligence, and Reasoning.
Vol. 9450,
Issue. ,
p.
460.
Charalambidis, Angelos
Rondogiannis, Panos
and
Symeonidou, Ioanna
2015.
Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs.
Electronic Proceedings in Theoretical Computer Science,
Vol. 191,
Issue. ,
p.
18.
de Moura, Leonardo
Kong, Soonho
Avigad, Jeremy
van Doorn, Floris
and
von Raumer, Jakob
2015.
Automated Deduction - CADE-25.
Vol. 9195,
Issue. ,
p.
378.
Cimini, Matteo
and
Siek, Jeremy G.
2016.
The gradualizer: a methodology and algorithm for generating gradual type systems.
ACM SIGPLAN Notices,
Vol. 51,
Issue. 1,
p.
443.
Wang, Yuting
and
Nadathur, Gopalan
2016.
Programming Languages and Systems.
Vol. 9632,
Issue. ,
p.
752.
Cimini, Matteo
and
Siek, Jeremy G.
2016.
The gradualizer: a methodology and algorithm for generating gradual type systems.
p.
443.
KWON, Keehang
SEO, Jeongyoon
and
KANG, Daeseong
2016.
Bounded-Choice Statements for User Interaction in Imperative Programming.
IEICE Transactions on Information and Systems,
Vol. E99.D,
Issue. 3,
p.
751.
Libal, Tomer
and
Volpe, Marco
2016.
Certification of Prefixed Tableau Proofs for Modal Logic.
Electronic Proceedings in Theoretical Computer Science,
Vol. 226,
Issue. ,
p.
257.
Rondogiannis, Panos
and
Symeonidou, Ioanna
2016.
Logics in Artificial Intelligence.
Vol. 10021,
Issue. ,
p.
447.
SERRANO, ALEJANDRO
and
HAGE, JURRIAAN
2017.
Constraint handling rules with binders, patterns and generic quantification.
Theory and Practice of Logic Programming,
Vol. 17,
Issue. 5-6,
p.
992.